{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BSSIMAVBNBSEV2PFQXJWWWQQGP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"22728c84e9ea977e905ce5694eec0d1b29e4947a1ea3677a7d7606c4719816e9","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.QA","submitted_at":"2026-04-13T11:29:44Z","title_canon_sha256":"cf321c2f33303fe3b5b1bfeac03cbb4ae71245ae5ec340b1faadc7067e16db48"},"schema_version":"1.0","source":{"id":"2604.11327","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.11327","created_at":"2026-05-21T01:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"2604.11327v2","created_at":"2026-05-21T01:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.11327","created_at":"2026-05-21T01:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"BSSIMAVBNBSE","created_at":"2026-05-21T01:05:18Z"},{"alias_kind":"pith_short_16","alias_value":"BSSIMAVBNBSEV2PF","created_at":"2026-05-21T01:05:18Z"},{"alias_kind":"pith_short_8","alias_value":"BSSIMAVB","created_at":"2026-05-21T01:05:18Z"}],"graph_snapshots":[{"event_id":"sha256:81bb49f7dd0f0b4643e78205869069fff6259eed5e288f81b5e7844fdc9a52a1","target":"graph","created_at":"2026-05-21T01:05:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"for every m ≥ 2, we prove that the wheel graph W_{2m+1} is homologous to an explicit linear combination of 2^{m-1} graphs, each having only 3- and 4-valent vertices."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The explicit linear combination constructed in the paper is a cycle whose boundary equals that of the wheel graph under the standard differential of GC_d."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For every m ≥ 2 the wheel graph W_{2m+1} is homologous to an explicit sum of 2^{m-1} graphs with only 3- and 4-valent vertices."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Wheel graphs in the Kontsevich graph complex are homologous to explicit combinations of only 3- and 4-valent graphs."}],"snapshot_sha256":"49597b15c98569a544763d3bff1efff60df38650d1af5483a0fb35af8c9d2745"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.11327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that the wheel classes in the Kontsevich graph complex $GC_d$ admit representatives supported on graphs with only $3$- and $4$-valent vertices. This verifies that Merkulov's low-valence conjecture holds for the wheel classes.\n  More precisely, for every $m \\ge 2$, we prove that the wheel graph $W_{2m+1}$ is homologous to an explicit linear combination of $2^{m-2}$ graphs, each having only $3$- and $4$-valent vertices.","authors_text":"Assar Andersson","cross_cats":["math.CO"],"headline":"Wheel graphs in the Kontsevich graph complex are homologous to explicit combinations of only 3- and 4-valent graphs.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.QA","submitted_at":"2026-04-13T11:29:44Z","title":"Wheel Classes in Kontsevich Graph Complex and Merkulov's Low-Valence Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.11327","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T15:40:51.261057Z","id":"95f7cf7c-c132-4e11-947f-09ba0c4eb57f","model_set":{"reader":"grok-4.3"},"one_line_summary":"For every m ≥ 2 the wheel graph W_{2m+1} is homologous to an explicit sum of 2^{m-1} graphs with only 3- and 4-valent vertices.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Wheel graphs in the Kontsevich graph complex are homologous to explicit combinations of only 3- and 4-valent graphs.","strongest_claim":"for every m ≥ 2, we prove that the wheel graph W_{2m+1} is homologous to an explicit linear combination of 2^{m-1} graphs, each having only 3- and 4-valent vertices.","weakest_assumption":"The explicit linear combination constructed in the paper is a cycle whose boundary equals that of the wheel graph under the standard differential of GC_d."}},"verdict_id":"95f7cf7c-c132-4e11-947f-09ba0c4eb57f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:78692e48a92db4e07fe6cc36d882230047abd243d39863e0dba52f6e964ca277","target":"record","created_at":"2026-05-21T01:05:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"22728c84e9ea977e905ce5694eec0d1b29e4947a1ea3677a7d7606c4719816e9","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.QA","submitted_at":"2026-04-13T11:29:44Z","title_canon_sha256":"cf321c2f33303fe3b5b1bfeac03cbb4ae71245ae5ec340b1faadc7067e16db48"},"schema_version":"1.0","source":{"id":"2604.11327","kind":"arxiv","version":2}},"canonical_sha256":"0ca48602a168644ae9e585d36b5a1033f5593bb99e6a0281281c148768419860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ca48602a168644ae9e585d36b5a1033f5593bb99e6a0281281c148768419860","first_computed_at":"2026-05-21T01:05:18.929455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:18.929455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lsc6KBBYCefAYJqVeLSvTcTb4vb65K3CMgH8dgZNNkrnjM0y5/MtlJ3sRomaj9KHP3hgwVFkpNtLfJhC4Ss+AQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:18.930052Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.11327","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78692e48a92db4e07fe6cc36d882230047abd243d39863e0dba52f6e964ca277","sha256:81bb49f7dd0f0b4643e78205869069fff6259eed5e288f81b5e7844fdc9a52a1"],"state_sha256":"95ff8db1d8c3e4535e6ea3af5d8575e8baa1cdc9df2afdefcc1586790f180e42"}