Pith. sign in

REVIEW 2 cited by

The 11-loop graph cohomology

Not yet reviewed by Pith; the record is open.

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

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2508.13724 v1 pith:VJNCTZQL submitted 2025-08-19 math.QA math.AT

The 11-loop graph cohomology

Thomas Willwacher This is my paper
classification math.QA math.AT
keywords loopcohomologyconjecturegraphorderapplybrowncompute
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We compute the Kontsevich graph cohomology in loop order 11, and for some degrees in higher loop order. We apply our results to discuss a conjecture of F. Brown, providing a counterexample to a strong version of the conjecture.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Graph integrals, Feynman periods, and single-valued multiple zeta values

    math.QA 2026-07 conditional novelty 7.0

    Canonical integrals of graphs with E=2V−2 equal RW integrals and evaluate to single-valued multiple zeta values, which are shown to lie in the space of Feynman periods.

  2. Explorations of Matroid Complexes

    math.CO 2026-05 unverdicted novelty 7.0

    Matroid complexes are equipped with bicomplexes forming a Hopf algebra whose dg-structure yields acyclicity theorems and explicit homology computations that detect nontrivial classes conjecturally generated by odd-whe...