{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4ERGN3D3HI4JLML7FVXY3OK64M","short_pith_number":"pith:4ERGN3D3","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"},"canonical_sha256":"e12266ec7b3a3895b17f2d6f8db95ee33b1220264501a40b5db33a29c01c459a","source":{"kind":"arxiv","id":"2311.06669","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.06669","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"2311.06669v3","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06669","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"4ERGN3D3HI4J","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"pith_short_16","alias_value":"4ERGN3D3HI4JLML7","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"pith_short_8","alias_value":"4ERGN3D3","created_at":"2026-07-05T10:01:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4ERGN3D3HI4JLML7FVXY3OK64M","target":"record","payload":{"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"},"canonical_sha256":"e12266ec7b3a3895b17f2d6f8db95ee33b1220264501a40b5db33a29c01c459a","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"},"source_kind":"arxiv","source_id":"2311.06669","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MByyd2+8kD0dOnZ0MLdBkkV6QRgkiHVkodoMS7eNbk7e9CV9Q1Z3HvvNcszd6Qm94lEhDAZdkmI27rhqpCs2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:21:39.866387Z"},"content_sha256":"b3fd68d9ef0d52c1ae195bc6dcb2ecb934921a963ef58ab802aa8d8ef643daa9","schema_version":"1.0","event_id":"sha256:b3fd68d9ef0d52c1ae195bc6dcb2ecb934921a963ef58ab802aa8d8ef643daa9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4ERGN3D3HI4JLML7FVXY3OK64M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"orYjhw7Wto6U1tt8Nt44dCUm31beYbj79HNOk/07k5fLiOScJygJZz7r0iLh/Zt+h8t29cXW6SXj++yu3THaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:21:39.866918Z"},"content_sha256":"31a5760a2ce687b2cfd398ac5474a4f89250e416b7327c6557d4fb9bd98728a5","schema_version":"1.0","event_id":"sha256:31a5760a2ce687b2cfd398ac5474a4f89250e416b7327c6557d4fb9bd98728a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/bundle.json","state_url":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ERGN3D3HI4JLML7FVXY3OK64M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T18:21:39Z","links":{"resolver":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M","bundle":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/bundle.json","state":"https://pith.science/pith/4ERGN3D3HI4JLML7FVXY3OK64M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ERGN3D3HI4JLML7FVXY3OK64M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4ERGN3D3HI4JLML7FVXY3OK64M","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":"2f6a8e5cff16e05e3cacccf757850a1902b1e8d56b4fcb860bb1c9b177768ca1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.QA","submitted_at":"2023-11-11T21:22:00Z","title_canon_sha256":"3df3fe6b05b20b86c5f9564a7b264bf3462ec4284722aae3ba317c7b8ce8768b"},"schema_version":"1.0","source":{"id":"2311.06669","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.06669","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"2311.06669v3","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06669","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"4ERGN3D3HI4J","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"pith_short_16","alias_value":"4ERGN3D3HI4JLML7","created_at":"2026-07-05T10:01:10Z"},{"alias_kind":"pith_short_8","alias_value":"4ERGN3D3","created_at":"2026-07-05T10:01:10Z"}],"graph_snapshots":[{"event_id":"sha256:31a5760a2ce687b2cfd398ac5474a4f89250e416b7327c6557d4fb9bd98728a5","target":"graph","created_at":"2026-07-05T10:01:10Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.06669/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Sergei Merkulov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.QA","submitted_at":"2023-11-11T21:22:00Z","title":"On interrelations between graph complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06669","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3fd68d9ef0d52c1ae195bc6dcb2ecb934921a963ef58ab802aa8d8ef643daa9","target":"record","created_at":"2026-07-05T10:01:10Z","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":"2f6a8e5cff16e05e3cacccf757850a1902b1e8d56b4fcb860bb1c9b177768ca1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.QA","submitted_at":"2023-11-11T21:22:00Z","title_canon_sha256":"3df3fe6b05b20b86c5f9564a7b264bf3462ec4284722aae3ba317c7b8ce8768b"},"schema_version":"1.0","source":{"id":"2311.06669","kind":"arxiv","version":3}},"canonical_sha256":"e12266ec7b3a3895b17f2d6f8db95ee33b1220264501a40b5db33a29c01c459a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e12266ec7b3a3895b17f2d6f8db95ee33b1220264501a40b5db33a29c01c459a","first_computed_at":"2026-07-05T10:01:10.519815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:01:10.519815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k4ELXP2H/cTWvUnwxhCLhybmF2Lm8ciPw3e5X90ELwncLzbcM/AID5Fy/3cKQYV9Yk2JIrgocsB/txd9i3gkDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:01:10.520401Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.06669","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3fd68d9ef0d52c1ae195bc6dcb2ecb934921a963ef58ab802aa8d8ef643daa9","sha256:31a5760a2ce687b2cfd398ac5474a4f89250e416b7327c6557d4fb9bd98728a5"],"state_sha256":"3bfb054c93fb137d00ddf145d31677fcdff40e047eca491fbd0cc31f265ea732"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QXx5BQiJgIuKgwa306Vy6Pj4/Wxk0dcVZUFhrX2LdCJo4hRSw242cu+AXlH1UyzvtRFUrMSmV8GQ30+UMutKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T18:21:39.871179Z","bundle_sha256":"e43294ab3926274a64b7716d08d69495f268a9794e68a681857636af8bd74d84"}}