{"id":"80cf094f-c5ab-4baa-89d7-bce721f16788","arxiv_id":"2508.13724","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"The 11-loop Kontsevich graph cohomology is computed, and the vanishing [σ3, X10] = 0 is shown, providing a counterexample to a strong form of Brown's conjecture.","lead":"This paper computes the dimensions of the Kontsevich graph cohomology at loop order 11 and some higher degrees, a central object in deformation quantization and knot theory. It uses these results to disprove a strong version of Francis Brown's conjecture about the Grothendieck-Teichmüller Lie algebra.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 6.1's counterexample depends on an unpublished spectral-sequence vanishing statement ([20, Cor 4.4]); if that differential-vanishing result fails, the degree argument collapses.","rationale":"The reader's weakest assumption — that the spectral sequence convergence and differential-vanishing properties from [14] and [20, Cor 4.4] are correct — is exactly the load-bearing premise for Proposition 6.1. If that premise fails, the proof that [σ3, X10] vanishes is invalid, and the claimed counterexample to the strong form of Brown's conjecture would not be established. The concern is not that the paper is internally inconsistent; rather, the proof rests on an unverified, unpublished corollary by the same author at a decisive step. The finite-field rank computations are honestly presented as upper bounds, and the zero entries are rigorous when the upper bound is zero, so the primary risk is not the numerics but the spectral-sequence input. A direct re-derivation of the specific vanishing differential, or a direct exactness check of the class, would settle the matter. The reader's conditional verdict remains appropriate, and no change to that verdict is needed.","tokens_in":11782,"tokens_out":16638,"duration_ms":164684,"concrete_test":"Re-derive the low-page differential vanishing statement of [20, Cor 4.4] for the specific bidegree pair (12,8) → (13,7) using the explicit formula for the spectral sequence differential in [14]; if this differential is nonzero, Proposition 6.1's degree argument fails. Alternatively, directly test exactness of [σ3, X10] in the 13-loop, degree-7 triconnected graph complex over a large finite field, which would settle the proposition without relying on [20, Cor 4.4].","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central new theoretical claim is Proposition 6.1: [σ3, X10] = 0 in H^7(GC_2^{13-loop}). The proof constructs a (δ+∇)-cocycle and then argues that if the leading term Z were nonzero it would have to be killed in the spectral sequence, but that the first possible killing source lies in the vanishing range. This step uses two external inputs: (i) convergence of the spectral sequence to ⊕_k Qσ_{2k+1} from [14], and (ii) [20, Cor 4.4], an unpublished corollary by the same author, asserting that no cancellation is possible for i = 1, 3, 5 because the differential vanishes on those pages. The i = 1 exclusion is essential: if the relevant differential from bidegree (12,8) to (13,7) were nonzero, then a class in H^8(GC_2^{12-loop}) — an entry left unknown in Table 1 — could kill Z, and the conclusion would not follow. Neither the convergence theorem nor [20, Cor 4.4] is reproved or machine-checked in the present paper, so the counterexample is only as secure as those external results. The paper would be substantially strengthened by supplying an independent verification of the specific vanishing differentials used in Proposition 6.1.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper reports numerical computations of Kontsevich graph cohomology H(GC_n^{g-loop}) for loop order g = 11, with some additional higher-loop entries, and uses these results to discuss a conjecture of Brown. The main tables give dimensions for n = 2 and n = 3; the top-degree entries for g = 11–14 come from upper bounds via a barrel-graph reduction, and several low-degree entries for n = 2 are derived from a spectral sequence. The paper's headline theoretical claim is Proposition 6.1, which asserts that [σ3, X10] = 0 in H^7(GC_2^{13-loop}), providing a counterexample to a strong version of Brown's conjecture.","tokens_in":12104,"tokens_out":7797,"duration_ms":77462,"significance":"If the computations and the spectral-sequence input are correct, this is the first determination of the 11-loop graph cohomology and provides a concrete counterexample to a widely discussed conjecture, which would be of real interest to the graph complex community. The paper is careful in several respects: it distinguishes exact zero entries from upper bounds, explains why zero upper bounds are exact, and makes the dependence on finite-field rank computations explicit. However, the central theoretical and numerical claims depend on unpublished results and on a proof sketch, so the significance is presently conditional.","major_comments":[{"comment":"Proposition 3.2 is load-bearing for the entire top-degree computation, since Corollary 3.4 and all upper bounds in Figure 1 rely on it, yet its proof is only a sketch. The final case is self-referential: Case 6 states that after using IHX relations to move all vertices onto the base loop, 'the graph is necessarily of the form of Case 6.' Case 3 similarly asserts a reduction of k without specifying the induction. This needs to be replaced by a complete argument or by a machine-checked verification; without it, the new top-degree entries for g = 11–14 are not established.","section":"§3, Proposition 3.2"},{"comment":"The final step of the proof of Proposition 6.1 ('not possible by degree reasons') silently uses the vanishing of differentials for i = 1, 3, 5 from [20, Corollary 4.4] and the convergence statement from [14]. The i = 1 case is essential: if the differential from bidegree (12,8) were nonzero, an unknown class in H^8(GC_2^{12-loop}) (a question-mark entry in Table 1) could kill Z, and the conclusion would not follow. [20] is an unpublished preprint by the same author, and neither the convergence theorem nor the specific vanishing differentials are proved or independently verified in this paper. Please supply a proof or an independent check of the needed vanishing before the counterexample can be considered established.","section":"§6, Proposition 6.1"},{"comment":"Corollary 5.2 is used in Section 2 to derive H^3(GC_2^{12-loop}) ≅ Q^2, but its proof relies on the sentence 'By computer calculation we also checked that it holds for k = 2,' with no details, code, or reproducibility data. Since this corollary is a new input to the table, the computation behind it should be documented, or the derivation should be made independent of it.","section":"§5, Corollary 5.2"},{"comment":"The entries (11,-6) and (11,-7) in Table 2 are explicitly only upper bounds: the text says that if they are not tight, the dimensions would be 6 and 0 rather than 7 and 1. This is incompatible with the abstract's unqualified statement that the paper computes the graph cohomology in loop order 11. The table and abstract should state that the loop order 11 computation is complete only up to two upper bounds, or the missing lower bounds should be supplied.","section":"§4, Table 2"},{"comment":"The paper never states the strong version of Brown's conjecture that it claims to disprove. It refers to [7, Conjecture 2.5] and says the construction of the higher-degree generators is 'partially conjectural,' but the reader cannot verify that the vanishing [σ3, X10] = 0 contradicts the intended statement unless that statement is formulated precisely. Please include the precise conjecture and identify exactly which of its assertions Proposition 6.1 refutes.","section":"§6, first paragraph"}],"minor_comments":[{"comment":"The author line 'Thomas Will W acher' contains spacing artifacts; please correct the name to 'Thomas Willwacher'.","section":"Title page"},{"comment":"The sentence 'It is known by an earlier work of the author that H^0(GC_2) ∼= grt1 is identified with the Grothendieck-Teichmüller Lie algebra' is grammatically awkward and should be rephrased.","section":"§2, first paragraph"},{"comment":"Table 2 contains two rows labeled '-16'; the row labels should be renumbered.","section":"Table 2"},{"comment":"The phrase 'we used used values of N' contains a duplicated word; it should read 'we used values of N'.","section":"§4, last paragraph"},{"comment":"The text says the Deligne-Drinfeld conjecture has been verified 'as far'; this should be 'as far as', and the sentence should be completed.","section":"§4, paragraph before Eq. (6)"},{"comment":"The proof says it uses 'a variation of Kneissler's argument ... with a modified last step,' but the modified step is not identified; please say explicitly which case or argument differs from [13, Section 5.1].","section":"§3, proof of Proposition 3.2"}],"recommendation":"major_revision","confidential_remarks":"The manuscript's central claims rely heavily on the author's own unpublished work [20] and forthcoming work [16,17]. In particular, [20, Corollary 4.4] is an essential input for Proposition 6.1, and a referee cannot verify it from the present text; I would urge the editor to require that the relevant statements from [20] be proved or included in this paper before acceptance. In addition, the paper's main content is a large numerical computation, but no code or data is released; given that several table entries are probabilistic upper bounds, a reproducibility statement would substantially strengthen the submission."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Loop-order 11 graph cohomology was open; this paper fills it, and adds top-degree upper bounds through g=14 plus the vanishing [σ_3,X_10]=0 in H^7(GC_2^{13-loop}). The zero entries in Tables 1 and 2 are rigorous because the computed upper bounds are zero, and the paper is honest about which entries are only upper bounds (the † entries for (11,-6) and (11,-7), and the even-n top-degree entries for g=13,14). That transparency earns credit. The reader's conditional verdict matches my read.\n\nThe counterexample to Brown's strong conjecture is the piece people will care about. The argument in Proposition 6.1 constructs a (δ+∇)-cocycle Z-hat and uses the spectral sequence to rule out a nontrivial class. This works only because [20, Cor 4.4] excludes the i=1 cancellation. The stress-test note is right: if the differential from bidegree (12,8) to (13,7) were nonzero, a class in H^8(GC_2^{12-loop}) — which Table 1 leaves unknown — could kill Z and the conclusion would not follow. The paper's own reference to (11,9) as the first possible killer looks like a typo; the first real candidate is (12,8). The corollary is in an arXiv preprint by the same author, not reproved or machine-checked here. That is a genuine soft spot, not a breaking point, but it means the counterexample is only as secure as that external result.\n\nTwo smaller issues. First, the proof of Proposition 3.2 is a sketch, and the last case reads circularly (\"whence the graph is necessarily of the form of Case 6\"). It is probably fixable, but a referee should ask for a real proof or a reference. Second, the heavy matrix computations are not shipped: no code, no data. The Coppersmith-Wiedemann rank bounds are probabilistic lower bounds over F_p, so the non-zero entries in Table 2 are upper bounds; the paper says so for the two † entries. Still, for a computation-heavy paper, shipping the matrices or code would materially increase confidence.\n\nThe citation pattern is heavy on the author's own prior work, but those are the actual sources of the spectral sequence machinery and the grt1 dimensions. That is not a flaw in itself; the new computation is still new. The convergence of the spectral sequence from [14] is published, so the main pressure point is really [20, Cor 4.4].\n\nWho should read this: anyone working on Kontsevich graph complexes, Grothendieck-Teichmüller theory, or Vassiliev invariants. The computational core is a legitimate extension of known methods, the zero bounds are exact, and the Brown conjecture discussion is a real result even if it lands on a strong version rather than the original. It deserves a serious referee.\n\nRecommendation: send it to peer review. Ask the referee to check Proposition 6.1's dependence on [20, Cor 4.4] carefully, and to verify that Proposition 3.2's case analysis closes.","headline":"The 11-loop computation is solid and worth taking seriously; the counterexample to Brown's strong conjecture is the headline, but it leans on an unpublished spectral-sequence vanishing statement that the paper does not reprove.","tokens_in":12581,"tokens_out":15867,"would_cite":true,"duration_ms":130944,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The 11-loop graph cohomology is computed, and the vanishing of a key bracket refutes a strong conjecture.","keywords":["graph cohomology","loop order 11","spectral sequence","Grothendieck-Teichmüller Lie algebra","triconnected graph complex","rank computation","finite field","free Lie algebra conjecture"],"falsifier":"Evaluate the rank of the differential on the triconnected graph complex at the exact spot $(g,k)=(11,6)$ for $n=2$ over the rationals (or over a second large prime); if the rank exceeds the reported finite-field value, the entry $H^6(GC_2^{11})=1$ would drop to 0. For the counterexample, compute $H^7(GC_2^{13})$ independently over another prime; a nonzero class would contradict Proposition 6.1.","tokens_in":11600,"feed_emoji":"🕸️","tokens_out":10656,"duration_ms":99587,"temperature":0.7,"pith_summary":"The paper computes the rational cohomology of the graph complex at loop order 11, for all degrees when $n=3$ and for degrees 5 through 8 when $n=2$, and fixes the remaining low-degree entries by spectral-sequence and degree arguments. A sympathetic reader should care because the graph complex is a known source of invariants in knot theory and of the Grothendieck-Teichmüller Lie algebra, so exact dimensions constrain those areas. The paper's main negative claim is that the bracket $[\\sigma_3,X_{10}]$ vanishes in $H^7(GC_2)$ at loop order 13, contradicting the strong form of a conjecture that predicted a larger free Lie algebra generated by such classes. If the computation stands, that strong conjecture is false, and the Lie algebra structure of graph cohomology is more complicated than the conjecture allowed.","feed_headline":"11-loop graph cohomology computed; key bracket vanishes","feed_subtitle":"New dimensions and a vanishing bracket refute the strong free-generation conjecture.","key_machinery":"The driving object is the loop-order spectral sequence of the twisted graph complex $(GC_0, \\delta+[L_1,-])$, whose first page is $H(GC_0)$ and which converges to the one-dimensional span of the loop $L_1$. The paper relies on the result that the differential on pages 1, 3, and 5 vanishes, so a class can cancel only against specific partners; this bookkeeping fixes the low-degree entries in Table 1 once neighboring cohomology groups are known. For the counterexample, the same twisted complex supplies explicit lifts $\\hat L_{4k+1}$ and $\\hat X_{10}$, and the proof that $[\\sigma_3,\\hat X_{10}]$ is a $\\delta$-cocycle that can be extended to a $\\delta+\\nabla$-cocycle $\\hat Z$ is what makes the bracket vanish.","core_discovery":"At loop order 11 the cohomology of the commutative graph complex is as listed in Tables 1 and 2: for $GC_2$ the nonzero dimensions are $H^0\\cong \\mathbb{Q}^2$, $H^3\\cong\\mathbb{Q}^2$, and $H^6\\cong\\mathbb{Q}$, with all other computed degrees zero; for $GC_3$ the top-degree entries $H^{-3}$ follow the known sequence up to loop order 14, and the entries at $(11,-6)$ and $(11,-7)$ are upper bounds of dimension 7 and 1 that would drop to 6 and 0 if the rank bounds are not tight. The paper also proves $[\\sigma_3,X_{10}]=0$ in $H^7(GC_2^{13})$, where $\\sigma_3$ is the degree-zero generator and $X_{10}$ the nonzero class at $(g,k)=(10,7)$. This vanishing is shown by extending the two classes to elements of a twisted graph complex whose combined differential cancels exactly, so the bracket is a boundary; the strong version of the conjecture that these classes freely generate a larger Lie algebra is therefore false.","pith_inferences":["The proof of the vanishing bracket suggests a general descent mechanism: a degree-zero class bracketed with a higher-loop class often lands, after the spectral sequence, in a higher degree at a larger loop order rather than dying immediately; this could be tested by computing $H^3(GC_2^{15})$, where the paper itself points as the natural landing spot.","If Conjecture 5.1 holds for all $k$, the classes $X_{4k+2}$ form an infinite periodic family, and the spectral-sequence bookkeeping would force a predictable cascade of cancellations; checking the next member $X_{14}$ at loop order 14 would sharpen that picture.","The finite-field rank computations yield exact rational dimensions only when the resulting upper bound is zero; running the same GPU-accelerated rank algorithm at loop order 12 and beyond could settle Conjecture 3.7 and decide whether the top-degree upper bounds for $g=13,14$ are tight.","A repaired version of the disproved conjecture may exist in which the generators are replaced by their descendants in higher loop order; the paper leaves the formulation open, and the 11-loop data give a concrete target for such a revision."],"forward_implications":["The 11-loop row of the even graph cohomology table is now entirely determined: $H^0$ is 2-dimensional, $H^3$ is 2-dimensional, $H^6$ is 1-dimensional, and all other computed degrees vanish.","The top-degree cohomology of the odd complex $H^{-3}(GC_3)$ is known exactly through loop order 14, because the new upper bounds match known lower bounds.","The strong free-generation conjecture is false: $\\sigma_3$ and $X_{10}$ do not generate a free Lie subalgebra, since their bracket vanishes at loop order 13.","In the spectral sequence, $X_{10}$ survives to the $E_4$ page and kills $[\\sigma_5,\\sigma_9]$ in degree $(14,0)$, which forces $H^3(GC_2^{12}) \\cong \\mathbb{Q}^2$."],"supporting_citations":[{"why":"Introduces the spectral sequence of the twisted graph complex whose convergence and cancellation structure drive the theoretical table entries.","marker":"[14]"},{"why":"Proves the triconnected subcomplex is quasi-isomorphic to the full graph complex and supplies the no-cancellation corollary used for low-degree entries.","marker":"[20]"},{"why":"Provides the prior graph-homology computations and the computational framework that the present loop-order-11 run extends.","marker":"[8]"},{"why":"Contains the earlier graph-cohomology computations that set the baseline for loop orders up to 10.","marker":"[2]"},{"why":"Introduces the barrel-diagram method for upper-bounding top-degree cohomology, extended here to all n and used for Tables 1 and 2.","marker":"[13]"},{"why":"Gives the lower bounds on top-degree cohomology that make the new upper bounds exact in the odd case.","marker":"[18]"},{"why":"Establishes the free Lie algebra injection into degree-zero graph cohomology that the tested conjecture would strengthen.","marker":"[6]"},{"why":"States the strong conjecture, in the form that the paper refutes with the vanishing bracket.","marker":"[7]"}],"fun_headline_variants":["11-loop graph cohomology computed; strong conjecture fails","Vanishing bracket at loop 11 refutes free-generation","New cohomology dimensions at loop 11; counterexample to strong conjecture","Graph cohomology to loop 11: tables and a refuted strong version"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The results stand or fall on the claim that the spectral sequence of the twisted graph complex converges to the expected answer and that its differential is zero on pages 1, 3, and 5; if those properties fail, the degree-counting arguments that pin down several table entries and the vanishing of $[\\sigma_3,X_{10}]$ would no longer be valid.","fun_headline_variants_meta":{"raw":{"variants":["11-loop graph cohomology computed; strong conjecture fails","Vanishing bracket at loop 11 refutes free-generation","New cohomology dimensions at loop 11; counterexample to strong conjecture","Graph cohomology to loop 11: tables and a refuted strong version"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000283,"raw_usage":{"total_tokens":1596,"prompt_tokens":797,"completion_tokens":799,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":413,"completion_tokens_details":{"reasoning_tokens":732}},"tokens_in":413,"tokens_out":799,"duration_ms":7419,"temperature":1.0,"reasoning_tokens":732,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T17:12:15.763154+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Evaluate the rank of the differential on the triconnected graph complex at the exact spot $(g,k)=(11,6)$ for $n=2$ over the rationals (or over a second large prime); if the rank exceeds the reported finite-field value, the entry $H^6(GC_2^{11})=1$ would drop to 0. For the counterexample, compute $H^7(GC_2^{13})$ independently over another prime; a nonzero class would contradict Proposition 6.1.","supporting_citations":[{"cited_title":"Graph homology computations","cited_arxiv_id":null,"evidence_quote":"Provides the prior graph-homology computations and the computational framework that the present loop-order-11 run extends."},{"cited_title":"Graph Cohomology - An Overview and Some Computations","cited_arxiv_id":null,"evidence_quote":"Contains the earlier graph-cohomology computations that set the baseline for loop orders up to 10."},{"cited_title":"Kneissler","cited_arxiv_id":null,"evidence_quote":"Introduces the barrel-diagram method for upper-bounding top-degree cohomology, extended here to all n and used for Tables 1 and 2."},{"cited_title":"Naef and T","cited_arxiv_id":null,"evidence_quote":"Gives the lower bounds on top-degree cohomology that make the new upper bounds exact in the odd case."},{"cited_title":"Mixed Tate motives over Z","cited_arxiv_id":null,"evidence_quote":"Establishes the free Lie algebra injection into degree-zero graph cohomology that the tested conjecture would strengthen."},{"cited_title":"Invariant differential forms on complexes of graphs and Feyn- man integrals","cited_arxiv_id":null,"evidence_quote":"States the strong conjecture, in the form that the paper refutes with the vanishing bracket."}],"review_version":1}