Pith. sign in

REVIEW 4 major objections 4 minor 6 references

Getzler-Kapranov graph complex cohomology computations in weight 13

T0 review · 4 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Using the Getzler–Kapranov graph complex, the paper computes the weight-13 compactly supported cohomology of the moduli spaces of curves for every pair (g,n) with 3g+2n=28, showing it lives in exactly two degrees and is given by explicit…

desk verdict A genuine but thinly documented extension of the weight-13 computation to excess 28; the new cohomology is plausible, but the decisive Gaussian elimination is asserted rather than shown. read the letter →

arxiv 2507.08995 v1 pith:Z6KG6FPX submitted 2025-07-11 math.AG

Marco Belli This is my paper · ORCID
classification math.AG MSC 14H1014C30
keywords Getzler-Kapranovgraphcomplexweightfiltrationcompactlysupportedcohomologymodulispacesofcurves13excess28Spechtmodulessymmetricgrouprepresentations
topics The Hodge Conjecture
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper computes the weight-13 piece of the compactly supported cohomology of the moduli spaces $\mathcal{M}_{g,n}$ for every pair of genus $g$ and marked points $n$ satisfying $3g+2n=28$. Using the Getzler–Kapranov graph complex, it proves that this cohomology is nonzero only in two consecutive degrees, $3g+n-2$ and $3g+n-3$, and that in those degrees it is isomorphic to explicit symmetric-group representations, each tensored with the same motivic factor $LS_{12}$. The result extends the prior computation for $3g+2n\leq 27$ and shows that the pattern changes at this excess: cohomology is no longer concentrated in the top degree, and the largest-genus pair $(8,2)$ vanishes in top degree. A fair reader should care because these are the first complete weight-13 computations beyond the previously known range, and they give explicit data about how the weight filtration on the cohomology of moduli spaces behaves.

What carries the argument

The Getzler–Kapranov graph complex $GK^{\kappa}_{g,n}$ is the central object: its cohomology is identified with the weight-$\kappa$ graded piece $\mathrm{gr}^{W}_{\kappa}H^*_c(\mathcal{M}_{g,n})$. The paper works in a quasi-isomorphic simplified subcomplex $GK^{12,1}_{g,n}$ generated by decorated graphs whose vertices carry classes in $H^{12,1}$, $H^{11,0}$ and $H^{1,1}$ of moduli spaces of curves, depicted by explicit graphical symbols. Generators are re-encoded as 'blown-up representations', combinatorial graphs whose hair labels record the decoration data, and are classified by the excess $E(g,n)=3g+2n$, which is additive over blown-up components. The argument enumerates all virtual blown-up representations of excess 28, groups them by weight-11 and weight-13 relations, and uses Gaussian elimination on the differential matrices to reduce the complex to six graphs whose cohomology gives the theorem.

What would settle it

Compute the $\mathcal{S}_n$-equivariant Euler characteristic of the claimed weight-13 cohomology for, say, $(g,n)=(4,8)$ and compare it with the weight-13 term of the polynomial point count of $\mathcal{M}_{4,8}$ from the paper's reference [2]; any mismatch of the character values would disprove Theorem 1.3.

Watch

Extended reading notes

Core claim

The paper's central claim is Theorem 1.3: for $(g,n) = (2,11), (4,8), (6,5), (8,2)$, the associated graded piece $\mathrm{gr}^{W}_{13}H^*_c(\mathcal{M}_{g,n})$ vanishes outside degrees $k_1 = 3g+n-2$ and $k_2 = 3g+n-3$, and there are $\mathcal{S}_n$-equivariant isomorphisms $\mathrm{gr}^{W}_{13}H^{k_1}_c(\mathcal{M}_{g,n}) \cong Z_{g,n}\otimes LS_{12}$ and $\mathrm{gr}^{W}_{13}H^{k_2}_c(\mathcal{M}_{g,n}) \cong W_{g,n}\otimes LS_{12}$, where $Z_{g,n}$ and $W_{g,n}$ are the specific representations listed in the theorem. The computation proceeds by resolving the weight-13 Getzler–Kapranov graph complex on the list of all 106 virtual blown-up representations of excess 28, eliminating redundant generators through weight-11 and weight-13 relations, and then running Gaussian elimination on the differential matrices to cut the complex down to six graphs whose cohomology is read off directly.

Load-bearing premise

The whole result rests on the completeness of the computer-generated catalogue of 106 building blocks and on the correctness of the hand-checked relation resolutions and Gaussian elimination steps; if one graph is missing from the list or one sign in the differential matrices is wrong, the theorem does not follow.

Editorial extensions

If this is right

  • With excess 28 settled, the weight-13 cohomology groups for all four pairs $(2,11),(4,8),(6,5),(8,2)$ are now known completely, both as vector spaces and as symmetric-group representations.
  • The motivic factor $LS_{12}$ again appears as a tensor factor, so the pattern seen for excess $\leq 27$ persists rather than breaking at 28.
  • Cohomology is concentrated in two adjacent degrees instead of one, and the top-degree part for $(8,2)$ vanishes, mirroring the behavior observed in excess 2.
  • The explicit representations determine the $\mathcal{S}_n$-equivariant Euler characteristics of these graded pieces, giving concrete numbers that can be compared with point-count data.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same enumeration pipeline could plausibly be pushed to excess 29 and beyond, but the paper notes that the excess-29 list is unverified; certifying that list would be a natural next step.
  • If $LS_{12}$ appears at every excess, weight-13 cohomology may be governed by a single universal motivic factor, with all remaining complexity encoded in the symmetric-group representation.
  • The shift from single-degree concentration at excess 26 and 27 to two-degree concentration at excess 28 suggests that the width of the cohomology window may grow with excess, a pattern worth testing in higher excesses.
  • An independent implementation of the graph complex or a direct algebro-geometric computation of the $\mathcal{S}_n$-character would provide a check on the 'one checks' steps that the paper leaves to the reader.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper studies the weight-graded compactly supported cohomology of moduli spaces of curves using the Getzler-Kapranov graph complex. It extends previous weight-13 computations to the excess class 3g + 2n = 28, covering (g,n) = (2,11), (4,8), (6,5), (8,2). The main result, Theorem 1.3, states that gr^W_13 H^*_c(M_g,n) vanishes outside two degrees and gives Sn-equivariant isomorphisms to explicit Specht-module tensors with LS12. The proof is computational: the author lists 106 virtual blown-up representations, resolves weight-11 and weight-13 relations, performs Gaussian elimination on the differential using incidence tables, and obtains six surviving graphs from which the cohomology is read off. The paper relies on prior work [5] for the simplified graph complex and on [3,4] for generator presentations.

Significance. If the computation is correct, the paper is a useful extension of the weight-13 cohomology computations to the next excess class and provides concrete, falsifiable predictions with explicit Specht decompositions. The paper is accompanied by a GitHub repository, the appendix lists the generated graphs, and the reduction to six graphs is stated in a form that can in principle be checked independently. The main significance is therefore tied to the reliability of the computational steps, which are the paper's genuinely new content.

major comments (4)
  1. [Section 3.3, Theorem 3.3, Tables 2-4] The decisive Gaussian elimination step is not fully reproducible from the manuscript. Tables 2, 3, and 4 record only zero/nonzero incidence patterns, not the actual coefficients or signs of the differential images. The places where triangularity fails, rows 116 and 117 of Table 4, are resolved by the assertion that the images of graphs 80 and 81 are independent and span that subspace. Since a single omitted nonzero coefficient, wrong sign, or incorrect independence statement would change the six-graph quotient and hence Corollary 3.4 and Theorem 1.3, the manuscript should provide the explicit differential matrices, including coefficients and signs, or a fully scripted deterministic computation whose output is included.
  2. [Section 3.2, Lemma 3.2] The redundancy of the ten underlined virtual blown-up representations in the six listed relation groups is asserted with 'One checks' but no coefficients or computation are shown. This reduction determines the input to Theorem 3.3 and is therefore load-bearing. The manuscript should display the actual linear relations among the graphs in each of the six groups, or provide code output verifying that the ten graphs are redundant and that the remaining graphs are independent for all four (g,n) pairs in the excess class.
  3. [Section 4.3] The generation of the B1 family depends on the statement that for higher group sizes or higher valence the author manually checks each weight-2 relation group and hardcodes a basis into the script. These relation groups and bases are not listed in the paper, and the exact set of manually imposed relations is not documented. Since correctness of the entire enumeration relies on this step, the manuscript should either list all weight-2 relation groups with their bases or provide the relevant portion of the code and its output so that the relation resolution can be audited.
  4. [Section 4, Proposition 3.1] Proposition 3.1 and the proof of Theorem 3.3 rest on the assertion that the enumeration algorithm generates all virtual blown-up representations of excess 28. The paper describes the algorithm but does not give a completeness proof or an independent verification that the component list is exhaustive. Given that the main theorem is a negative statement about vanishing, the completeness claim is essential. A second implementation or a systematic parametrization of all possible components would make the enumeration checkable.
minor comments (4)
  1. [Section 2.3, equation (2.12)] There appears to be a missing plus sign after the second displayed sum in (2.12); the five displayed summands are not clearly separated.
  2. [Throughout] There are several typos: 'traslations' in Section 2.1, 'indipendently' and 'indipendent' in Lemma 3.2, 'withing' in Section 2.5, 'ren' in Section 4.5, and 'column operations' and 'con be' in the proof of Corollary 3.4.
  3. [Section 2.4] The sentence 'the relations in 2.1 look as follows' refers to relations 1-6, 7', 7'' from [5], but those relations are not restated in the paper; please clarify the numbering and restate the relations being quoted.
  4. [Corollary 3.4] The phrase 'as in excess 2' appears to be a typo; the surrounding discussion concerns excess 28, so the intended comparison should be clarified.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the excess-28 computation is new and is not a restatement of its inputs, though it relies on external quasi-isomorphism/generator-presentation results and on unprinted computer checks.

full rationale

Theorem 1.3 is a new computation for 3g+2n=28, extending the previous excess-26/27 results. The load-bearing machinery—the identification (1.1), the quasi-isomorphic simplified complex in Proposition 2.1, and the generator presentations in Section 2.2—is quoted from [5], [4], [3], and [6]. Those cited results are external, parameter-free statements whose assumptions do not include the target excess-28 computation; they are reused as tools, not as the conclusion being derived. The genuinely new work is the enumeration of 106 virtual blown-up representations of excess 28, the relation resolution in Lemma 3.2, and the Gaussian elimination in Theorem 3.3. None of these steps defines its output in terms of its output, and no fitted parameter is renamed as a prediction. The main caveat is computational rather than circular: the paper does not print the actual matrix entries and uses many 'one checks' assertions, and the author explicitly warns that 'computer calculations are hard and allow room for many oversights.' The only self-citation-related concern is that [5] and [4] share the supervisor Willwacher, but these are independent prior results on the same framework, not a circular justification of the new computation. Therefore no circular reduction is exhibited, and the appropriate finding is no significant circularity.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper is a computational extension of [5]; it relies on several prior results from the same group (quasi-isomorphism, cohomology presentations) and on its own enumeration algorithm. No free parameters or new physical entities are introduced.

assumptions (5)
  • domain assumption The projection from the Getzler-Kapranov complex to the simplified complex G/R is a quasi-isomorphism.
    Quoted from [5, Section 2.2]; used as Proposition 2.1 to reduce the computation. Not re-proved in this paper.
  • domain assumption H^k(M_{g,n})=0 for odd k<11.
    Used in Section 2.1 to restrict the possible weight labelings of vertices; cited from [2].
  • domain assumption The explicit presentations of H^{11,0}(M_{1,n}), H^{12,1}(M_{1,n}) and H^{1,1}(M_{0,n}) from [3], [4], [6].
    Used to encode generators graphically in Sections 2.2.2-2.2.5; taken from prior work of the same group.
  • ad hoc to paper The enumeration algorithm generates all virtual blown-up representations of excess 28.
    Section 4 describes the algorithm; Proposition 3.1 says its proof relies on the correctness of the algorithm, but no independent verification is given.
  • ad hoc to paper The manual and computer-assisted relation resolutions and Gaussian elimination steps are correct for all (g,n) in the excess class.
    Theorem 3.3 and Lemma 3.2 rely on 'one checks' and matrices that are not fully detailed; the author notes that computer calculations allow room for oversights.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Getzler-Kapranov graph complex cohomology computations in weight 13." pith.science (2026). https://pith.science/paper/Z6KG6FPX

@misc{pith2026250708995,
  author       = {Pith},
  title        = {Pith review of: Getzler-Kapranov graph complex cohomology computations in weight 13},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Z6KG6FPX}},
  note         = {Machine review of arXiv:2507.08995}
}
abstract

We study the weight-graded compactly supported cohomology of the moduli spaces of curves $\mathcal{M}_{g,n}$ using the Getzler-Kapranov graph complex. After recollecting the theory and some previous results, we compute the cohomology in weight 13 for the (g, n) pairs with 3g + 2n = 28.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

6 extracted references · 4 canonical work pages

  1. [5]

    Samir Canning, Hannah Larson, Sam Payne, and Thomas Willwacher,The motivic structuresLS12 and S16 in the cohomology of moduli spaces of curves, preprint, arXiv:2411.12652, 2024

    arXiv 2024

  2. [1]

    https://github.com/bellimarco/Getzler-Kapranov-Graph-Cohomology-Computations-in-weight-13

    work page

  3. [2]

    Jonas Bergstr¨ om, Carel Faber, and Sam Payne,Polynomial point counts and odd cohomology vanishing on moduli spaces of stable curves, Ann. of Math. (2)199 (2024), no. 3, 1323–1365. MR 4740541

    work page 2024

  4. [3]

    Sigma 11 (2023), no

    Samir Canning, Hannah Larson, and Sam Payne,The eleventh cohomology group ofMg,n, Forum Math. Sigma 11 (2023), no. Paper No. e62, 18 pp

    work page 2023

  5. [4]

    Samir Canning, Hannah Larson, Sam Payne, and Thomas Willwacher,Moduli spaces of curves with polynomial point counts, preprint, arXiv:2410.19913, 2024

    arXiv 2024

  6. [6]

    Sam Payne and Thomas Willwacher,The weight two compactly supported cohomology of moduli spaces of curves, To appear in Duke Math. J. arXiv:2110.05711v1, 2021. 20 ID: 23 V1n n: 5 2 ID 46 ID: 24 V1n n: 5 2 ID 34 ID: 25 V1n n: 5 2 ID 39 ID: 26 V1n n: 2 ID 41 ID: 27 V1n n: 2 ID 44 ID: 28 V1n n: 2 ID 45 ---- excess: 3 (g,n): (2, 11), (4, 8), (6, 5), (8, 2) gra...

    work page Pith review arXiv 2021

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.