{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ODAEQBU5G3OCRUZOOPMUC2DKT3","short_pith_number":"pith:ODAEQBU5","schema_version":"1.0","canonical_sha256":"70c048069d36dc28d32e73d941686a9ef187f9a6ca004fd1d17dd57c07ea0304","source":{"kind":"arxiv","id":"1309.1926","version":1},"attestation_state":"computed","paper":{"title":"On graphs with no induced subdivision of $K_4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin L\\'ev\\^eque, Fr\\'ed\\'eric Maffray, Nicolas Trotignon","submitted_at":"2013-09-08T06:06:05Z","abstract_excerpt":"We prove a decomposition theorem for graphs that do not contain a subdivision of $K_4$ as an induced subgraph where $K_4$ is the complete graph on four vertices. We obtain also a structure theorem for the class $\\cal C$ of graphs that contain neither a subdivision of $K_4$ nor a wheel as an induced subgraph, where a wheel is a cycle on at least four vertices together with a vertex that has at least three neighbors on the cycle. Our structure theorem is used to prove that every graph in $\\cal C$ is 3-colorable and entails a polynomial-time recognition algorithm for membership in $\\cal C$. As an"},"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.1926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-08T06:06:05Z","cross_cats_sorted":[],"title_canon_sha256":"2e5585581b8d69d45c91ce76be6d68ebaafc8942e3d245bd0f9231bdcd9e006d","abstract_canon_sha256":"bbc3c8015994271be0c14757b2e41d7a7f87a68a53955a800e08134d196d34c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:57.002535Z","signature_b64":"uQDKLx4Ra8Q3kRx3hFCBsZ3HmlfdiTU7yI+NyY8IJXPP6WGkhcR7+7m5Ztyuqj4iP6bktJrKi8ktoAgA/Ob+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70c048069d36dc28d32e73d941686a9ef187f9a6ca004fd1d17dd57c07ea0304","last_reissued_at":"2026-05-18T03:13:57.001933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:57.001933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs with no induced subdivision of $K_4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin L\\'ev\\^eque, Fr\\'ed\\'eric Maffray, Nicolas Trotignon","submitted_at":"2013-09-08T06:06:05Z","abstract_excerpt":"We prove a decomposition theorem for graphs that do not contain a subdivision of $K_4$ as an induced subgraph where $K_4$ is the complete graph on four vertices. We obtain also a structure theorem for the class $\\cal C$ of graphs that contain neither a subdivision of $K_4$ nor a wheel as an induced subgraph, where a wheel is a cycle on at least four vertices together with a vertex that has at least three neighbors on the cycle. Our structure theorem is used to prove that every graph in $\\cal C$ is 3-colorable and entails a polynomial-time recognition algorithm for membership in $\\cal C$. As an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1926","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":"1309.1926","created_at":"2026-05-18T03:13:57.002036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1926v1","created_at":"2026-05-18T03:13:57.002036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1926","created_at":"2026-05-18T03:13:57.002036+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODAEQBU5G3OC","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODAEQBU5G3OCRUZO","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODAEQBU5","created_at":"2026-05-18T12:27:54.935989+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/ODAEQBU5G3OCRUZOOPMUC2DKT3","json":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3.json","graph_json":"https://pith.science/api/pith-number/ODAEQBU5G3OCRUZOOPMUC2DKT3/graph.json","events_json":"https://pith.science/api/pith-number/ODAEQBU5G3OCRUZOOPMUC2DKT3/events.json","paper":"https://pith.science/paper/ODAEQBU5"},"agent_actions":{"view_html":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3","download_json":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3.json","view_paper":"https://pith.science/paper/ODAEQBU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1926&json=true","fetch_graph":"https://pith.science/api/pith-number/ODAEQBU5G3OCRUZOOPMUC2DKT3/graph.json","fetch_events":"https://pith.science/api/pith-number/ODAEQBU5G3OCRUZOOPMUC2DKT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/action/storage_attestation","attest_author":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/action/author_attestation","sign_citation":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/action/citation_signature","submit_replication":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/action/replication_record"}},"created_at":"2026-05-18T03:13:57.002036+00:00","updated_at":"2026-05-18T03:13:57.002036+00:00"}