{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:V3JI7MUOUESM32BHMRDVFDRPWF","short_pith_number":"pith:V3JI7MUO","canonical_record":{"source":{"id":"1811.10638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-26T19:00:17Z","cross_cats_sorted":[],"title_canon_sha256":"1571f044ccc0adf4b21aad3aae77fa2af3a95fa5bfdd1769d0019213352d27d7","abstract_canon_sha256":"8d364481b86ddea61a41042f52e8be1ad3c914dad55023b2ab3ebf77fddef6a3"},"schema_version":"1.0"},"canonical_sha256":"aed28fb28ea124cde8276447528e2fb14a3b7b52cb9ebd3ca7bd80975ba70d6b","source":{"kind":"arxiv","id":"1811.10638","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10638","created_at":"2026-05-17T23:45:32Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10638v1","created_at":"2026-05-17T23:45:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10638","created_at":"2026-05-17T23:45:32Z"},{"alias_kind":"pith_short_12","alias_value":"V3JI7MUOUESM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V3JI7MUOUESM32BH","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V3JI7MUO","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:V3JI7MUOUESM32BHMRDVFDRPWF","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-26T19:00:17Z","cross_cats_sorted":[],"title_canon_sha256":"1571f044ccc0adf4b21aad3aae77fa2af3a95fa5bfdd1769d0019213352d27d7","abstract_canon_sha256":"8d364481b86ddea61a41042f52e8be1ad3c914dad55023b2ab3ebf77fddef6a3"},"schema_version":"1.0"},"canonical_sha256":"aed28fb28ea124cde8276447528e2fb14a3b7b52cb9ebd3ca7bd80975ba70d6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:32.720958Z","signature_b64":"jKagrbVtKFgWtRNunBSDk55CSm0EKL3QzJKJG4Xr9snQ4wHwUh68nWqCSWJbO34It3AskguUr0ZRoOP9swojBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aed28fb28ea124cde8276447528e2fb14a3b7b52cb9ebd3ca7bd80975ba70d6b","last_reissued_at":"2026-05-17T23:45:32.720194Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:32.720194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10638","source_version":1,"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-05-17T23:45:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0TYK5Cc7KITJ6ht0QjXjFVTu0zVue5kSXEUTM3r625tRA0nW+2+5BDkeLbDMn92b/MgFhq2gs9YFr8QFbzXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:13:40.688159Z"},"content_sha256":"40fe363fc3e1450a116d06e63fae26ee9c4b5201fff845dd90b0354aec6a1382","schema_version":"1.0","event_id":"sha256:40fe363fc3e1450a116d06e63fae26ee9c4b5201fff845dd90b0354aec6a1382"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:V3JI7MUOUESM32BHMRDVFDRPWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The defining properties of the Kontsevich unoriented graph complex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthemy V. Kiselev, Nina J. Rutten","submitted_at":"2018-11-26T19:00:17Z","abstract_excerpt":"Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $\\gamma$ be endowed with an ordered set of edges $\\mathsf{E}(\\gamma)$. Denote by Gra the vector space of formal sums of graphs modulo the relation $(\\gamma_1,\\mathsf{E}(\\gamma_1))-\\text{sign}(\\sigma) (\\gamma_2,\\mathsf{E}(\\gamma_2)) = 0$ for topologically equal graphs $\\gamma_1$ and $\\gamma_2$ whose edge orderings differ by a permutation $\\sigma$. The zero class in Gra is represented by sums of graphs that cancel via "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10638","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:45:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIcz7psDGU1YTQ/xoNQArUmSheKTpGVBva6uPDb0/DmAhYM2+ttNZ50FofwazsZysz+tBBChrEnfN2RN8bqkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:13:40.688515Z"},"content_sha256":"a17aff723c5823dc514fdbea5b641581d25f5c7e16e6443d47b74e1a2dd2354e","schema_version":"1.0","event_id":"sha256:a17aff723c5823dc514fdbea5b641581d25f5c7e16e6443d47b74e1a2dd2354e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3JI7MUOUESM32BHMRDVFDRPWF/bundle.json","state_url":"https://pith.science/pith/V3JI7MUOUESM32BHMRDVFDRPWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3JI7MUOUESM32BHMRDVFDRPWF/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-07-05T11:13:40Z","links":{"resolver":"https://pith.science/pith/V3JI7MUOUESM32BHMRDVFDRPWF","bundle":"https://pith.science/pith/V3JI7MUOUESM32BHMRDVFDRPWF/bundle.json","state":"https://pith.science/pith/V3JI7MUOUESM32BHMRDVFDRPWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3JI7MUOUESM32BHMRDVFDRPWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:V3JI7MUOUESM32BHMRDVFDRPWF","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":"8d364481b86ddea61a41042f52e8be1ad3c914dad55023b2ab3ebf77fddef6a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-26T19:00:17Z","title_canon_sha256":"1571f044ccc0adf4b21aad3aae77fa2af3a95fa5bfdd1769d0019213352d27d7"},"schema_version":"1.0","source":{"id":"1811.10638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10638","created_at":"2026-05-17T23:45:32Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10638v1","created_at":"2026-05-17T23:45:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10638","created_at":"2026-05-17T23:45:32Z"},{"alias_kind":"pith_short_12","alias_value":"V3JI7MUOUESM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V3JI7MUOUESM32BH","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V3JI7MUO","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:a17aff723c5823dc514fdbea5b641581d25f5c7e16e6443d47b74e1a2dd2354e","target":"graph","created_at":"2026-05-17T23:45:32Z","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"},"paper":{"abstract_excerpt":"Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $\\gamma$ be endowed with an ordered set of edges $\\mathsf{E}(\\gamma)$. Denote by Gra the vector space of formal sums of graphs modulo the relation $(\\gamma_1,\\mathsf{E}(\\gamma_1))-\\text{sign}(\\sigma) (\\gamma_2,\\mathsf{E}(\\gamma_2)) = 0$ for topologically equal graphs $\\gamma_1$ and $\\gamma_2$ whose edge orderings differ by a permutation $\\sigma$. The zero class in Gra is represented by sums of graphs that cancel via ","authors_text":"Arthemy V. Kiselev, Nina J. Rutten","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-26T19:00:17Z","title":"The defining properties of the Kontsevich unoriented graph complex"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10638","kind":"arxiv","version":1},"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:40fe363fc3e1450a116d06e63fae26ee9c4b5201fff845dd90b0354aec6a1382","target":"record","created_at":"2026-05-17T23:45:32Z","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":"8d364481b86ddea61a41042f52e8be1ad3c914dad55023b2ab3ebf77fddef6a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-26T19:00:17Z","title_canon_sha256":"1571f044ccc0adf4b21aad3aae77fa2af3a95fa5bfdd1769d0019213352d27d7"},"schema_version":"1.0","source":{"id":"1811.10638","kind":"arxiv","version":1}},"canonical_sha256":"aed28fb28ea124cde8276447528e2fb14a3b7b52cb9ebd3ca7bd80975ba70d6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aed28fb28ea124cde8276447528e2fb14a3b7b52cb9ebd3ca7bd80975ba70d6b","first_computed_at":"2026-05-17T23:45:32.720194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:32.720194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jKagrbVtKFgWtRNunBSDk55CSm0EKL3QzJKJG4Xr9snQ4wHwUh68nWqCSWJbO34It3AskguUr0ZRoOP9swojBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:32.720958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40fe363fc3e1450a116d06e63fae26ee9c4b5201fff845dd90b0354aec6a1382","sha256:a17aff723c5823dc514fdbea5b641581d25f5c7e16e6443d47b74e1a2dd2354e"],"state_sha256":"88db03c8cbf2572ca25f5a97d142aaba20845d51a4b5c122293dee4b8c3478cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ded1Qsz8pceryttn0zsO+cF60abl8GOQibXNuE5uL+PhCjsDq9iOI8YXb5cY15yTavfLewmsd6+1srqZlWvBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:13:40.690698Z","bundle_sha256":"3f208d556324fe377d7928a9a8e832d401e37a0e088372db9ccc359ca8cd47be"}}