{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RBZE2XKCE7AEM3TZCKQMMGZPI7","short_pith_number":"pith:RBZE2XKC","schema_version":"1.0","canonical_sha256":"88724d5d4227c0466e7912a0c61b2f47ef6bcfa83a40f19caf1cd466036bfb55","source":{"kind":"arxiv","id":"1312.1951","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.1951","created_at":"2026-05-18T03:05:19.359300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1951v1","created_at":"2026-05-18T03:05:19.359300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1951","created_at":"2026-05-18T03:05:19.359300+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBZE2XKCE7AE","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBZE2XKCE7AEM3TZ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBZE2XKC","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7","json":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7.json","graph_json":"https://pith.science/api/pith-number/RBZE2XKCE7AEM3TZCKQMMGZPI7/graph.json","events_json":"https://pith.science/api/pith-number/RBZE2XKCE7AEM3TZCKQMMGZPI7/events.json","paper":"https://pith.science/paper/RBZE2XKC"},"agent_actions":{"view_html":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7","download_json":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7.json","view_paper":"https://pith.science/paper/RBZE2XKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1951&json=true","fetch_graph":"https://pith.science/api/pith-number/RBZE2XKCE7AEM3TZCKQMMGZPI7/graph.json","fetch_events":"https://pith.science/api/pith-number/RBZE2XKCE7AEM3TZCKQMMGZPI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/action/storage_attestation","attest_author":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/action/author_attestation","sign_citation":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/action/citation_signature","submit_replication":"https://pith.science/pith/RBZE2XKCE7AEM3TZCKQMMGZPI7/action/replication_record"}},"created_at":"2026-05-18T03:05:19.359300+00:00","updated_at":"2026-05-18T03:05:19.359300+00:00"}