{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KYGR4DQL5CPNT4LNPVV7G44UOZ","short_pith_number":"pith:KYGR4DQL","schema_version":"1.0","canonical_sha256":"560d1e0e0be89ed9f16d7d6bf373947662fb3c495b857c358201fdd200b29dd5","source":{"kind":"arxiv","id":"1701.07217","version":3},"attestation_state":"computed","paper":{"title":"Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour, Sophie Spirkl","submitted_at":"2017-01-25T09:22:48Z","abstract_excerpt":"We prove a conjecture of Andras Gyarfas, that for all k,t, every graph with clique number at most k and sufficiently large chromatic number has an odd hole of length at least t."},"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":"1701.07217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-25T09:22:48Z","cross_cats_sorted":[],"title_canon_sha256":"1985cba53132dce1462bc19dfba475e30d77ab7d38b2cd066f5c5d9f63981f24","abstract_canon_sha256":"5d95ff0cc08e1d48e617458e7fb95ffc016d716840f671bc2b65d03a90e102f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:40.327420Z","signature_b64":"bbK5hnmfwCRp8CpZLvBoXb6AUTr45XZltu5CK2FNNGYY6Nz2j8S4yuyq5zFqy3whhoSvUkfLazxkK8mwdDbJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"560d1e0e0be89ed9f16d7d6bf373947662fb3c495b857c358201fdd200b29dd5","last_reissued_at":"2026-05-17T23:47:40.326978Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:40.326978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour, Sophie Spirkl","submitted_at":"2017-01-25T09:22:48Z","abstract_excerpt":"We prove a conjecture of Andras Gyarfas, that for all k,t, every graph with clique number at most k and sufficiently large chromatic number has an odd hole of length at least t."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07217","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":"1701.07217","created_at":"2026-05-17T23:47:40.327054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07217v3","created_at":"2026-05-17T23:47:40.327054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07217","created_at":"2026-05-17T23:47:40.327054+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYGR4DQL5CPN","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYGR4DQL5CPNT4LN","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYGR4DQL","created_at":"2026-05-18T12:31:28.150371+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/KYGR4DQL5CPNT4LNPVV7G44UOZ","json":"https://pith.science/pith/KYGR4DQL5CPNT4LNPVV7G44UOZ.json","graph_json":"https://pith.science/api/pith-number/KYGR4DQL5CPNT4LNPVV7G44UOZ/graph.json","events_json":"https://pith.science/api/pith-number/KYGR4DQL5CPNT4LNPVV7G44UOZ/events.json","paper":"https://pith.science/paper/KYGR4DQL"},"agent_actions":{"view_html":"https://pith.science/pith/KYGR4DQL5CPNT4LNPVV7G44UOZ","download_json":"https://pith.science/pith/KYGR4DQL5CPNT4LNPVV7G44UOZ.json","view_paper":"https://pith.science/paper/KYGR4DQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07217&json=true","fetch_graph":"https://pith.science/api/pith-number/KYGR4DQL5CPNT4LNPVV7G44UOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KYGR4DQL5CPNT4LNPVV7G44UOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYGR4DQL5CPNT4LNPVV7G44UOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYGR4DQL5CPNT4LNPVV7G44UOZ/action/storage_attestation","attest_author":"https://pith.science/pith/KYGR4DQL5CPNT4LNPVV7G44UOZ/action/author_attestation","sign_citation":"https://pith.science/pith/KYGR4DQL5CPNT4LNPVV7G44UOZ/action/citation_signature","submit_replication":"https://pith.science/pith/KYGR4DQL5CPNT4LNPVV7G44UOZ/action/replication_record"}},"created_at":"2026-05-17T23:47:40.327054+00:00","updated_at":"2026-05-17T23:47:40.327054+00:00"}