Creative Integration: A Decidable Criterion of Creativity

# Creative Integration: A Decidable Criterion of Creativity
Source: [https://arxiv.org/html/2606.13977](https://arxiv.org/html/2606.13977)
###### Abstract

“Integrative” solutions are widely praised but rarely defined: we lack an operational way to tell a genuine integration — one that makes the world cheaper to describe — from a tidy re\-description\. Building on the lineage that treats creativity and intelligence as compression, we give such a criterion for*creative integration*\(CI\): the resolution of a real conflictA⊕BA\\oplus Bis CI if and only if, under a fixed description language, the description length strictly shrinks \(C=Lpre/Lpost\>1C=L\_\{\\text\{pre\}\}/L\_\{\\text\{post\}\}\>1\), with the reduction located in the conflict itself\. We make the judgment decidable through four binary, conjunctive gates, and we fix its extension through a taxonomy of pseudo\-integration that names and rejects the look\-alikes\. We back the criterion with a curated, multi\-domain corpus and — crucially — validate it not by human inter\-rater agreement but by four falsifiable tests it could fail: an independent computational check, discrimination against hard negatives, out\-of\-sample prediction, and description\-language robustness; all pass with margin\. The contribution is not “creativity is compression” but its decidability, discrimination, and corpus: on this account, what makes a move*genuinely*creative — rather than merely novel — is that it compresses a conflict, with novelty and value as downstream symptoms; whether*all*creativity is so constituted we state as an explicit conjecture\. We claim only the sign ofC−1C\-1; we judge, not generate\. The result is a citable primitive for a broader program\.

## §1 — Introduction

“Integrative” solutions are praised across science, design, and engineering: a theory that unifies two phenomena, an architecture that reconciles two competing demands, a move that dissolves an apparent trade\-off\. Yet praise outruns criteria\. We have no operational way to tell a*genuine*integration — one that makes the world cheaper to describe — from a showy re\-description that merely narrates two things as one\. Without such a criterion, “this is an elegant integration” is an aesthetic judgment, not a claim that can be checked\.

The gap\.There is a well\-developed lineage holding that creativity and intelligence are forms of compression \(Schmidhuber’s formal theory of creativity; Hutter’s compression\-equals\-intelligence; the MDL/Kolmogorov foundations\)\. That lineage gives the*currency*— shorter descriptions — but, for the question above, it stops short in three ways: it offers \(i\) no operational, per\-case criterion that decides whether a given resolution is a true integration, \(ii\) no discriminative boundary that separates real integrations from the many look\-alikes, and \(iii\) no labeled data on which either could be tested\. The thesis “creativity is compression” is, by itself, not yet a usable judgment\.

This paper\.We close that gap for the specific phenomenon of*creative integration*\(CI\): the resolution of a genuine conflictA⊕BA\\oplus Bby a unifying principle under which the description length strictly shrinks\. Our contributions are:

1. 1\.An operational definition\.CI holds iff, under a declared description language, the compression ratioC=Lpre/Lpost\>1C=L\_\{\\text\{pre\}\}/L\_\{\\text\{post\}\}\>1, estimated by a four\-category counting procedure \(principles / parameters / exceptions / boundaries\) whose reduction is*located in the conflict itself*— the boundary and exception terms collapse \(§3\)\.
2. 2\.A binary judgment rubric\.Four ordered, conjunctive gates \(conflict\-real, not\-orthogonal, compression, locus\-is\-conflict\); the first gate that fails decides the verdict and names the failure mode \(§4\)\.
3. 3\.A discriminative boundary\.A taxonomy of*pseudo\-integration*— cause\-elimination, orthogonal axes, sequencing, enumeration, codification, calibration, standardization, packaging — each anchored to the gate it fails, so the criterion is defined as much by what it rejects as by what it accepts \(§5\)\.
4. 4\.A labeled corpus and measurement validity\.A curated, multi\-domain corpus of 201 labeled cases \(§7\), validated not by human inter\-rater agreement but bymeasurement— four falsifiable tests the criterion could fail, on two axes: that the procedure measuresCC\(computational check, language robustness\) and that the verdicts are right \(discrimination, out\-of\-sample prediction\) \(§8\)\.

What this says about creativity\.On this criterion, what separates a*genuinely*creative move from a merely novel one is its integrative core — the compression of a conflict; novelty and value, the usual currency by which creativity is evaluated, are downstream symptoms \(§2\)\. We advance this as the paper’s reading of creativity\. Its strongest form — that*all*genuine creativity is creative integration — we state and examine as a falsifiable conjecture, not a result, in §10\.2\.

What we do not claim\.The novelty is not “creativity is compression” — that is the prior lineage\. It is the*decidability*, the*discrimination*, and the*corpus*that turn the thesis into a checkable criterion\. We claim only thesignofC−1C\-1, not its magnitude; we judge, we do not generate \(a generation method is deferred to follow\-on work\); and we do not here pursue the larger unification the program points toward — that creativity, life, and intelligence may share this structure\. This paper is a criterion and its validation — a citable primitive on which the rest of the program can build\.

## §2 — Related Work / Lineage

Our criterion descends from a recognized line of work that treats compression as the currency of creativity and intelligence; positioning it there makes clear that it is neither an isolated idea nor a restatement of that line, but a specific addition on top of it\.

Compression as creativity and intelligence\.Schmidhuber’s formal theory of creativity casts interestingness and creative behavior as*compression progress*— the rate at which an observer’s model of the world shortens \(Schmidhuber 2010\); it is our nearest neighbor and we share its vocabulary\. Hutter’s program makes the identification explicit at the level of intelligence — better compression is better prediction is more intelligence — and operationalizes it in the Hutter Prize \(Hutter 2005\); this is the same currency as ourC\>1C\>1\. The measurement of “description length” rests on minimum\-description\-length modeling \(Rissanen 1978\) and on Kolmogorov complexity \(Kolmogorov 1965\), which also supply the two caveats we must answer: description length is language\-relative and uncomputable in general\. We address both by fixing the description language per record and claiming only sign\-invariance, with a tractable pre/post counting approximation rather than trueK​\(⋅\)K\(\\cdot\)\(§3, §8, §9\)\.

Combining frames: bisociation and conceptual blending\.The act we formalize — resolving two conflicting frames into one — has been described richly, but never decidably\. Koestler’s*bisociation*casts creativity as connecting two self\-consistent yet habitually incompatible “matrices of thought” \(Koestler 1964\); Fauconnier and Turner’s*conceptual blending*\(which they also call conceptual integration\) projects two mental spaces into a blend with emergent structure \(Fauconnier and Turner 2002\) — and even names “compression” as a governing principle, though theirs is the semantic compression of*vital relations*across spaces, not description length\. Both name our phenomenon,A⊕BA\\oplus B, but describe*how*integration happens rather than deciding*when*it is creative: they separate neither a genuine integration from a routine blend nor supply a measurable, decidable handle\. We take their phenomenon and give exactly that\.

What creativity is, not just how it looks\.Computational creativity has largely operationalized creativity through its*symptoms*— novelty and value — and built evaluation on them: Boden’s combinational / exploratory /*transformational*taxonomy \(Boden 2004\), Wiggins’s formalization of creative systems as rule\-governed search over a conceptual space \(Wiggins 2006\), and criteria that score generative outputs for novelty and value \(Ritchie 2007; Colton 2008; Jordanous 2012\)\. But novelty and value are downstream signs, not the thing itself — noise is novel, and value is adjudicated by the very human agreement that cannot settle what is genuinely creative \(§8\)\. We propose instead a*constitutive*reading: what makes a move genuinely creative, rather than merely novel, is that it*compresses*— it resolves a real conflict into a description strictly shorter than holding its terms apart — and creative integration is that property made decidable\. This inverts the usual relation to the evaluation literature: we are not measuring a corner of creativity but proposing a definition of its core, of which novelty and value are consequences\. Because the test is structural, it is also agent\-neutral \(§3\.2\): it answers, decidably, a question that perception\-based evaluation cannot settle — whether a*machine’s*act is creative \(Colton 2008\) — by judging the act’s structure, not the agent’s intent \(developed in §10\.2\)\. Boden’s*transformational*creativity — reshaping the rules of a space — is the nearest prior form;C\>1C\>1says when such reshaping is creative rather than merely different\. What this paper establishes is the criterion and its measurement validity for integration; whether*all*genuine creativity is so constituted we take up, as a falsifiable conjecture, in §10\.2\.

Explanatory unification\.In philosophy of science, the value of a unifying theory has been analyzed as a reduction in the number of independent argument patterns needed to explain the phenomena \(Friedman 1974; Kitcher 1981, 1989\) — explanation as a kind of compression\. This is conceptually adjacent to CI restricted to scientific theories, and a natural bridge; we keep its full development for a later, history\-of\-science paper and use only consensus scientific integrations \(e\.g\. Maxwell\) here as*calibration*exemplars \(§7\), not as historiographical claims\.

The delta\.None of these lines provides what a practitioner needs to*judge a given case*: a per\-case operational criterion, a discriminative boundary that names and rejects the look\-alikes, or a labeled corpus against which the criterion can be tested\. The compression thesis tells us what to value; it does not, on its own, decide whether a particular resolution is a true integration or a tidy re\-description\. Supplying that decidable criterion, its discriminative taxonomy, and the data to validate it — by measurement rather than by agreement — is the contribution of this paper\.

## §3 — Definition: CI as Compression

We define Creative Integration as an event in description length: integrating two conflicting forces is*creative*when the result explains at least as much while costing strictly less to describe\. This section makes that precise, gives the counting handle we use to measure it, and fixes the one degree of freedom an information\-theoretic reader will ask about — the description language\.

### 3\.1 Description\-length decomposition

LetAAandBBbe two forces that resist simultaneous maximization under some pre\-integration framing, writtenA⊕BA\\oplus B\. Following minimum\-description\-length modeling \(Rissanen 1978; Kolmogorov 1965\), we measure a system by its description lengthL​\(⋅\)L\(\\cdot\)under a fixed language\. Holding the unintegrated pair costs more thanL​\(A\)\+L​\(B\)L\(A\)\+L\(B\): keeping two accounts from colliding incurs bookkeeping, so

L​\(A⊕B\)=L​\(A\)\+L​\(B\)\+L​\(boundary\)\+L​\(exceptions\),L\(A\\oplus B\)=L\(A\)\+L\(B\)\+L\(\\text\{boundary\}\)\+L\(\\text\{exceptions\}\),
whereL​\(boundary\)L\(\\text\{boundary\}\)pays for the rules saying*which account applies when*andL​\(exceptions\)L\(\\text\{exceptions\}\)pays for itemizing phenomena neither covers cleanly\. These two terms are the signature of an unintegrated conflict: each new configuration risks a new boundary rule or exception\.

### 3\.2 The CI condition

A creative integration introduces a unifying principle under which the boundary and exception terms collapse — the two forces turn out to be one thing seen from two sides\. WritingLpre=L​\(A⊕B\)L\_\{\\text\{pre\}\}=L\(A\\oplus B\)andLpostL\_\{\\text\{post\}\}for the unified account*in the same language*, we summarize the reduction by the compression ratio

C=LpreLpost,CI⇔C\>1,C=\\frac\{L\_\{\\text\{pre\}\}\}\{L\_\{\\text\{post\}\}\},\\qquad\\text\{CI\}\\iff C\>1,
observably so, with the reduction located inL​\(boundary\)\+L​\(exceptions\)L\(\\text\{boundary\}\)\+L\(\\text\{exceptions\}\)\.

Two qualifiers carry weight\. CI isbinary, not a graded quality score: a candidate either crosses the four gates of §4 \(of whichC\>1C\>1is G3\) or it does not, andC≈1C\\approx 1is a tidier restatement, not CI\. And thelocusmatters: a reduction obtained by bundling decisions under one policy, while boundaries and exceptions re\-appear case by case, is packaging, not integration — this is what gate G4 checks \(§4, §5\)\.

The definition is*neutral to the integrating agent*\. Whether the conflict is compressed by a human reasoner, by a cultural process, or by nature itself, only the structure — a real conflict, compressed at its locus — decides\. We tag this agent as theactor∈ \{human, natural, cultural\}: it records*who*integrated, never*whether*the result counts\. Hence “it is natural, therefore not CI” is not available as a verdict \(§4\.2\), and the corpus spans all three actors \(§7\), with the natural and cultural cases developed in follow\-on work\.

### 3\.3 Four\-category counting \(the operational handle\)

L​\(⋅\)L\(\\cdot\)is Kolmogorov\-uncomputable in general, but the comparison we need — pre vs\. post in one language — is tractable through a*counting approximation*: we tally four categories before and after, each as a fixed countor a scaling orderin a problem\-size parameterNN\.

CategoryWhat is countedprinciplesaxioms, basic laws, governing assumptionsparametersfree parameters, per\-configuration specifications, initial/boundary dataexceptions“except when …” phenomena requiring individual treatmentboundariesrules selecting which account/method applies whereWorked example — Maxwell \(electricity⊕\\oplusmagnetism\)\.*The conflict:*electricity and magnetism were separate force\-laws carrying a standing asymmetry — a moving magnet and a moving conductor produce the same current by*different*rules — together with a clash between Ampère’s law and charge conservation; the two genuinely competed\.*The integration & count:*one electromagnetic field in four coupled equations\. Counting in classical vector\-field language:

CategoryPre\-integration \(separate E and B\)Post\-integration \(one EM field, 4 equations\)principles≈ 5–6 independent empirical laws \(Coulomb/Gauss, no\-monopole, Biot–Savart, Ampère, Faraday\)one electromagnetic field,4 coupled equationsparametersa solution per source geometry,O​\(N\)O\(N\)boundary/initial conditions,O​\(1\)O\(1\)exceptionsmoving\-magnet/moving\-conductor asymmetry; Ampère vs\. charge conservationnone standing \(displacement current removes them\)boundaries“electric or magnetic?” regime splitnone — E and B are frame\-dependent parts of one fieldtotal≈6\+O​\(N\)\+\(growing\)\+1\\approx 6\+O\(N\)\+\(\\text\{growing\}\)\+14\+O​\(1\)4\+O\(1\)The reduction lands exactly inL​\(boundary\)L\(\\text\{boundary\}\)\(the “electric or magnetic?” split\) andL​\(exceptions\)L\(\\text\{exceptions\}\)\(the induction and continuity anomalies\) — the locus the gates of §4 check\.*The tell:*a phenomenon*outside*the original conflict — light as an electromagnetic wave — falls out as a prediction; genuine compression buys new reach, a re\-description does not\.

Recording format\.Each corpus record fixes adescription\_language, tallies the four categories for pre and post as fixed counts or scaling orders, and states the ratio together with a*vividness signature*— the single collapse point \(here, the displacement\-current term that erases the Ampère/continuity exception and predicts light\)\. We count*generative*description length — the cost to reconstruct the phenomena, not the volume of data they contain — so a structure that derivesNNfacts fromO​\(1\)O\(1\)rules compresses even as the cases it covers grow\.

### 3\.4 Fixing the description language

CCis defined only relative to a language, and its magnitude is language\-dependent — the Kolmogorov objection \(e\.g\. relativity is short in tensor language, long in Newtonian\)\. We therefore \(i\) declaredescription\_languageper record and count pre/post in the same language, and \(ii\) claim only the invariance ofsign⁡\(C−1\)\\operatorname\{sign\}\(C\-1\)across admissible languages, never the value ofCC\. For Maxwell, any reasonable physical language counts the unified field as shorter; the*sign*is what is determined\. Robustness of this sign is measured in §8 \(T4\) and the objection answered in §9\.

### 3\.5 Scaling analysis

The deepest compression shows up as a lower scaling*order*, not a smaller constant\. LetNNindex distinct electromagnetic configurations\. The pre\-integration account needs configuration\-specific solutions and accretes an exception per new time\-varying case —O​\(N\)O\(N\); the four field equations generate every configuration from boundary conditions —O​\(1\)O\(1\):

C∼O​\(N\)O​\(1\)⟶∞\(N→∞\),C\\;\\sim\\;\\frac\{O\(N\)\}\{O\(1\)\}\\;\\longrightarrow\\;\\infty\\quad\(N\\to\\infty\),
and≫1\\gg 1even at fixed, modestNN\. ThisO​\(N\)→O​\(1\)O\(N\)\\to O\(1\)collapse is the recurring fingerprint of CI across the corpus \(§7\), and the same scaling test exposes*enumerative*pseudo\-integration in §5 — a “unification” whose specification grows with the problem is not compression in disguise\.

## §4 — The Judgment Rubric: Four Gates

The definition of §3 becomes operational as a short, ordered checklist\. We make judgmentbinary and conjunctiverather than a graded score, because each way of failing CI is a*different, nameable*error that a single number would blur\. A candidate must pass four binary gates; failing any one is disqualifying, and the identity of the failing gate is the diagnosis — it selects the pseudo\-integration class of §5\. \(This is kept separate from the corpus’s auxiliary confidence scores, which measure record quality, not the verdict; two records can tie on them while the gates cleanly separate one as CI and the other as not\.\)

The definition is a single inequality — CI ⟺C\>1C\>1\(§3\.2\) — so why four gates rather than one? BecauseC=Lpre/LpostC=L\_\{\\text\{pre\}\}/L\_\{\\text\{post\}\}is read off the counting approximation of §3\.3, and a number that*looks*likeC\>1C\>1can be inflated in four independent ways\. Each gate closes one of them, guarding a different part of the ratio:

GateWhat part ofC=Lpre/LpostC=L\_\{\\text\{pre\}\}/L\_\{\\text\{post\}\}it protectsThe fake “C\>1C\>1” it blocksG1 conflict\_realthenumerator is a real conflict costa missing prerequisite inflatedLpreL\_\{\\text\{pre\}\}; the “reduction” is cause\-elimination, not integrationG2 not\_orthogonalthe numeratorhas something to compress\(L​\(boundary\)\+L​\(exceptions\)\>0L\(\\text\{boundary\}\)\+L\(\\text\{exceptions\}\)\>0\)A⟂BA\\perp B, soLpre=L​\(A\)\+L​\(B\)L\_\{\\text\{pre\}\}=L\(A\)\+L\(B\)with no boundary/exception term — nothing to collapseG3 compressiontheratio itself, and the denominatorLpostL\_\{\\text\{post\}\}was shrunk by enumeration / codification / calibration / sequencing — an accounting trick, not a discovered axisG4 locus\_is\_conflictwherethe reduction lands \(the “located inL​\(boundary\)\+L​\(exceptions\)L\(\\text\{boundary\}\)\+L\(\\text\{exceptions\}\)” clause of §3\.2\)the count is\>1\>1but by bundling decisions; boundaries and exceptions re\-appear case by caseSo the gates are not four criteria competing withC\>1C\>1— they are the four ways to fake it, each ruled out\.G1 and G2 secure the numerator\(there is a genuine conflict cost to compress\);G3 measures the ratio and guards the denominator\(the shrink is a discovered axis, not a trick\);G4 fixes the locus\(the shrink is in the boundary/exception terms\)\. Passing all four meansC\>1C\>1*honestly*: a real conflict, compressed at its locus\. The failures are nested — there is no denominator worth checking before the numerator is a real conflict — so order matters, and the first failing gate is the diagnosis that names the §5 pitfall\.

### 4\.1 The four gates

Each gate returns\{pass, evidence\}\. The order matters: the first two test whether the*conflict is real at all*, the last two whether a real conflict was actually*compressed*\.

GateQuestionIf it fails → pitfall \(§5\)G1 conflict\_realWould supplying a missing prerequisite make the conflict disappear?cause\_eliminationG2 not\_orthogonalDoAAandBBactually compete, or is “just do both” the answer?orthogonal\_axesG3 compressionIsLpost≪LpreL\_\{\\text\{post\}\}\\ll L\_\{\\text\{pre\}\}\(C\>1C\>1\) via a discovered axis — not enumeration, codification, calibration, or sequencing?sequencing/enumerative\_protocol/codification/standardization/calibrationG4 locus\_is\_conflictIs the locus of compression the conflict itself — doL​\(boundary\)L\(\\text\{boundary\}\)andL​\(exceptions\)L\(\\text\{exceptions\}\)vanish — not a packaging of decisions?organizational\_packagingG4 is the subtle one: a candidate can show an apparent reduction yet have its boundaries and exceptions re\-appear case by case — bundling decisions under one policy without dissolving the tension\.

### 4\.2 Verdict assignment

Evaluationshort\-circuits: the first failure stops the process and fixes the verdict and pitfall\.

- •ci— all of G1–G4 pass,*and*the actor\-specific generativity requirement holds \(forhuman/cultural, competing descriptions genuinely pre\-exist; fornatural, competing physical regimes genuinely co\-exist\)\. Theactor∈ \{human, natural, cultural\} is always emitted but does not affect the verdict\.
- •not\_ci— any gate fails; the pitfall is the §5 name of the*first*failing gate\.
- •review— the record lacks information to decide a gate\. The rule is conservative:when unsure, do not tip toci; tip toreview\.

Two clarifications matter for G3:L​\(⋅\)L\(\\cdot\)is a*generative*description length — a structure derivingNNfacts fromO​\(1\)O\(1\)rules compresses even as the cases grow — andsuccessful prediction of unseen cases is evidence for compression, not against it\(a compact structure recovering unseen cases at near\-zero marginal cost is exhibiting the regularity it compressed\)\.

### 4\.3 Maxwell through the gates

*The conflict:*electricity⊕\\oplusmagnetism — separate force\-laws that genuinely contend \(a changingEE*produces*BB\), carrying the induction asymmetry and the Ampère/continuity clash \(§3\)\.*Through the gates:*G1passes — no added prerequisite removes the asymmetry, so this is not cause\-elimination;G2passes —EEandBBgenuinely compete, not “just do both”;G3passes — the unified field gives≈6\+O​\(N\)→4\+O​\(1\)\\approx 6\+O\(N\)\\to 4\+O\(1\)\(§3\.3\);G4passes — the electric/magnetic boundary and the induction/continuity exceptions*disappear*rather than being repackaged\.*The verdict & tell:*all four pass ⇒verdict = ci,actor = human\(calibration set, §7\); and the light prediction \(§3\.3\) is the empirical tell that the verdict is earned, not talked into\.

### 4\.4 Figure — gate flowchart

candidateA⊕BA\\oplus BG1 conflictreal?G2 notorthogonal?G3C\>1C\>1?G4 locus isthe conflict?verdict:cicause\_eliminationorthogonal\_axessequencing / enumerative /codification / …organizational\_packagingyesyesyesyesnonononoFigure 1:The four\-gate decision flow\. Evaluation short\-circuits at the first failing gate, which names the pitfall \(§5\); insufficient information yieldsreview\(omitted for clarity\)\.

## §5 — The Discriminative Boundary: Pseudo\-Integration

A criterion that only confirms the obvious cases is a rubber stamp; the discriminative power of CI lies in what it*rejects*\. The positive condition \(C\>1C\>1, located in the conflict\) is easy to satisfy*rhetorically*— almost any tidy re\-description can be narrated as “unifying two things” — so the work is done by refusing the narration when a gate fails\. A rubric that firescion look\-alikes measures fluency; one that rejects them discriminates\. We therefore define CI as much by its negative space — a taxonomy of pseudo\-integration — as by its positive condition, with each pitfall anchored to the first gate it fails \(§4\)\. §8 \(T2\) reports the rejection rates; here we fix*what*must be rejected and*why*\.

### 5\.1 The pitfall taxonomy

Representative classes \(the table is illustrative, not exhaustive\)\. Each row follows the same three beats as the worked cases —*why it looks integrative*\(the symptom, with a real rejected example, largely from AI governance and embodied skill\), the*gate it fails*, and the*tell*: what a genuine CI has that the look\-alike lacks\. Read the symptom column if a particular example is unfamiliar\.

PitfallWhy it looks integrative \(symptom — example\)FailsThe tell: a CI instead…cause\_eliminationthe conflict vanishes once a missing prerequisite is supplied — RLHF: “no reward signal” dissolves once a reward model is trainedG1…has forces that still compete with every prerequisite suppliedorthogonal\_axesAAandBBco\-exist, “just do both” works — capability vs\. safety benchmarks \(e\.g\. HELM\), no trade\-offG2…hasA,BA,Bthat cannot both be maximized — a real boundary termsequencingan imposed time\-order encoding nothing — a drill’s phase labels \(“recall / follow\-through”\)G3…lets the order*encode*an axis that compressesenumerative\_protocolone abstract rule whose body is a per\-case spec growing withNN— a “gate\-above\-threshold” rule that is a stack of per\-tier specsG3…derives the cases fromO​\(1\)O\(1\)rules, not enumerates themcodificationan axis practitioners already used, written down — a risk×mitigation tiering policyG3…discovers a new axis, not formalizes an old onecalibrationparameters / mix\-ratios tuned, no new control variable — fitting an inverted\-U \(arousal vs\. performance\)G3…introduces a new control variablestandardizationan industry\-wide format/spec agreed — coordination,L​\(A⊕B\)L\(A\\oplus B\)unchangedG3…reducesL​\(A⊕B\)L\(A\\oplus B\), not just aligns conventionsorganizational\_packagingdecisions bundled under one policy — a release\-tiering policyG4…dissolves the boundary; here it re\-appears per tier\(One further class is*conditional*rather than a pure pitfall — applying a*known*CI pattern to a new domain: it is admissible as CI only if it re\-achievesC\>1C\>1in that domain and declares its lineage; a bare re\-application is codification \+ standardization\.\) By contrast, Maxwell \(§3–§4\) survives every gate precisely*because*it is none of these: the boundary and exceptions are removed, not codified, repackaged, or enumerated, and the unification predicts a new phenomenon rather than re\-labeling old ones\.

### 5\.2 The discrimination test: rejecting dissolved paradoxes

A*dissolved paradox*is an apparent conflict that, on inspection, was never real — the two sides do not actually compete, or the tension disappears once a missing premise is supplied\. The correct verdict isnot\_ci\(nothing to integrate\), and the rubric reaches it early, at the G1/G2 gates that test whether the conflict is real at all\. This is a sharp test of the criterion itself: rejecting such a case shows it is judging*structure*, whereas accepting it shows it has been fooled by*presentation*— rewarding a candidate for*sounding*paradoxical rather than for compressing a real conflict\. We therefore treat the rejection rate on dissolved paradoxes as a first\-class discrimination signal \(§8, T2\), alongside rejection of the §5\.1 pitfalls\.

## §6 — Operationalization: Applying the Gates with an LLM

The prior sections fix*what*CI is and*how*to test it — the four gates\. This section is about how we actually run that test over the corpus, and, just as importantly, what that procedure does and does not establish\.

Because the gates are binary, ordered, and mechanical, applying them is a matter of following the rubric literally, not exercising taste\. Each record in the finished corpus \(§7\) carries a fixed, human\-verified CI label; the applicator never sees it\. We embed the four\-gate rubric of §4 in a prompt and run a language modelhuman\-blind— given the record’s descriptive fields and the rubric alone, it must decide the verdict for itself\. For each record it emits a structured result — per\-gate\{pass, evidence\}, theverdict\(ci / not\_ci / review\), thepitfallon failure, theactor\(human / natural / cultural\), and an advisorycompression\_estimate\(description language, pre/post totals, ratio\) — with a one\-line rationale\. This field list is the complete output schema; reproducing the §8 numbers needs only the corpus \(§7\), the frozen criterion text, and this schema\. \(Thatcompression\_estimateis advisory; the system of record forCCis the human four\-category count of §3\.3\.\)

We ran the rubric through several independent model families and the verdicts were consistent\. It is worth being exact about what that does and does not buy, because two failure modes are easy to conflate:

- •Could the model simply tell us what we want?This is what*human\-blind*application rules out: with the ground\-truth label hidden, the applicator cannot parrot a desired answer — it has only the fields and the rubric\. Running many models would*not*fix this on its own \(models can share a leaning\), so the control here is the blind, not the head\-count\.
- •Does cross\-model agreement prove the verdicts are right?No\. A language model faithfully reproduces whatever rubric it is given, so agreement across models shows only that the rubric ismechanically single\-valued— an astrology rubric would agree with itself just as well\. Agreement is therefore reported only as an auxiliary*determinacy*signal \(§8\.5\), never as validity\.

Validity is carried instead by the four tests of §8, each pitting the applicator against something it could genuinely disagree with\. Two probeprocess validity— that the procedure measuresCCand not an artifact of wording: an independent compression count \(T1\) and paraphrased description languages \(T4\)\. Two probeoutcome validity— that the verdicts are right and not curve\-fit: deliberately constructed hard negatives \(T2\) and unseen held\-out cases \(T3\)\. The LLM is the instrument that lets those tests run at scale — not the source of their authority\.

## §7 — The Corpus

The criterion is backed by a labeled corpus assembled in an internal curation system\. We describe its size, label distribution, domain spread, and the calibration backbone that gives the rubric face validity\.

### 7\.1 Scale and label distribution

The corpus is the set of records that carry a finalized CI verdict:201 records — 52 positives \(ci\) and 149 negatives \(not\_ci\)\. The positives are confirmed creative integrations; the negatives are the boundary cases of §5\. This is the dataset on which every validity claim in §8 is computed — the TPR and TNR denominators of §8\.2 are exactly these 52 and 149\.

### 7\.2 The negatives carry the discrimination

A criterion defined by its boundary \(§5\) needs negatives, and the corpus is negative\-heavy by design: 149 of the 201 records arenot\_ci\. Each negative is tagged with the pitfall class it instantiates — the human/cultural core being the §5 taxonomy: cause\_elimination 98, codification 16, orthogonal\_axes 12, sequencing 9, enumerative\_protocol 7, organizational\_packaging 2, calibration 1, plus the natural\-actor look\-alikeinterpretive\_discovery4 \(developed in follow\-on work\)\. These are the hard negatives that T2 \(§8\.2\) must reject, and their spread across the taxonomy is what lets us report*per\-pitfall*discrimination rather than a single aggregate\.

### 7\.3 Domain spread and the calibration backbone

The 201 records span61 domains\. The larger clusters include western\_music \(20\), legal \(14\), piano\_skill \(14\), medical \(12\), philosophy \(12\), organ\_evolution \(12\), painting \(11\), life\_evolution \(10\), coaching \(8\), mathematics \(7\), and architecture \(6\)\. The breadth supports the actor\-neutrality and domain\-generality developed in follow\-on work, but here it is deliberatelynotthe load\-bearing claim \(§8 reports a single clean validation; breadth is for the broader program, §10\)\.

Within the positives, a smallcalibration backbonedoes specific work: consensus mathematical and chemical integrations \(mathematics 7, of which 6ci; chemistry 1ci\) serve as*worked examples*on which the rubric must fireciwithout requiring domain\-expert review — they give face validity cheaply\. These are consensus cases any reader can check unaided; the rubric firescion each and rejects the §5 look\-alikes that share their surface vocabulary of “reconciling two forces”:

ConsensusciConflictA⊕BA\\oplus BUnifying principleCCMaxwell \(running example, §3–§5\)electricity ∧ magnetismone EM field, 4 equationsO​\(N\)→O​\(1\)O\(N\)\\to O\(1\)Special relativityspace ∧ timespacetime \+ invariantcc\>3\>3\(7 ether assumptions → 2 postulates\)Complex planealgebra ∧ geometryℂ\\mathbb\{C\}as the plane≫1\\gg 1\(Maxwell and special relativity serve as the paper’s running examples and as held\-out worked examples in §8; the complex plane is among the corpus’s mathematics positives\.\)

### 7\.4 Schema

Each record is stored across a relational schema \(~15 tables\) capturing the verdict/pitfall/actor fields, the axis annotations \(AA,BB,CCand the construction\), the construction mechanism, the surface/abstract/root conflict levels, the integration, chronology, and domain\. The compression calculation follows the recording format of §3\.3\.

## §8 — Validation = Measurement Validity

### 8\.0 What validity means here

Humans err and language models err; a correct verdict is a probabilistic outcome, not a guarantee\. The question is thereforenotwhether raters*agree*— agreement measures consensus, not correctness, and human or model raters can agree on a wrong answer\. \(Cross\-model agreement is for this reason*determinacy*, not validity; §6\.\) The question is whether the rubric is avalid measurementof the objective quantity it approximates,sign⁡\(C−1\)\\operatorname\{sign\}\(C\-1\)\.

A measurement is valid on two axes, and we test each directly:

- •Process validity— the procedure measures the intended quantity, not an artifact of how a case is phrased\.*Does the verdict track an independent computation ofCC*\(T1\)?*Is it invariant when the same structure is re\-expressed*\(T4\)?
- •Outcome validity— the verdicts are correct, not curve\-fit to the labels\.*Does the rubric reject hard look\-alikes, including ones constructed after it was frozen*\(T2\)?*Does it hold on cases it never saw*\(T3\)?

Each test is pre\-registered: the criterion is frozen \(commit hash\), the test set is fixed \(hashed\), and the passing bar is declaredbeforeresults are seen\. Independence is enforced two ways — the applicator runshuman\-blind\(§6\), and the*counting*ofCCruns on a pathseparatefrom the*gating*\(the counter never sees the verdict, the judge never sees the count\)\.

Each test follows three beats — what its*failure*would mean \(the threat it guards\), the pre\-registered*bar*it must clear, and the*measured*result \(the tell, with its margin\):

AxisTestIf it failed \(the threat\)Pre\-registered barMeasured \(the tell\)ProcessT1computational checkthe verdict is a vote, not a measurement ofCCsign\-agreement ≥ 0\.851\.00\(primary\), 0\.933 \(2nd family\); inter\-counter 0\.933ProcessT4robustnessthe verdict tracks wording, not structuresign\-invariance ≥ 0\.901\.00OutcomeT2discriminationthe rubric is a rubber stampTNR ≥ 0\.80, dissolved ≥ 0\.95, TPR ≥ 0\.80TNR1\.00, dissolved1\.00, TPR ≈1\.00OutcomeT3prediction \(OOS\)the rubric is a post\-hoc frameheld\-out drop ≤ 10 ppdrop≤ 1\.6 ppAll four pass with margin\.111ForT2, the*Measured*column reports the expanded held\-out set \(hard negatives constructed after the criterion was frozen, plus held\-out positives\); the corpus\-internal rates are lower — TNR 0\.986, TPR 0\.865 — and are given in §8\.2\.The subsections give each test’s design and its honest caveat\.

### 8\.1 T1 — Computational check \(process validity\)

A blind counter fixes thedescription\_language, tallies the four categories pre/post, and computesCCwithout seeing the verdict; the judge applies the gateswithout seeing the count; we comparesign⁡\(C−1\)\\operatorname\{sign\}\(C\-1\)against the verdict\. Were the verdict a vote rather than a measurement, the two paths would diverge — they did not\. Sign\-agreement was15/15 = 1\.00\(primary family\) and 14/15 = 0\.933 \(a second, independent family\); inter\-counter agreement \(a third party re\-counting a sub\-sample\) was 0\.933; and theCCdistributions ofciandnot\_ciseparate cleanly at11\. The single second\-family disagreement is reported, not hidden; the granularity threat is addressed by publishing the counting protocol \(§3\.3\) and the inter\-counter rate\.

### 8\.2 T2 — Discrimination \(outcome validity\)

A rubber stamp scores TPR = 1, TNR = 0, soTNR is the deciding metric\. Hard negatives come from \(a\) the corpus’s pitfall\-taggednot\_cirecords and, crucially, \(b\)newly constructedpseudo\-integrations \(codification, standardization, sequencing, dissolved paradoxes\) authored after the criterion was frozen — so success cannot be curve\-fitting to the curator’s labels; true CIs are included for TPR\. On the corpus, TNR = 0\.986 / TPR = 0\.865; on the expanded held\-out set, TPR = 21/21 ≈1\.00, TNR = 16/16 =1\.00, withdissolved\-paradox rejection = 1\.00\. We report corpus\-internal and out\-of\-corpus rates separately so the discrimination is visibly not an artifact of the labeling source\.

### 8\.3 T3 — Prediction / out\-of\-sample \(outcome validity\)

A post\-hoc frame fits its own examples; a measurement holds on unseen cases\. On a 3\-actor held\-out set \(human / natural / cultural,n=37n=37\), held\-out computational agreement was37/37 = 1\.00\(primary; 36/37 = 0\.973 second\) — adrop of ≤ 1\.6 ppagainst development, well inside the ≤ 10 pp bar\. Two clarifications: this is the prediction of*judgment*, not*generation*\(whether the method can*generate*integrations is a separate question, §10, with its own ≈ 22\.5% held\-out — not to be conflated\); and held\-out validity requires the discriminating evidence to be*self\-contained in the visible fields*— an earlier organ\-evolution held\-out failed this \(it measured input quality\) and was re\-curated \(§8\.5\)\.

### 8\.4 T4 — Robustness \(process validity\)

Against the Kolmogorov objection we claim only thatsign⁡\(C−1\)\\operatorname\{sign\}\(C\-1\)is invariant under an admissible class of language changes — natural\-language swaps \(JA↔EN\), alternative valid formalizations/granularities, re\-expression by a different agent — forbidding information injection/deletion and adversarially shrinking/inflating languages\. The sign was preserved4/4 = 1\.00\. Magnitude varies, as expected — which is precisely why we claim only the sign \(§3\.4, §9\)\.

### 8\.5 Methodological note: self\-contained held\-outs

A held\-out tests the*rubric*only if the fields visible to the applicator contain the evidence needed to decide the gates; built on fragile skeletons it silently tests input quality instead\. The organ\-evolution held\-out failed exactly this way; we surfaced it, re\-curated so the discriminating evidence is self\-contained, and recovered generalization — documenting the negative result because it is part of the validity argument\. \(Cross\-model agreement — within\-family 0\.867, cross\-family 15/15 = 1\.00 — is reported only as determinacy, §6: it shows the rubric is single\-valued, not that it is right, and is subordinate to T1–T4\. The residual circularity that remains is addressed in §9\.\)

## §9 — Threats to Validity

Three objections come from information theory and one from research methodology\. Each follows three beats — the*objection*,*why it misses*, and the*tell*: the one claim under which it would actually bite — and is argued in full in the cited section rather than restated here\.

ObjectionWhy it missesIt would bite only if…Argued inCCis description\-language dependent\(Kolmogorov\)we claim only the*sign*ofC−1C\-1, never its magnitude…we claimedCC’s value — which we never do§3\.4, §8\.4Kolmogorov complexity is uncomputablewe never computeKK; only a pre/post count under a fixed language…the criterion required trueKK— it does not§3\.3, §8\.1Reflexivity — “true by whose criterion?”compression is independently measurable, so the rubric is checked against a quantity outside itself and unseen cases…the criterion were self\-certifying — it is checked externally§8\.1, §8\.3Single\-curator labelsvalidity rests on measurement, not inter\-rater agreement: label ⊥ computation \(T1\) and author ⊥ applicator \(human\-blind\)…the labels were the ground truth — but the independent count is§8\.0, §6One honest residue remains: the curator’s labels are shared across records and judgment enters the counting protocol, so we claim measurement validity on the corpus,notfull independence\. A separate labeling team \(true inter\-rater reliability\) is future work \(§10\)\.

## §10 — Limitations & Future Work

### 10\.1 This paper within the program

This paper is the first step of a larger program\. The eventual goal is a unified account of creativity — and, we suspect, of the same pattern in life and intelligence — ascompression: the resolution of a standing conflict into a representation strictly shorter than holding its terms apart\. That synthesis isnot asserted here; it has to be*earned*, by establishing several independently testable pieces and only then combining them:

1. 1\.What a creative integration is— a decidable definition that separates it from its look\-alikes\.
2. 2\.That the category is actor\-neutral— natural processes \(e\.g\. the evolution of an organ\) instantiate the same structure, not only deliberate human reasoning\.
3. 3\.That integrations encoding inner or expressive experience compress as well— e\.g\. in music — extending the account beyond the propositional\.
4. 4\.That the method can*generate*integrations, not only judge them— reported honestly, including where it is weak on benchmarks \(an early generation held\-out sits at ≈ 22\.5%\)\.
5. 5\.That applying the method yields better outcomes on real tasks— a practical\-utility claim, on a different evidential axis from the measurement validity of this paper\.
6. 6\.That the same boundary doubles as a taxonomy of problem\-solving methods— the look\-alikes rejected here are not merely errors but the appropriate moves for different conflict structures \(eliminate a cause, separate independent axes, sequence or standardize, package decisions\), with creative integration as the limiting case that*dissolves*the conflict rather than separating or managing it\.

We publish these in dependency order rather than as one grand claim, so each can be refuted on its own; the integrative synthesis is reserved for a later, book\-length treatment built*on*the validated pieces rather than asserted ahead of them\.

Against that map,the present paper establishes piece \(1\)— the definition, its gates and pitfall boundary, and themeasurement validity of the judgment— on a single clean evaluation\. Its boundaries are therefore the pieces it does*not*yet cover:

- •Judgment, not generation\.We decide whether a resolution is a creative integration; we do not produce one\. That is piece \(4\)\.
- •Breadth is shown, not claimed\.The corpus spans many domains, but here they serve as breadth and calibration; actor\-neutrality and expressive cases \(pieces 2–3\) are argued in their own right elsewhere, in their own fields\.
- •Utility is a separate axis\.Measurement validity does not establish that*using*the method helps in practice; that is piece \(5\)\.
- •Curation independence\.The corpus is author\-curated and judged primarily by a single curator\. We mitigate this with measurement validity \(label ⊥ computation, author ⊥ applicator\) rather than human inter\-rater agreement — a deliberate choice \(§8\.0, §9\) — and ship the instrument for two further human\-label checks:\(a\)test\-retest / intra\-rater reliability \(same curator, verdict\-blind, rubric\-only\), runnable now; and\(b\)a true inter\-rater check by an independent rater, which remains open as no independent rater is yet secured\. Full independence is future work\.

### 10\.2 Discussion — a conjecture: is genuine creativity identical to CI?

The constitutive reading of §2 invites a stronger,*eliminative*conjecture, which we state plainly as a target for refutation:genuine creativity*is*creative integration — what has no integrative core is novel, perhaps surprising, but not creative\.Three observations make the bet serious\. \(i\) Across Boden’s types, the cases people robustly call creative carry a*resolved tension*, whereas merely additive combinations or routine exploration — novel but not felt as creative — do not\. \(ii\) Even the apparent hard case, an elegant new proof of a*known*theorem, is integration: the original proof is long \(LpreL\_\{\\text\{pre\}\}large\), the elegant one collapses it in a single structural move — a homomorphism, a duality, a bijection — withC≫1C\\gg 1located in exactly that operation \(the algebra/geometry bridge of the complex plane, our calibration case, is of this kind\)\. \(iii\) Schmidhuber’s compression\-progress already implies a resolved tension — the observer’s current model versus a shorter one — in every act we find interesting\.

The conjecture isnotvacuous, because the locus gate \(§4, G4\) keeps it falsifiable: a description that is merely shorter by better encoding \(codification, §5\) is*not*CI; only compression*located in an explicit integrating operation*counts\. So “elegant ⇒ creative ⇒ CI” holds for the illuminating cases and fails for mere re\-encoding — a line one can check, not assert\. We have found no genuinely creative act that is mere novelty without integration, and weinvite the counterexample: the criterion can adjudicate any candidate\. The discipline the conjecture demands is to keep the conflict*content\-level*and gate\-checked; were we to let it become purely epistemic — any shortening read post hoc as resolving “an expectation” — the claim would be true by construction, and worthless\.

This also sharpens what CI offers*generation*\(piece 4\): for an open problem, where no solution is yet known, CI is not a solver but asearch heuristic— diagnose the conflict’s type and try the corresponding integrating operation \(a representation bridge for two structures that will not talk; an invariant for local\-versus\-global; a product for two independent structures\)\. It narrows the search without guaranteeing the operation exists — and when none does, the impossibility can itself be a higher\-order integration \(as in the account of which equations are solvable by radicals\)\.

A corollary sharpens the agent\-neutrality of §3\.2\. Because the criterion judges an act’s*structure*, not its author’s intent or experience,machine creativity becomes decidable— not, as in perception\-based evaluation, a matter of whether observers attribute it \(Colton 2008\)\. If a language model resolves a hard problem by an integration that compresses a real conflict — a refactor that collapses two requirements that had been fighting, so a class of special cases disappears \(C\>1C\>1at the locus\) — the act is a CI on exactly the test applied to humans, and is creative; a one\-line fix that merely removes the immediate cause is competent but, by G1, not\. The criterion thus separates*creative*machine work from merely*correct*machine work, decidably — and it is here, on real tasks, that the search heuristic above and the practical\-utility piece meet: an agent that diagnoses a conflict and applies the integrating operation is doing creative work whose value is independently checkable\.

## §11 — Conclusion

Creative integration can be defined, judged, and verified as a decidable compression event\.*What it is:*under a fixed description language, a resolution of a real conflictA⊕BA\\oplus Bis a CI exactly when the description strictly shrinks \(C\>1C\>1\), with the saving located in the conflict itself\.*How it is secured:*four binary gates decide it, a taxonomy of pseudo\-integration bounds it by naming the look\-alikes it rejects, and — crucially — we establish it bymeasurement, not consensus: four falsifiable tests that show it tracks the quantity it approximates on both axes, process and outcome\.

*The payoff:*a citable primitive\. With*what a creative integration is*now decidable — and, we conjecture, what separates genuine creativity from mere novelty \(§10\.2\) — the program’s next questions — actor\-neutrality, expressive scope, generation, and practical utility — each become testable on their own terms rather than matters of taste\. Creative integration movesfrom a metaphor to a measurable object— the first move in bringing creativity itself within the domain of science\.

## References

Boden, M\. A\. 2004\.*The Creative Mind: Myths and Mechanisms*\. 2nd ed\. London: Routledge\.

Colton, S\. 2008\. Creativity Versus the Perception of Creativity in Computational Systems\. In*Creative Intelligent Systems: Papers from the AAAI Spring Symposium*, Technical Report SS\-08\-03, 14–20\. Menlo Park, CA: AAAI Press\.

Fauconnier, G\., and Turner, M\. 2002\.*The Way We Think: Conceptual Blending and the Mind’s Hidden Complexities*\. New York: Basic Books\.

Friedman, M\. 1974\. Explanation and Scientific Understanding\.*Journal of Philosophy*71\(1\):5–19\.

Hutter, M\. 2005\.*Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability*\. Berlin: Springer\.

Jordanous, A\. 2012\. A Standardised Procedure for Evaluating Creative Systems: Computational Creativity Evaluation Based on What it is to be Creative\.*Cognitive Computation*4\(3\):246–279\.

Kitcher, P\. 1981\. Explanatory Unification\.*Philosophy of Science*48\(4\):507–531\.

Kitcher, P\. 1989\. Explanatory Unification and the Causal Structure of the World\. In Kitcher, P\., and Salmon, W\., eds\.,*Scientific Explanation*, 410–505\. Minneapolis: University of Minnesota Press\.

Koestler, A\. 1964\.*The Act of Creation*\. London: Hutchinson\.

Kolmogorov, A\. N\. 1965\. Three Approaches to the Quantitative Definition of Information\.*Problems of Information Transmission*1\(1\):1–7\.

Rissanen, J\. 1978\. Modeling by Shortest Data Description\.*Automatica*14\(5\):465–471\.

Ritchie, G\. 2007\. Some Empirical Criteria for Attributing Creativity to a Computer Program\.*Minds and Machines*17\(1\):67–99\.

Schmidhuber, J\. 2010\. Formal Theory of Creativity, Fun, and Intrinsic Motivation \(1990–2010\)\.*IEEE Transactions on Autonomous Mental Development*2\(3\):230–247\.

Wiggins, G\. A\. 2006\. A Preliminary Framework for the Description, Analysis and Comparison of Creative Systems\.*Knowledge\-Based Systems*19\(7\):449–458\.

## Appendix A — Worked Examples

We do not release the full corpus \(§7\.4\); instead we work the four\-gate criterion \(§4\) here on cases a reader can adjudicate unaided — consensus integrations \(A\.1\), a pair that shows the verdict tracks the*framing*rather than the object \(A\.2\), and rejected look\-alikes \(A\.3\)\. Each follows the recording format of §3\.3 \(four\-category count\) and §4\.3 \(gate trace\); the running example, Maxwell, is in the main text\.

### A\.1 Consensus integrations \(positives\)

Each follows three beats — the*conflict*\(whyAAandBBgenuinely compete\), the*gate\-passing integration*\(four\-category count,C\>1C\>1\), and the*tell*\(a prediction or new reach a re\-description could not buy\)\.

The periodic table — element individuality⊕\\oplusperiodic regularity\.*The conflict:*by the mid\-19th century ~60 elements were known, each with its own reactivity \(individuality\), yet ordering by atomic weight hinted at recurring properties \(regularity\); partial rules — Döbereiner’s triads, Newlands’ octaves — held locally but failed globally, so the two readings competed\.*The integration & gates:*two principles — order by atomic weight, fold on chemical period — place every element at a \(row, column\)\. The count runsO​\(N\)O\(N\)→O​\(1\)O\(1\)\(pre: a per\-element property list plus the failed partial rules as exceptions; post: 2 principles \+ a coordinate\), so G3 passes; G1 passes \(neither individuality nor periodicity is cause\-eliminable\), G2 passes \(the failed triads/octaves show they competed\), G4 passes \(the “individual or periodic?” boundary and those exceptions dissolve into one table\)\.*The tell:*the table*predicts*the undiscovered Ga/Ge/Sc from its gaps, confirmed later to ~2% — compression buying reach a re\-description never could\. →ci\.

Special relativity — space⊕\\oplustime\.*The conflict:*Galilean velocity\-addition \(space and time absolute\) cannot coexist with Maxwell’s invariantcc; the ether program patched the gap with a growing stack of assumptions, and the moving\-magnet/moving\-conductor asymmetry resisted\.*The integration & gates:*one spacetime with the invariantcc, from two postulates — the count runs ≈7 ether/frame assumptions → 2 \(G3\)\. G1 passes \(thecc\-vs\-Galilean conflict is real\), G2 passes \(absolute simultaneity cannot coexist with invariantcc— not “do both”\), G4 passes \(the absolute\-frame boundary and the induction asymmetry vanish; simultaneity becomes frame\-relative — the saving sits at the conflict\)\.*The tell:*the unification*predicts*time dilation andE=m​c2E=mc^\{2\}, phenomena outside the original dispute — the new\-reach signature of genuine compression\. →ci\.

The limit \(rigorous calculus\) — infinitesimal intuition⊕\\oplusrigor\.*The conflict:*infinitesimals were intuitive but inconsistent \(Berkeley’s “ghosts of departed quantities”\); rigorous exhaustion was sound but opaque and argued case by case — intuition and rigor pulled apart\.*The integration & gates:*one concept — theε\\varepsilon–δ\\deltalimit, the infinite captured by a finite procedure\. The count runsO​\(N\)O\(N\)per\-case exhaustion arguments → one definitionO​\(1\)O\(1\)\(G3\); G1 passes \(Berkeley’s critique bit — the conflict was real\), G2 passes \(one could not keep both separately\), G4 passes \(the intuition/rigor split dissolves — the limit*is*both\)\.*The tell:*the limit does not merely re\-describe the old proofs; it*generates*them and the rest of analysis from one definition — reach again\. →ci\.

### A\.2 The verdict tracks the framing, not the object

The locus gate \(§4, G4\) has a sharp consequence: the*same*object can be a CI or a mere look\-alike depending on how the conflict is cut\. We record both cuts of two cases — the*mis\-cut*\(reads as a look\-alike\), the*right cut*\(the genuineA⊕BA\\oplus Bthat passes\), and the*tell*that shows which is real\.

The complex plane\.*Mis\-cut:*as*real⊕\\oplusimaginary*— “x2\+1=0x^\{2\}\+1=0has no real root, so adjoinii” — the reduction merely supplies a missing prerequisite \(algebraic closure\); G1 fails, the pattern is cause\-elimination \(§5\),not\_ci\.*Right cut:*as*algebra⊕\\oplusgeometry*— equations and roots versus the plane and continuity, two domains long held apart — the complex plane and Riemann surfaces identify a number with a point and an algebraic operation with a conformal map; all gates pass,ci\.*The tell:*the right cut keeps paying out — function theory, Fourier analysis, and Hilbert space all flow from the same analytic structure — while the mis\-cut buys nothing beyond closing the gap\.

The real line\.*Mis\-cut:*as*rational⊕\\oplusirrational*— “the rationals have gaps, so add the irrationals” — cause\-elimination again,not\_ci\.*Right cut:*as*number⊕\\oplusmagnitude*— arithmetic \(ratios\) versus geometric magnitude \(length\), split for two millennia after the discovery of incommensurability and kept apart by Eudoxus’ theory of proportion — Dedekind’s and Cantor’s continuumℝ\\mathbb\{R\}makes every point of the line a number; all gates pass,ci\.*The tell:*the right cut enables the arithmetisation of analysis \(real analysis, topology, and measure follow\), whereas the mis\-cut only plugs holes\.

In both, the object did not change; the*cut*did\. A framing that locates the saving in patching one side reads as cause\-elimination; one that locates a genuineA⊕BA\\oplus Band a saving*at that boundary*— confirmed by the reach it buys — reveals the CI\. This is why the criterion is gate\-checked at the locus, and why §10\.2 insists the conflict stay content\-level rather than retrofitted\.

### A\.3 Rejected look\-alikes \(pseudo\-integration\)

The criterion earns its discrimination by what it*refuses*\(§5\)\. Three rejections, each failing a specific gate — and each showing a different way a non\-integration can masquerade as one\.

Cause\-elimination — fails G1 \(the “conflict” was a missing prerequisite\)\.Reinforcement learning from human feedback can be told as an integration: an agent*must act*but has*no reward signal*, and the method reconciles them\. But the two sides never competed — one was simply absent\. Train a reward model \(supply the missing input\) and the tension is gone\. G1 asks exactly this:*would supplying a missing prerequisite make the conflict disappear?*Here it would\. The tell: cause\-eliminationaddsa component to unblock the problem, whereas a CIremovesboundary and exception cost — Maxwell adds no missing ingredient; it sees thatEEandBBwere one field\.

Organizational packaging — fails G4 \(the saving is in the filing, not the conflict\)\.Consider a*release\-tiering policy*that sorts AI model deployments into capability tiers, each gated by its own safety requirements\. Bundling many scattered deployment calls under one framework — one document replacing many ad\-hoc judgments — the four\-category count can even read\>1\>1\. But G4 asks*where*the reduction lands\. Inspect any tier boundary and the release\-versus\-harm trade\-off re\-appears in full — you still decide, case by case, whether a capability crosses the line\. The boundaries did not dissolve; they were relabelled and grouped\. Packaging compresses the*paperwork*; a CI compresses the*conflict*\(after Maxwell there is no “electric or magnetic?” decision left to make at all\)\.

Dissolved paradox — fails G1/G2 \(there was no real conflict to begin with\)\.A candidate is dressed up as a striking paradox — “AAandBBare irreconcilable\!” — then “resolved\.” For example, “an assistant must be both*helpful*and*harmless*— a deep paradox\!” dissolves on inspection: the two largely act on*different*requests \(help on benign ones, refuse harmful ones\), so “just do both” handles the bulk \(G2\), and what remains is a dial to set, not a boundary that collapses into a shorter description\. In general the sides either act on different referents \(G2\) or rest on an unstated premise that, once named, removes the tension \(G1\); the candidate is rewarded for*sounding*paradoxical\. This is the sharpest structure\-versus\-rhetoric test \(§5\.2\): a rubric that accepts it is scoring presentation, not compression\. A genuine CI survives the same scrutiny — space and time really cannot both be absolute under an invariantcc— and only then is it compressed\.