{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RBZE2XKCE7AEM3TZCKQMMGZPI7","short_pith_number":"pith:RBZE2XKC","canonical_record":{"source":{"id":"1312.1951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T18:24:47Z","cross_cats_sorted":[],"title_canon_sha256":"3a62db03bb0ef807ae546c2d50637b742ae48c009e4c6ef4c14d5e6f8ad0f4b0","abstract_canon_sha256":"166988330e7b7936cd4ad89cc297ef6ccf6b1ff1b4dfc8334e622c2b097aa8f9"},"schema_version":"1.0"},"canonical_sha256":"88724d5d4227c0466e7912a0c61b2f47ef6bcfa83a40f19caf1cd466036bfb55","source":{"kind":"arxiv","id":"1312.1951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1951","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1951v1","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1951","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"RBZE2XKCE7AE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RBZE2XKCE7AEM3TZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RBZE2XKC","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RBZE2XKCE7AEM3TZCKQMMGZPI7","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T18:24:47Z","cross_cats_sorted":[],"title_canon_sha256":"3a62db03bb0ef807ae546c2d50637b742ae48c009e4c6ef4c14d5e6f8ad0f4b0","abstract_canon_sha256":"166988330e7b7936cd4ad89cc297ef6ccf6b1ff1b4dfc8334e622c2b097aa8f9"},"schema_version":"1.0"},"canonical_sha256":"88724d5d4227c0466e7912a0c61b2f47ef6bcfa83a40f19caf1cd466036bfb55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:19.359827Z","signature_b64":"WZON+GjHYQViMkSkRRSRLBi97jcQPR4kyuS3SHwccI6lP9Zmp/Kqv3VGHbmQUHYWtkg2XabKTVXVVG1y7tITBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88724d5d4227c0466e7912a0c61b2f47ef6bcfa83a40f19caf1cd466036bfb55","last_reissued_at":"2026-05-18T03:05:19.359207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:19.359207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1951","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-18T03:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jeLloTN+WOE9RCq7r7pjs31LR5tQFAYdT7z4cHxiKTYMqyOobPjoMrUtdCFf1EZDXfhkqC72tF72tyxr6mB0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:18.759169Z"},"content_sha256":"3f5292ced6dd2763ad7fc5e35c2cd348f193f04f2d8aeb88284f65bef4e18e6f","schema_version":"1.0","event_id":"sha256:3f5292ced6dd2763ad7fc5e35c2cd348f193f04f2d8aeb88284f65bef4e18e6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RBZE2XKCE7AEM3TZCKQMMGZPI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forbidden Minors For 3-Connected Graphs With No Non-Splitting 5-Configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Iain Crump","submitted_at":"2013-12-06T18:24:47Z","abstract_excerpt":"For a set of five edges, a graph splits if one of the associated Dodgson polynomials is equal to zero. A graph G splitting for every set of five edges is a minor-closed property. As such there is a finite set of forbidden minors F such that if a graph H does not contain a minor isomorphic to any graph in F, then H splits. In this paper we prove that if a graph G is simple, 3-connected, and splits, then G must not contain any minors isomorphic to K5, K3,3, the octahedron, the cube, or a graph that is a single delta-Y transformation away from the cube. As such this is the set of all simple 3-con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1951","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-18T03:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CoIpJ9NPgUspTczTupveGG0VQEKMkGV8ZqbRL7KmvvKadHIQTxT4jmvm9/+fYjm9RKyWpayty4YQu1CK1uhdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:18.759524Z"},"content_sha256":"10b52ec89ba4b757656815e4abf65b630d37f64678284ad309a9bf19575947ce","schema_version":"1.0","event_id":"sha256:10b52ec89ba4b757656815e4abf65b630d37f64678284ad309a9bf19575947ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/bundle.json","state_url":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/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-06-24T05:41:18Z","links":{"resolver":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7","bundle":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/bundle.json","state":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RBZE2XKCE7AEM3TZCKQMMGZPI7","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":"166988330e7b7936cd4ad89cc297ef6ccf6b1ff1b4dfc8334e622c2b097aa8f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T18:24:47Z","title_canon_sha256":"3a62db03bb0ef807ae546c2d50637b742ae48c009e4c6ef4c14d5e6f8ad0f4b0"},"schema_version":"1.0","source":{"id":"1312.1951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1951","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1951v1","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1951","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"RBZE2XKCE7AE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RBZE2XKCE7AEM3TZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RBZE2XKC","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:10b52ec89ba4b757656815e4abf65b630d37f64678284ad309a9bf19575947ce","target":"graph","created_at":"2026-05-18T03:05:19Z","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":"For a set of five edges, a graph splits if one of the associated Dodgson polynomials is equal to zero. A graph G splitting for every set of five edges is a minor-closed property. As such there is a finite set of forbidden minors F such that if a graph H does not contain a minor isomorphic to any graph in F, then H splits. In this paper we prove that if a graph G is simple, 3-connected, and splits, then G must not contain any minors isomorphic to K5, K3,3, the octahedron, the cube, or a graph that is a single delta-Y transformation away from the cube. As such this is the set of all simple 3-con","authors_text":"Iain Crump","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T18:24:47Z","title":"Forbidden Minors For 3-Connected Graphs With No Non-Splitting 5-Configurations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1951","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:3f5292ced6dd2763ad7fc5e35c2cd348f193f04f2d8aeb88284f65bef4e18e6f","target":"record","created_at":"2026-05-18T03:05:19Z","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":"166988330e7b7936cd4ad89cc297ef6ccf6b1ff1b4dfc8334e622c2b097aa8f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T18:24:47Z","title_canon_sha256":"3a62db03bb0ef807ae546c2d50637b742ae48c009e4c6ef4c14d5e6f8ad0f4b0"},"schema_version":"1.0","source":{"id":"1312.1951","kind":"arxiv","version":1}},"canonical_sha256":"88724d5d4227c0466e7912a0c61b2f47ef6bcfa83a40f19caf1cd466036bfb55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88724d5d4227c0466e7912a0c61b2f47ef6bcfa83a40f19caf1cd466036bfb55","first_computed_at":"2026-05-18T03:05:19.359207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:19.359207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WZON+GjHYQViMkSkRRSRLBi97jcQPR4kyuS3SHwccI6lP9Zmp/Kqv3VGHbmQUHYWtkg2XabKTVXVVG1y7tITBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:19.359827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f5292ced6dd2763ad7fc5e35c2cd348f193f04f2d8aeb88284f65bef4e18e6f","sha256:10b52ec89ba4b757656815e4abf65b630d37f64678284ad309a9bf19575947ce"],"state_sha256":"d2564b64b89632539df567fac8ba7839971074cde01b8803491b26ce2adf5595"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFbD+CQTpHGv91z9LL8nPzZbkxCQ5/6O5lBTcxfajydmeUSVkONYQ9jXnVUHjf6d6Y7LjGmJqp3zj6glT16rCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:41:18.761379Z","bundle_sha256":"f27db1635694543bc75e07acd8cbfa8e64d401642a7336104280facb1918b29d"}}