{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NOKTP2J3QIWI57RT4X3FD5JHTZ","short_pith_number":"pith:NOKTP2J3","schema_version":"1.0","canonical_sha256":"6b9537e93b822c8efe33e5f651f5279e4da1e77ff0c680a57384b5bb48cd6626","source":{"kind":"arxiv","id":"1309.7120","version":2},"attestation_state":"computed","paper":{"title":"Wheel-free planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Nicolas Trotignon, Paul Seymour, Pierre Aboulker","submitted_at":"2013-09-27T06:01:41Z","abstract_excerpt":"A \\emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not in $C$ that has at least three neighbors in $C$. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable."},"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":"1309.7120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T06:01:41Z","cross_cats_sorted":[],"title_canon_sha256":"ae8b8885e48daeaa1c8612c01907854c70878a08ec2520c36e329ee06adb7d98","abstract_canon_sha256":"404eca09bde65af8734fc35a56a3e671558d4a6e33bf2fc9a6a2d9ce0bb57238"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:25.813226Z","signature_b64":"sr6ak44axT1xGEFCy3Nh6ZetpUnQ8ZG01/XJdiRub7TM3B70pP9Yv8EAGekcw1kmx+ZL46W57dLF+3Iu0TotAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b9537e93b822c8efe33e5f651f5279e4da1e77ff0c680a57384b5bb48cd6626","last_reissued_at":"2026-05-18T02:19:25.812555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:25.812555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wheel-free planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Nicolas Trotignon, Paul Seymour, Pierre Aboulker","submitted_at":"2013-09-27T06:01:41Z","abstract_excerpt":"A \\emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not in $C$ that has at least three neighbors in $C$. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7120","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":"1309.7120","created_at":"2026-05-18T02:19:25.812659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7120v2","created_at":"2026-05-18T02:19:25.812659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7120","created_at":"2026-05-18T02:19:25.812659+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOKTP2J3QIWI","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOKTP2J3QIWI57RT","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOKTP2J3","created_at":"2026-05-18T12:27:52.871228+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/NOKTP2J3QIWI57RT4X3FD5JHTZ","json":"https://pith.science/pith/NOKTP2J3QIWI57RT4X3FD5JHTZ.json","graph_json":"https://pith.science/api/pith-number/NOKTP2J3QIWI57RT4X3FD5JHTZ/graph.json","events_json":"https://pith.science/api/pith-number/NOKTP2J3QIWI57RT4X3FD5JHTZ/events.json","paper":"https://pith.science/paper/NOKTP2J3"},"agent_actions":{"view_html":"https://pith.science/pith/NOKTP2J3QIWI57RT4X3FD5JHTZ","download_json":"https://pith.science/pith/NOKTP2J3QIWI57RT4X3FD5JHTZ.json","view_paper":"https://pith.science/paper/NOKTP2J3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7120&json=true","fetch_graph":"https://pith.science/api/pith-number/NOKTP2J3QIWI57RT4X3FD5JHTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NOKTP2J3QIWI57RT4X3FD5JHTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOKTP2J3QIWI57RT4X3FD5JHTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOKTP2J3QIWI57RT4X3FD5JHTZ/action/storage_attestation","attest_author":"https://pith.science/pith/NOKTP2J3QIWI57RT4X3FD5JHTZ/action/author_attestation","sign_citation":"https://pith.science/pith/NOKTP2J3QIWI57RT4X3FD5JHTZ/action/citation_signature","submit_replication":"https://pith.science/pith/NOKTP2J3QIWI57RT4X3FD5JHTZ/action/replication_record"}},"created_at":"2026-05-18T02:19:25.812659+00:00","updated_at":"2026-05-18T02:19:25.812659+00:00"}