Pith. sign in

REVIEW 1 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

Thomas Willwacher This is my paper · ORCID
classification math.QAmath.AT
keywords loopcohomologyconjecturegraphorderapplybrowncompute
verification ladder T0 review T1 audit T2 compute T3 formal
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). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

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

    math.QA 2026-07 conditional novelty 7.0 of 10

    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.

Pith tools