{"id":"86726090-3080-4712-b509-d4bbdd8d6443","arxiv_id":"1908.06640","paper_version":2,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The gauge and ghost cycle marking complexes have cohomology concentrated in degree zero, with one generator per graph, and a universal vertex-marking model computes this uniformly.","lead":"This paper computes the cohomology of gauge and ghost cycle graph complexes used in the corolla approach to gauge theory amplitudes. It shows the complexes are acyclic except for one generator per graph, and introduces a universal vertex-marking model that unifies edge, cycle and combined markings.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.2's terse proof is actually supported by Theorem 2.17; the real defect is Theorem 1.1's false uniqueness claim, since H^0 has one generator per graph, not one total.","rationale":"After working through the structure, I find that the proof-skipping concern in the reader's weakest_assumption does not survive contact with Theorem 2.17: the combined complex is one of the P-marking complexes of §2, and the universal model turns it into a vertex-marking complex, so the spectral sequence proof of Theorem 3.6 applies without modification. The cross-admissibility is a local condition and is exactly the adjacency relation in Γ'. The genuine problem is that the paper's advertised Theorem 1.1 is internally inconsistent with its own Theorem 4.2. Once H^0 is a direct sum over graphs, the 'only one class' claim fails whenever Gra_{r,l} has more than one element, which is the generic case. The fix is purely textual but necessary: replace uniqueness by 'one class per graph' and describe X_{r,l} as the sum of the per-graph generators. This does not change the main cohomological computation, so I retain the CONDITIONAL verdict; the authors must correct the statement and cite Theorem 2.17 in the proof of Theorem 4.2.","tokens_in":11659,"tokens_out":24531,"duration_ms":238671,"concrete_test":"Choose (r,l) with |Gra_{r,l}|≥2, e.g. r=0,l=4, where K_{3,3} and the triangular prism are distinct connected cubic graphs. For each of these two graphs Γ, compute the element c_Γ=e^{δ+}e^{χ+}(Γ,m0) explicitly and verify S c_Γ=T c_Γ=0 and c_Γ≠0 (Proposition 3.8). Since S and T do not change the underlying graph, the direct-sum decomposition gives independent classes [c_{K_{3,3}}] and [c_{prism}] in H^0. Then [X_{0,4}]=[c_{K_{3,3}}]+[c_{prism}] generates only a rank-1 subgroup of the rank-2 group H^0, so the quotient by ⟨[X_{0,4}]⟩ is nonzero. This directly falsifies the uniqueness claim of Theorem 1.1 while agreeing with Theorem 4.2.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reader's worry about Theorem 4.2 is not the main problem. The combined edge+cycle complex is a P-marking complex for P=E⊔C (§2.1). By Theorem 2.17 it is isomorphic to the vertex-marking complex V(Γ'), where Γ' has one vertex for each edge or cycle and an edge between two such vertices exactly when the corresponding subgraphs share a vertex. Theorem 3.6 then applies directly, so the cross-admissibility between edge and cycle markings is encoded in Γ' and cannot create extra E1 classes; 'same as the proof of Theorem 3.6' is terse but valid. The load-bearing defect is the uniqueness assertion. Theorem 4.2 computes H^0(G^•,S+(-1)^•T) ≅ ⊕_{Γ∈Gra_{r,l}} Z, a free abelian group of rank N=|Gra_{r,l}|. For N>1 there are N independent cohomology classes, one in each graph summand. The element X_{r,l}=Σ_Γ e^{δ+}e^{χ+}(Γ,m0) is the vector (1,...,1) in Z^N; it is a nontrivial cocycle but not a generator of H^0, and it is not 'the only non-trivial class'. Theorem 1.1 and the phrase 'sole maximal generator' in §4 are therefore false as stated; the correct formulation is that each graph contributes exactly one class, represented by e^{δ+}e^{χ+}(Γ,m0), and X_{r,l} is the sum of these graph-wise generators.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the gauge and ghost cycle graph complexes introduced by Kreimer, Sars and van Suijlekom. It reformulates both as instances of a general complex P(Γ) generated by admissible markings of a chosen set P of subgraphs of Γ, and proves a universality result (Theorem 2.17) identifying every such complex with a vertex-marking complex V(Γ′) of an auxiliary graph Γ′. The cohomology of the vertex-marking complex is computed by a spectral sequence (Theorem 3.6), and the result is transferred to the edge- and cycle-marking complexes and to the combined total complex. The paper claims in Theorem 1.1 that a certain sum X over admissible 1-markings is a cocycle and represents the only non-trivial cohomology class of the total complex.","tokens_in":11983,"tokens_out":24688,"duration_ms":219505,"significance":"The conceptual contribution is the universal vertex-marking model, which cleanly separates the combinatorial mechanism of the differentials from the topology of the underlying graph. The spectral-sequence computation is short and essentially self-contained, and it correctly yields one cohomology class for each graph. This is a useful result for the gauge-theory application, since it identifies the full gauge amplitude as a sum of non-trivial cohomology classes rather than as a single class. However, the main theorem overstates the result: the cohomology is freely generated by one class per graph, not by one class in total. The fix is local and does not affect the core computation.","major_comments":[{"comment":"Theorem 4.2 states H^0(G•, S+(−1)•T) ≅ ⊕_{Γ∈Gra_{r,l}} Z. Let N=|Gra_{r,l}|. For N>1 this is a free abelian group of rank N, so there are N independent non-trivial classes, one in each graph summand. The element ~X = ∑_Γ e^{δ+}e^{χ+}(Γ,m0) is the vector (1,…,1) in this direct sum; it is a non-zero cocycle but it is not a generator of H^0, and it is not 'the only non-trivial class'. The correct statement is that for each Γ the class [e^{δ+}e^{χ+}(Γ,m0)] generates the corresponding Z-summand, and ~X is the sum of these graph-wise generators. The abstract, the introduction ('in fact the only one'), and the final paragraph of §4 ('sole maximal generator') must be corrected accordingly. In addition, X in Theorem 1.1 must be understood as the full exponential sum including the trivial marking; if 'admissible 1-markings' is read as requiring at least one 1-marked element, the cocycle property SX=0 already fails for the single-edge graph.","section":"Sections 1 and 4, Theorem 1.1 and Theorem 4.2"},{"comment":"The one-line proof 'Same as the proof of Theorem 3.6' is too compressed for the central theorem. The reduction is valid, but it should be spelled out: the combined edge-and-cycle complex is the P(Γ)-complex for P=E⊔C, and Theorem 2.17 identifies it with V(Γ′), where Γ′ has one vertex for each edge and each cycle of Γ and an edge between two such vertices exactly when the corresponding subgraphs share a vertex. The cross-admissibility condition between edges and cycles is then encoded in the adjacency of Γ′, so no extra E1 classes can appear. Please state this explicitly.","section":"Section 4, Theorem 4.2, proof"}],"minor_comments":[{"comment":"The condition 'p shares a vertex with some p′∈P' should read 'some p′∈P_m'; as written d_p is identically zero for edge and cycle markings, contradicting the examples and Proposition 2.5.","section":"Definition 2.3"},{"comment":"The condition in δ^c_+ that 'c is adjacent to a marked edge' is confusing for a map C→C; in the isolated cycle complex the intended obstruction is adjacency to a marked cycle, while in the combined complex the marked-edge condition is the right one. Please clarify which complex is being discussed.","section":"Section 3.3, Proposition 3.8"},{"comment":"The phrase 'the sum over all 1-marked graphs' should be 'the sum over all admissible 1-markings' (including the trivial marking); the exponential notation e^{δ+}e^{χ+} makes this clear, but the surrounding prose does not.","section":"Section 4, after Theorem 4.2"},{"comment":"There is a notational clash between X in Theorem 1.1 (the sum over admissible 1-markings) and X_{r,l} in §4 (the unmarked sum). Relabel to avoid confusion.","section":"Sections 1 and 4"},{"comment":"Typos: 'cyle' in the abstract and 'qauntization' in the introduction; also the sentence in Remark 2.8 about multi-edges vanishing is potentially misleading given that multi-edges are kept in this paper.","section":"Abstract and Introduction"}],"recommendation":"major_revision","confidential_remarks":"The core computation is sound, but the main theorem as stated is mathematically false in a way that is easy to repair: the uniqueness claim must be replaced by the rank-N statement. The paper is best viewed as a review with a new computation; the novelty is moderate, but the universal model and the explicit cohomology computation are publishable once the overstatement is fixed."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here is my take. The core computation is real: the edge- and cycle-marking complexes of Kreimer–Sars–van Suijlekom have cohomology a direct sum of Z over graphs in degree zero and vanish otherwise. The universal vertex-marking model (Theorem 2.17) is a genuinely nice unifying idea, and the spectral sequence proof for vertex complexes (Theorem 3.6) is clean and correct. That part deserves credit. The soft spots are in the framing and in Section 4. Theorem 1.1 overclaims: H^0 is a free abelian group with one generator per graph, so X is the sum of those generators, not the only class. For more than one graph there are multiple independent classes. That is an error in the introduction and in the phrase 'sole maximal generator'. Section 4's combined complex is not well-defined as written. S and T are introduced as the edge and cycle differentials from Sections 2.2–2.3, but those do not preserve the cross-admissibility condition on E⊔C. An unmarked cycle sharing a vertex with a marked edge would be 2-marked by t, producing a non-admissible configuration. The proof of Lemma 4.1 silently uses a stronger condition—cycles disjoint from any marked edge or cycle—which is not the definition of t. If the authors intend the general P-complex construction from Section 2.1 with P=E⊔C, they need to say so and define S and T as the edge-only and cycle-only parts of δ and d; then Theorem 2.17 applies and Theorem 4.2 follows. But as written, 'Same as the proof of Theorem 3.6' is not justified. The stress-test note claims the combined complex is a P-marking complex and Theorem 2.17 makes the proof work; that is only true if the differentials are the P-complex ones, which the paper does not establish. So the reader's instinct was right, though for a slightly different reason. Verdict: conditional. The main cohomology results for edge and cycle complexes are correct and useful for the corolla program. Theorem 1.1 must be corrected, and Section 4 needs a proper definition or an explicit appeal to the P-complex construction. This is repairable. It deserves a serious referee; I would accept it for review, but I would not cite it as-is until Section 4 is clarified.","headline":"The cohomology computations for edge and cycle complexes are correct and useful, but Theorem 1.1 overclaims uniqueness and the Section 4 combined complex needs a clearer definition.","tokens_in":782,"tokens_out":1721,"would_cite":false,"duration_ms":152951,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The gauge and ghost cycle marking complexes have exactly one nonzero cohomology class, generated by the full gauge amplitude.","keywords":["marked graphs","gauge theory","ghost cycle complex","edge-marking complex","vertex-marking model","graph cohomology","spectral sequence","3-regular graphs"],"falsifier":"Compute the $E_1$ page of the spectral sequence for a small graph where edge and cycle markings interact, for instance the $\\theta$ graph (two 3-valent vertices joined by three internally disjoint edges). If an $E_1$ class with total degree 1 survives the collapse and is not killed by a later differential, then the claimed acyclicity of the total complex would fail; the paper's answer is that $H^1$ vanishes.","tokens_in":11411,"feed_emoji":"📐","tokens_out":10795,"duration_ms":102488,"temperature":0.7,"pith_summary":"The paper computes the cohomology of the gauge and ghost cycle graph complexes that arise in the corolla-polynomial approach to gauge-theory amplitudes. It establishes that both complexes are acyclic: all cohomology vanishes except in degree 0, where each 3-regular graph with $r$ legs and $l$ loops contributes one free generator. The generator is the sum over all admissible 1-markings of that graph, so the full gauge-theory amplitude is not only a cocycle but the unique representative of the sole nontrivial class. The proof passes through a universal vertex-marking model, where a spectral sequence collapses at its first page, and then transfers the result back to edges and cycles.","feed_headline":"Marked-graph complexes collapse to one gauge class","feed_subtitle":"Gauge and ghost cycle complexes are acyclic; the amplitude is the unique generator per 3-regular graph.","key_machinery":"The central construction is the vertex-marking model. Any complex of marked subgraphs $P(\\Gamma)$, generated by admissible labels on a chosen family of subgraphs, is isomorphic to the complex $V(\\Gamma')$ obtained by marking vertices of the graph $\\Gamma'$ whose vertices are the elements of $P$ and whose edges join elements that share a vertex in $\\Gamma$ (Theorem 2.17). In this model the differential splits as $U=u+\\mu$, where $\\mu$ simply turns 1-marked vertices into 2-marked vertices; the $\\mu$-cohomology is $\\mathbb{Z}$ in degree 0 and 0 in all other degrees (Proposition 3.5). Filtering the double complex by the number of marked vertices makes the spectral sequence collapse at $E_1$, so the full differential $u+\\mu$ is acyclic. This machinery is what lets the paper avoid computing the hard $d$-cohomology and still obtain the complete answer for edges and cycles.","core_discovery":"For fixed $r,l$, let $\\mathrm{Gra}_{r,l}$ be the 3-regular graphs with $r$ legs and $l$ loops, and let $S$ and $T$ be the gauge and ghost-cycle differentials acting on admissible edge and cycle markings. Theorem 4.2 states that $H^n(G^\\bullet, S+(-1)^\\bullet T)$ is isomorphic to the direct sum over all $\\Gamma\\in\\mathrm{Gra}_{r,l}$ of $\\mathbb{Z}$ when $n=0$, and to 0 otherwise. The same acyclicity holds for the edge-marking complex $(E,S)$ and the cycle-marking complex $(C,T)$ separately. The explicit generator is $\\tilde{X}_{r,l}=\\sum_{\\Gamma} e^{\\delta_+}e^{\\chi_+}(\\Gamma,m_0)$, the sum over all admissible 1-markings obtained from the trivial marking by the maps that add marked cycles and marked edges. Thus the gauge amplitude represents the only cohomology class, rather than merely being closed under the differentials.","pith_inferences":["By extension of Theorem 2.17, the same acyclicity should hold for marking any family of subgraphs, such as paths, cliques, or stars, whenever the admissibility condition is faithfully encoded in the auxiliary vertex graph; testing this on a small graph would separate the general principle from the two physical cases.","The proof collapses at $E_1$ using only $\\mu$, so the result is insensitive to the hard part of the differential; this suggests that natural variants of these complexes with the same $\\mu$ will also be acyclic, which is not a claim the paper makes.","If the complex is used to model BRST-like constraints, the single generator per graph means no higher cohomological obstructions exist: any observable living in degree 0 is fixed up to a scalar multiple of the amplitude."],"forward_implications":["Both the edge-marking complex $(E,S)$ and the cycle-marking complex $(C,T)$ are acyclic, with $H^0$ a copy of $\\mathbb{Z}$ for each graph in $\\mathrm{Gra}_{r,l}$ and all higher cohomology zero.","The gauge-theory amplitude $\\tilde{X}_{r,l}$ is a non-trivial cocycle and generates the unique class in degree 0 of the combined complex, so the physical constraints encoded by the two differentials leave exactly one independent amplitude per graph.","Because the cohomology splits as a direct sum over graphs, the statement holds graph by graph: no relation mixing different graphs is forced by the marking differentials.","The result is insensitive to auxiliary ordering choices on edges and cycles; the cohomology is independent of the order used to define the sign conventions.","Including ghost-cycle orientation and symmetry factors does not change the cohomology: directed ghost cycles can be represented by a pair of oppositely oriented cycles, as the paper notes."],"supporting_citations":[{"why":"Defines the gauge and ghost cycle complexes, their differentials, and the cocycle property of the marked amplitude; supplies the operations $e^{\\delta_+}$ and $e^{\\chi_+}$ used in the generator.","marker":"[KSvS13]"},{"why":"Provides the spectral sequence conventions and the filtration argument used in the proofs of Theorems 3.6 and 4.2.","marker":"[GM99]"},{"why":"Basis for treating the chosen order on edges and cycles as auxiliary data so that the complexes and their cohomology are well defined on isomorphism classes of graphs.","marker":"[CV03]"}],"fun_headline_variants":["Graph marking complexes reduce to one cohomology class","Gauge and ghost complexes acyclic; amplitude persists","Only the gauge amplitude survives graph cohomology","Marked graph cohomology: everything but amplitude vanishes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof of Theorem 4.2 is given as 'Same as the proof of Theorem 3.6' and assumes that the total complex combining edge and cycle markings, including the cross-admissibility condition that no marked edge shares a vertex with a marked cycle, admits the same filtration and $E_1$ collapse as the vertex model; because the two marking types interact, this step is not a formal tensor-product argument.","fun_headline_variants_meta":{"raw":{"variants":["Graph marking complexes reduce to one cohomology class","Gauge and ghost complexes acyclic; amplitude persists","Only the gauge amplitude survives graph cohomology","Marked graph cohomology: everything but amplitude vanishes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000183,"raw_usage":{"total_tokens":1263,"prompt_tokens":840,"completion_tokens":423,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":456,"completion_tokens_details":{"reasoning_tokens":360}},"tokens_in":456,"tokens_out":423,"duration_ms":5113,"temperature":1.0,"reasoning_tokens":360,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:40:01.457205+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the $E_1$ page of the spectral sequence for a small graph where edge and cycle markings interact, for instance the $\\theta$ graph (two 3-valent vertices joined by three internally disjoint edges). If an $E_1$ class with total degree 1 survives the collapse and is not killed by a later differential, then the claimed acyclicity of the total complex would fail; the paper's answer is that $H^1$ vanishes.","supporting_citations":[],"review_version":1}