{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CEE23XGLR4WRKQVIYKQE4WFEYA","short_pith_number":"pith:CEE23XGL","schema_version":"1.0","canonical_sha256":"1109addccb8f2d1542a8c2a04e58a4c01ba5823d1b3ea34e399bc1372bfbabdf","source":{"kind":"arxiv","id":"1410.4118","version":3},"attestation_state":"computed","paper":{"title":"Induced subgraphs of graphs with large chromatic number. I. Odd holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour","submitted_at":"2014-10-15T16:38:12Z","abstract_excerpt":"An odd hole in a graph is an induced subgraph which is a cycle of odd length at least five. In 1985, A. Gyarfas made the conjecture that for all t there exists n such that every graph with no K_t subgraph and no odd hole is n-colourable. We prove this conjecture."},"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":"1410.4118","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-15T16:38:12Z","cross_cats_sorted":[],"title_canon_sha256":"7c3182928b5518f2f11a16bbb6a019015dc2ed0b489ee53ba28228cdde4b3e09","abstract_canon_sha256":"8407773495e7403056a819933db17a24f87eede60e155be262bf759d12d79a6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:35.469269Z","signature_b64":"wu/K+oBZ08z/x87zkDZWbmwugzo0eDTcTOFHfcsub8+ssJoHN+p3FEoYZ/NH7PSe6lz8NJiT0iEjr5PW3LRcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1109addccb8f2d1542a8c2a04e58a4c01ba5823d1b3ea34e399bc1372bfbabdf","last_reissued_at":"2026-05-18T01:34:35.468503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:35.468503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraphs of graphs with large chromatic number. I. Odd holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour","submitted_at":"2014-10-15T16:38:12Z","abstract_excerpt":"An odd hole in a graph is an induced subgraph which is a cycle of odd length at least five. In 1985, A. Gyarfas made the conjecture that for all t there exists n such that every graph with no K_t subgraph and no odd hole is n-colourable. We prove this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4118","kind":"arxiv","version":3},"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":"1410.4118","created_at":"2026-05-18T01:34:35.468684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4118v3","created_at":"2026-05-18T01:34:35.468684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4118","created_at":"2026-05-18T01:34:35.468684+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEE23XGLR4WR","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEE23XGLR4WRKQVI","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEE23XGL","created_at":"2026-05-18T12:28:22.404517+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/CEE23XGLR4WRKQVIYKQE4WFEYA","json":"https://pith.science/pith/CEE23XGLR4WRKQVIYKQE4WFEYA.json","graph_json":"https://pith.science/api/pith-number/CEE23XGLR4WRKQVIYKQE4WFEYA/graph.json","events_json":"https://pith.science/api/pith-number/CEE23XGLR4WRKQVIYKQE4WFEYA/events.json","paper":"https://pith.science/paper/CEE23XGL"},"agent_actions":{"view_html":"https://pith.science/pith/CEE23XGLR4WRKQVIYKQE4WFEYA","download_json":"https://pith.science/pith/CEE23XGLR4WRKQVIYKQE4WFEYA.json","view_paper":"https://pith.science/paper/CEE23XGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4118&json=true","fetch_graph":"https://pith.science/api/pith-number/CEE23XGLR4WRKQVIYKQE4WFEYA/graph.json","fetch_events":"https://pith.science/api/pith-number/CEE23XGLR4WRKQVIYKQE4WFEYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEE23XGLR4WRKQVIYKQE4WFEYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEE23XGLR4WRKQVIYKQE4WFEYA/action/storage_attestation","attest_author":"https://pith.science/pith/CEE23XGLR4WRKQVIYKQE4WFEYA/action/author_attestation","sign_citation":"https://pith.science/pith/CEE23XGLR4WRKQVIYKQE4WFEYA/action/citation_signature","submit_replication":"https://pith.science/pith/CEE23XGLR4WRKQVIYKQE4WFEYA/action/replication_record"}},"created_at":"2026-05-18T01:34:35.468684+00:00","updated_at":"2026-05-18T01:34:35.468684+00:00"}