Graph homology computations

Not yet reviewed by Pith; the record is open.

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 2307.12668 v2 pith:OOQD2CCH submitted 2023-07-24 math.QA

Simon Brun , Thomas Willwacher This is my paper · ORCID

classification math.QA

keywords graphhomologycomplexescomputationscomputeextendingloopnumerically

verification ladder T0 review T1 audit T2 compute T3 formal

No signed human review yet.

0 comments

read the original abstract

We compute numerically the homology of several graph complexes in low loop orders, extending previous results.

Forward citations

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

Bond thickenings of the simplicial boundary of Outer space
math.AT 2026-08 accept novelty 8.0 of 10

The inclusion of the simplicial boundary of Outer space into its 2-bond thickening is (2n-3)-connected, with all non-contractible fibres concentrated over theta graphs.