{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:H2AAU2HCXYH3JTP3NY4KIMLI6G","short_pith_number":"pith:H2AAU2HC","canonical_record":{"source":{"id":"2605.15125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"9cda9a8812f9c0053c5ed60b72edd91cb257013ee28ac91a631d8a2c45ea47a4","abstract_canon_sha256":"50f42f72f85bafcc837605104292499a292e751a69afebab61b9127eea023d35"},"schema_version":"1.0"},"canonical_sha256":"3e800a68e2be0fb4cdfb6e38a43168f1be208648cca56a1252394669f6123e68","source":{"kind":"arxiv","id":"2605.15125","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15125","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15125v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"H2AAU2HCXYH3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"H2AAU2HCXYH3JTP3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"H2AAU2HC","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:H2AAU2HCXYH3JTP3NY4KIMLI6G","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"9cda9a8812f9c0053c5ed60b72edd91cb257013ee28ac91a631d8a2c45ea47a4","abstract_canon_sha256":"50f42f72f85bafcc837605104292499a292e751a69afebab61b9127eea023d35"},"schema_version":"1.0"},"canonical_sha256":"3e800a68e2be0fb4cdfb6e38a43168f1be208648cca56a1252394669f6123e68","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.2","canonical_sha256":"3e800a68e2be0fb4cdfb6e38a43168f1be208648cca56a1252394669f6123e68","last_reissued_at":"2026-05-17T21:57:18.994000Z","signature_status":"unsigned_v0","first_computed_at":"2026-05-17T21:40:25.668389Z"},"source_kind":"arxiv","source_id":"2605.15125","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-17T21:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zb8qHK0uJLU2HlquBT4H3yL9ebgwGODVBic/V3Upj6FmFYK+VKY2GQs4tIM8gC9WOjBxu8dq5+SMcwJuYTvPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:48:06.313211Z"},"content_sha256":"9512b3641e88b70b0510667a513f0c9cf9c967b3cc555a35ca7bf8c65df48b83","schema_version":"1.0","event_id":"sha256:9512b3641e88b70b0510667a513f0c9cf9c967b3cc555a35ca7bf8c65df48b83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:H2AAU2HCXYH3JTP3NY4KIMLI6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An excluded minor theorem for the 6-wheel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"This paper classifies every 3-connected nonplanar graph without a 6-wheel minor, completing the full characterization of W6-minor-free graphs.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Weihua Yang, Yuqi Xu, Zijun Chen","submitted_at":"2026-05-14T17:37:15Z","abstract_excerpt":"For each integer $n \\geq 3$, the wheel graph $W_n$ is defined as the graph obtained by connecting a single vertex to all vertices of a cycle of length $n$. In particular, $W_6$ can be uniquely obtained from the Petersen graph by contracting three edges incident to a common vertex. Gubser provided a characterization of all 3-connected planar $W_6$-minor-free graphs. In this paper, we complete the characterization of $W_6$-minor-free graphs by determining the 3-connected nonplanar cases."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In this paper, we complete the characterization of W_6-minor-free graphs by determining the 3-connected nonplanar cases.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Gubser's characterization of the planar 3-connected W_6-minor-free graphs is complete and correct, allowing the nonplanar cases to be exhaustively determined by the same minor-exclusion framework.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"All 3-connected nonplanar W_6-minor-free graphs are characterized.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"This paper classifies every 3-connected nonplanar graph without a 6-wheel minor, completing the full characterization of W6-minor-free graphs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"eaf8c2099b06bb310378566d8d66f13aa81e463ded2e4a918833ee646d5d1d3f"},"source":{"id":"2605.15125","kind":"arxiv","version":1},"verdict":{"id":"7ae210e7-2324-4215-a991-73ceab65421e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:08:48.771273Z","strongest_claim":"In this paper, we complete the characterization of W_6-minor-free graphs by determining the 3-connected nonplanar cases.","one_line_summary":"All 3-connected nonplanar W_6-minor-free graphs are characterized.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Gubser's characterization of the planar 3-connected W_6-minor-free graphs is complete and correct, allowing the nonplanar cases to be exhaustively determined by the same minor-exclusion framework.","pith_extraction_headline":"This paper classifies every 3-connected nonplanar graph without a 6-wheel minor, completing the full characterization of W6-minor-free graphs."},"references":{"count":14,"sample":[{"doi":"","year":2007,"title":"G. Brinkmann and B. McKay. Fast generation of planar graphs.Match- Communications in Mathematical and in Computer Chemistry, 58(2):323–357, 2007. ISSN 0340-6253","work_id":"2502d32c-30fb-4ea8-9a63-5b81a98d48ce","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"G. Ding. A characterization of graphs with no octahedron minor.Journal of Graph Theory, 74(2):143–162, 2013","work_id":"5b9aa960-77e0-4398-9041-86e76749ef89","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"G. Ding and C. Liu. Excluding a small minor.Discrete Applied Mathematics, 161 (3):355–368, 2013","work_id":"6d4b1372-dcc3-4ed0-8626-b22a7d61ae50","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1952,"title":"G.A. Dirac. A property of 4-chromatic graphs and some remarks on critical graphs. Journal of the London Mathematical Society, 1(1):85–92, 1952","work_id":"6c413e98-19f8-4141-b431-0e9dd130f714","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"A.B. Ferguson. Excluding two minors of the petersen graph.Louisiana State Uni- versity and Agricultural and Mechanical College, 2015","work_id":"c2251b54-54e8-4748-aae2-50c741b69d11","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":14,"snapshot_sha256":"eab5a4ae2bc326e3fab97a2a5c3f4457d3d9d3192238966f99ea90a5a32ae9c8","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"a6b93e11be86c3fc663586b858856cd483a04799676e05a05094fcdbf0859c2c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7ae210e7-2324-4215-a991-73ceab65421e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T21:57:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0VQNKDP0xjYA03RTpAfRSHGPPI1n35q4CLxS/HGI21wV8bPuyVkgXIwGoMQy+qTL/OhDamxfo3863ctIT0nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:48:06.313822Z"},"content_sha256":"e8d935459201dc4c2d89d6e8f4bdbfcbeab89fa30cc1537572690fb0e677a576","schema_version":"1.0","event_id":"sha256:e8d935459201dc4c2d89d6e8f4bdbfcbeab89fa30cc1537572690fb0e677a576"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2AAU2HCXYH3JTP3NY4KIMLI6G/bundle.json","state_url":"https://pith.science/pith/H2AAU2HCXYH3JTP3NY4KIMLI6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2AAU2HCXYH3JTP3NY4KIMLI6G/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-01T13:48:06Z","links":{"resolver":"https://pith.science/pith/H2AAU2HCXYH3JTP3NY4KIMLI6G","bundle":"https://pith.science/pith/H2AAU2HCXYH3JTP3NY4KIMLI6G/bundle.json","state":"https://pith.science/pith/H2AAU2HCXYH3JTP3NY4KIMLI6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2AAU2HCXYH3JTP3NY4KIMLI6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:H2AAU2HCXYH3JTP3NY4KIMLI6G","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":"50f42f72f85bafcc837605104292499a292e751a69afebab61b9127eea023d35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:37:15Z","title_canon_sha256":"9cda9a8812f9c0053c5ed60b72edd91cb257013ee28ac91a631d8a2c45ea47a4"},"schema_version":"1.0","source":{"id":"2605.15125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15125","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15125v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"H2AAU2HCXYH3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"H2AAU2HCXYH3JTP3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"H2AAU2HC","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e8d935459201dc4c2d89d6e8f4bdbfcbeab89fa30cc1537572690fb0e677a576","target":"graph","created_at":"2026-05-17T21:57:18Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"In this paper, we complete the characterization of W_6-minor-free graphs by determining the 3-connected nonplanar cases."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Gubser's characterization of the planar 3-connected W_6-minor-free graphs is complete and correct, allowing the nonplanar cases to be exhaustively determined by the same minor-exclusion framework."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"All 3-connected nonplanar W_6-minor-free graphs are characterized."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"This paper classifies every 3-connected nonplanar graph without a 6-wheel minor, completing the full characterization of W6-minor-free graphs."}],"snapshot_sha256":"eaf8c2099b06bb310378566d8d66f13aa81e463ded2e4a918833ee646d5d1d3f"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"a6b93e11be86c3fc663586b858856cd483a04799676e05a05094fcdbf0859c2c"},"paper":{"abstract_excerpt":"For each integer $n \\geq 3$, the wheel graph $W_n$ is defined as the graph obtained by connecting a single vertex to all vertices of a cycle of length $n$. In particular, $W_6$ can be uniquely obtained from the Petersen graph by contracting three edges incident to a common vertex. Gubser provided a characterization of all 3-connected planar $W_6$-minor-free graphs. In this paper, we complete the characterization of $W_6$-minor-free graphs by determining the 3-connected nonplanar cases.","authors_text":"Weihua Yang, Yuqi Xu, Zijun Chen","cross_cats":[],"headline":"This paper classifies every 3-connected nonplanar graph without a 6-wheel minor, completing the full characterization of W6-minor-free graphs.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:37:15Z","title":"An excluded minor theorem for the 6-wheel"},"references":{"count":14,"internal_anchors":0,"resolved_work":14,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"G. Brinkmann and B. McKay. Fast generation of planar graphs.Match- Communications in Mathematical and in Computer Chemistry, 58(2):323–357, 2007. ISSN 0340-6253","work_id":"2502d32c-30fb-4ea8-9a63-5b81a98d48ce","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"G. Ding. A characterization of graphs with no octahedron minor.Journal of Graph Theory, 74(2):143–162, 2013","work_id":"5b9aa960-77e0-4398-9041-86e76749ef89","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"G. Ding and C. Liu. Excluding a small minor.Discrete Applied Mathematics, 161 (3):355–368, 2013","work_id":"6d4b1372-dcc3-4ed0-8626-b22a7d61ae50","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"G.A. Dirac. A property of 4-chromatic graphs and some remarks on critical graphs. Journal of the London Mathematical Society, 1(1):85–92, 1952","work_id":"6c413e98-19f8-4141-b431-0e9dd130f714","year":1952},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A.B. Ferguson. Excluding two minors of the petersen graph.Louisiana State Uni- versity and Agricultural and Mechanical College, 2015","work_id":"c2251b54-54e8-4748-aae2-50c741b69d11","year":2015}],"snapshot_sha256":"eab5a4ae2bc326e3fab97a2a5c3f4457d3d9d3192238966f99ea90a5a32ae9c8"},"source":{"id":"2605.15125","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:08:48.771273Z","id":"7ae210e7-2324-4215-a991-73ceab65421e","model_set":{"reader":"grok-4.3"},"one_line_summary":"All 3-connected nonplanar W_6-minor-free graphs are characterized.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"This paper classifies every 3-connected nonplanar graph without a 6-wheel minor, completing the full characterization of W6-minor-free graphs.","strongest_claim":"In this paper, we complete the characterization of W_6-minor-free graphs by determining the 3-connected nonplanar cases.","weakest_assumption":"Gubser's characterization of the planar 3-connected W_6-minor-free graphs is complete and correct, allowing the nonplanar cases to be exhaustively determined by the same minor-exclusion framework."}},"verdict_id":"7ae210e7-2324-4215-a991-73ceab65421e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9512b3641e88b70b0510667a513f0c9cf9c967b3cc555a35ca7bf8c65df48b83","target":"record","created_at":"2026-05-17T21:18:33Z","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":"50f42f72f85bafcc837605104292499a292e751a69afebab61b9127eea023d35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:37:15Z","title_canon_sha256":"9cda9a8812f9c0053c5ed60b72edd91cb257013ee28ac91a631d8a2c45ea47a4"},"schema_version":"1.0","source":{"id":"2605.15125","kind":"arxiv","version":1}},"canonical_sha256":"3e800a68e2be0fb4cdfb6e38a43168f1be208648cca56a1252394669f6123e68","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e800a68e2be0fb4cdfb6e38a43168f1be208648cca56a1252394669f6123e68","first_computed_at":"2026-05-17T21:40:25.668389Z","kind":"pith_receipt","last_reissued_at":"2026-05-17T21:57:18.994000Z","receipt_version":"0.2","signature_status":"unsigned_v0"},"source_id":"2605.15125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9512b3641e88b70b0510667a513f0c9cf9c967b3cc555a35ca7bf8c65df48b83","sha256:e8d935459201dc4c2d89d6e8f4bdbfcbeab89fa30cc1537572690fb0e677a576"],"state_sha256":"f77789a1984fcb273a8fb443a9d9415819f4fa15cac99ca617c0b1aa554dea28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XZRCAVnP7MgaKKS5T7VkRDxI5lNKFjFa2FhnHZLhOQXcjszkQHy1NpXLjDoZLqrsoLl8/e0rdtxsss60NMzyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:48:06.316416Z","bundle_sha256":"67366bf4d8a3c653777ae2156ad0fe4d1b8bd821d7221f2afe21ec99be8d1cb4"}}