{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ODAEQBU5G3OCRUZOOPMUC2DKT3","short_pith_number":"pith:ODAEQBU5","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"},"canonical_sha256":"70c048069d36dc28d32e73d941686a9ef187f9a6ca004fd1d17dd57c07ea0304","source":{"kind":"arxiv","id":"1309.1926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1926","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1926v1","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1926","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"ODAEQBU5G3OC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"ODAEQBU5G3OCRUZO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"ODAEQBU5","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ODAEQBU5G3OCRUZOOPMUC2DKT3","target":"record","payload":{"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"},"canonical_sha256":"70c048069d36dc28d32e73d941686a9ef187f9a6ca004fd1d17dd57c07ea0304","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"},"source_kind":"arxiv","source_id":"1309.1926","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-18T03:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9Y2qZFejVGp6Se1cODSzcarU6woY6rWuq5avz8XDeh1K4RQvCR5Mi9eoVnIOE3pmuoasfC6bG64conr9qMhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:17:11.521005Z"},"content_sha256":"ee15658384e4f97baec716a908860a8d1bcd531a58b616f6b2cb6dae085e8265","schema_version":"1.0","event_id":"sha256:ee15658384e4f97baec716a908860a8d1bcd531a58b616f6b2cb6dae085e8265"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ODAEQBU5G3OCRUZOOPMUC2DKT3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ByCsGzFK+tP4Zze+ZV1/uBQqAjt3ggIjoblAqbSf6K1txHRgDUSwVqZJDaxMzXzJobtBZca8GXBTBUSXWKxGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:17:11.521370Z"},"content_sha256":"14134e6f4af0b173911723724506136ff468de5d014feb9a210fc87737db2930","schema_version":"1.0","event_id":"sha256:14134e6f4af0b173911723724506136ff468de5d014feb9a210fc87737db2930"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/bundle.json","state_url":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/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-05-31T07:17:11Z","links":{"resolver":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3","bundle":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/bundle.json","state":"https://pith.science/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODAEQBU5G3OCRUZOOPMUC2DKT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ODAEQBU5G3OCRUZOOPMUC2DKT3","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":"bbc3c8015994271be0c14757b2e41d7a7f87a68a53955a800e08134d196d34c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-08T06:06:05Z","title_canon_sha256":"2e5585581b8d69d45c91ce76be6d68ebaafc8942e3d245bd0f9231bdcd9e006d"},"schema_version":"1.0","source":{"id":"1309.1926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1926","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1926v1","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1926","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"ODAEQBU5G3OC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"ODAEQBU5G3OCRUZO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"ODAEQBU5","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:14134e6f4af0b173911723724506136ff468de5d014feb9a210fc87737db2930","target":"graph","created_at":"2026-05-18T03:13:57Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Benjamin L\\'ev\\^eque, Fr\\'ed\\'eric Maffray, Nicolas Trotignon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-08T06:06:05Z","title":"On graphs with no induced subdivision of $K_4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1926","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ee15658384e4f97baec716a908860a8d1bcd531a58b616f6b2cb6dae085e8265","target":"record","created_at":"2026-05-18T03:13:57Z","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":"bbc3c8015994271be0c14757b2e41d7a7f87a68a53955a800e08134d196d34c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-08T06:06:05Z","title_canon_sha256":"2e5585581b8d69d45c91ce76be6d68ebaafc8942e3d245bd0f9231bdcd9e006d"},"schema_version":"1.0","source":{"id":"1309.1926","kind":"arxiv","version":1}},"canonical_sha256":"70c048069d36dc28d32e73d941686a9ef187f9a6ca004fd1d17dd57c07ea0304","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70c048069d36dc28d32e73d941686a9ef187f9a6ca004fd1d17dd57c07ea0304","first_computed_at":"2026-05-18T03:13:57.001933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:57.001933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uQDKLx4Ra8Q3kRx3hFCBsZ3HmlfdiTU7yI+NyY8IJXPP6WGkhcR7+7m5Ztyuqj4iP6bktJrKi8ktoAgA/Ob+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:57.002535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee15658384e4f97baec716a908860a8d1bcd531a58b616f6b2cb6dae085e8265","sha256:14134e6f4af0b173911723724506136ff468de5d014feb9a210fc87737db2930"],"state_sha256":"79ecb69612c8658018b9131c2f821db35d7a03be3b6e08bea47d8e8aed46cc30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWtmT1IDAHM57bqGPv1ZRhmJj2wv6IluM4ri9iXR1no9YiVwy7MfmfHgT8NiZL6hLKoags+3q9wnHCsBfplTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:17:11.523656Z","bundle_sha256":"5c001c51c372078eeb1932fdea71dccdaba52dd97384832a0a97e560dfc8c114"}}