{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PRZUSH3DMKSQB4N2Y2LNCLRROU","short_pith_number":"pith:PRZUSH3D","schema_version":"1.0","canonical_sha256":"7c73491f6362a500f1bac696d12e317515a97a82fcd0ae25e609de05f1d6bd30","source":{"kind":"arxiv","id":"1203.2171","version":2},"attestation_state":"computed","paper":{"title":"K_6 minors in 6-connected graphs of bounded tree-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ken-ichi Kawarabayashi, Paul Wollan, Robin Thomas, Serguei Norine","submitted_at":"2012-03-09T20:24:10Z","abstract_excerpt":"We prove that every sufficiently big 6-connected graph of bounded tree-width either has a K_6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently big 6-connected graphs. Jorgensen conjectured that it holds for all 6-connected graphs."},"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":"1203.2171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-09T20:24:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6d850241c155d31ba57f5213f45c5069f7eefa0b40e935d95ff506d4c546715c","abstract_canon_sha256":"166a29814e99118a74dd6e9b1a134f6aa1711d880607290eb90ce6dd4a88f778"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:54.011721Z","signature_b64":"9+uuFJ+iiH0beg+9LfS2/RZOidU9N/TZqGVsBlHaWK2qw55JOPjdPLPiU2fKo05ND4sQkX1VfjCD4Nu5lCSbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c73491f6362a500f1bac696d12e317515a97a82fcd0ae25e609de05f1d6bd30","last_reissued_at":"2026-05-18T03:28:54.011139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:54.011139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K_6 minors in 6-connected graphs of bounded tree-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ken-ichi Kawarabayashi, Paul Wollan, Robin Thomas, Serguei Norine","submitted_at":"2012-03-09T20:24:10Z","abstract_excerpt":"We prove that every sufficiently big 6-connected graph of bounded tree-width either has a K_6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently big 6-connected graphs. Jorgensen conjectured that it holds for all 6-connected graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2171","kind":"arxiv","version":2},"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":"1203.2171","created_at":"2026-05-18T03:28:54.011219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2171v2","created_at":"2026-05-18T03:28:54.011219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2171","created_at":"2026-05-18T03:28:54.011219+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRZUSH3DMKSQ","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRZUSH3DMKSQB4N2","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRZUSH3D","created_at":"2026-05-18T12:27:18.751474+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/PRZUSH3DMKSQB4N2Y2LNCLRROU","json":"https://pith.science/pith/PRZUSH3DMKSQB4N2Y2LNCLRROU.json","graph_json":"https://pith.science/api/pith-number/PRZUSH3DMKSQB4N2Y2LNCLRROU/graph.json","events_json":"https://pith.science/api/pith-number/PRZUSH3DMKSQB4N2Y2LNCLRROU/events.json","paper":"https://pith.science/paper/PRZUSH3D"},"agent_actions":{"view_html":"https://pith.science/pith/PRZUSH3DMKSQB4N2Y2LNCLRROU","download_json":"https://pith.science/pith/PRZUSH3DMKSQB4N2Y2LNCLRROU.json","view_paper":"https://pith.science/paper/PRZUSH3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2171&json=true","fetch_graph":"https://pith.science/api/pith-number/PRZUSH3DMKSQB4N2Y2LNCLRROU/graph.json","fetch_events":"https://pith.science/api/pith-number/PRZUSH3DMKSQB4N2Y2LNCLRROU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRZUSH3DMKSQB4N2Y2LNCLRROU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRZUSH3DMKSQB4N2Y2LNCLRROU/action/storage_attestation","attest_author":"https://pith.science/pith/PRZUSH3DMKSQB4N2Y2LNCLRROU/action/author_attestation","sign_citation":"https://pith.science/pith/PRZUSH3DMKSQB4N2Y2LNCLRROU/action/citation_signature","submit_replication":"https://pith.science/pith/PRZUSH3DMKSQB4N2Y2LNCLRROU/action/replication_record"}},"created_at":"2026-05-18T03:28:54.011219+00:00","updated_at":"2026-05-18T03:28:54.011219+00:00"}