{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4ERGN3D3HI4JLML7FVXY3OK64M","short_pith_number":"pith:4ERGN3D3","schema_version":"1.0","canonical_sha256":"e12266ec7b3a3895b17f2d6f8db95ee33b1220264501a40b5db33a29c01c459a","source":{"kind":"arxiv","id":"2311.06669","version":3},"attestation_state":"computed","paper":{"title":"On interrelations between graph complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.QA","authors_text":"Sergei Merkulov","submitted_at":"2023-11-11T21:22:00Z","abstract_excerpt":"We study Maxim Kontsevich's graph complex $GC_d$ for any integer $d$ as well as its oriented and targeted versions, and show new short proofs of the theorems due to Thomas Willwacher and Marko Zivkovic which establish isomorphisms of their cohomology groups. A new result relating the cohomology of the sourced-targeted graph complex in dimension $d+1$ with the direct sum of two copies of the cohomology group of Maxim Kontsevich's graph complex $GC_d$ in dimension $d$ is obtained. We introduce a new graph complex spanned by purely trivalent graphs and show that its cohomology is isomorphic to $H"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2311.06669","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.QA","submitted_at":"2023-11-11T21:22:00Z","cross_cats_sorted":[],"title_canon_sha256":"3df3fe6b05b20b86c5f9564a7b264bf3462ec4284722aae3ba317c7b8ce8768b","abstract_canon_sha256":"2f6a8e5cff16e05e3cacccf757850a1902b1e8d56b4fcb860bb1c9b177768ca1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:10.520401Z","signature_b64":"k4ELXP2H/cTWvUnwxhCLhybmF2Lm8ciPw3e5X90ELwncLzbcM/AID5Fy/3cKQYV9Yk2JIrgocsB/txd9i3gkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e12266ec7b3a3895b17f2d6f8db95ee33b1220264501a40b5db33a29c01c459a","last_reissued_at":"2026-07-05T10:01:10.519815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:10.519815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On interrelations between graph complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.QA","authors_text":"Sergei Merkulov","submitted_at":"2023-11-11T21:22:00Z","abstract_excerpt":"We study Maxim Kontsevich's graph complex $GC_d$ for any integer $d$ as well as its oriented and targeted versions, and show new short proofs of the theorems due to Thomas Willwacher and Marko Zivkovic which establish isomorphisms of their cohomology groups. A new result relating the cohomology of the sourced-targeted graph complex in dimension $d+1$ with the direct sum of two copies of the cohomology group of Maxim Kontsevich's graph complex $GC_d$ in dimension $d$ is obtained. We introduce a new graph complex spanned by purely trivalent graphs and show that its cohomology is isomorphic to $H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06669","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.06669/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.06669","created_at":"2026-07-05T10:01:10.519875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.06669v3","created_at":"2026-07-05T10:01:10.519875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06669","created_at":"2026-07-05T10:01:10.519875+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ERGN3D3HI4J","created_at":"2026-07-05T10:01:10.519875+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ERGN3D3HI4JLML7","created_at":"2026-07-05T10:01:10.519875+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ERGN3D3","created_at":"2026-07-05T10:01:10.519875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.19657","citing_title":"The oriented graph complex revisited","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M","json":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M.json","graph_json":"https://pith.science/api/pith-number/4ERGN3D3HI4JLML7FVXY3OK64M/graph.json","events_json":"https://pith.science/api/pith-number/4ERGN3D3HI4JLML7FVXY3OK64M/events.json","paper":"https://pith.science/paper/4ERGN3D3"},"agent_actions":{"view_html":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M","download_json":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M.json","view_paper":"https://pith.science/paper/4ERGN3D3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.06669&json=true","fetch_graph":"https://pith.science/api/pith-number/4ERGN3D3HI4JLML7FVXY3OK64M/graph.json","fetch_events":"https://pith.science/api/pith-number/4ERGN3D3HI4JLML7FVXY3OK64M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/action/storage_attestation","attest_author":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/action/author_attestation","sign_citation":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/action/citation_signature","submit_replication":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/action/replication_record"}},"created_at":"2026-07-05T10:01:10.519875+00:00","updated_at":"2026-07-05T10:01:10.519875+00:00"}