{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6LLDORFODYUTX5WUK7NZB35GFI","short_pith_number":"pith:6LLDORFO","schema_version":"1.0","canonical_sha256":"f2d63744ae1e293bf6d457db90efa62a20d4d6cf0985fec96ccddf02224eda69","source":{"kind":"arxiv","id":"1411.6465","version":2},"attestation_state":"computed","paper":{"title":"Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyarfas' conjectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour","submitted_at":"2014-11-24T14:32:58Z","abstract_excerpt":"Gyarfas conjectured in 1985 that for all $k$, $l$, every graph with no clique of size more than $k$ and no odd hole of length more than $l$ has chromatic number bounded by a function of $k$ and $l$. We prove three weaker statements: (1) Every triangle-free graph with sufficiently large chromatic number has an odd hole of length different from five; (2) For all $l$, every triangle-free graph with sufficiently large chromatic number contains either a 5-hole or an odd hole of length more than $l$; (3) For all $k$, $l$, every graph with no clique of size more than $k$ and sufficiently large chroma"},"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":"1411.6465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T14:32:58Z","cross_cats_sorted":[],"title_canon_sha256":"f082817f4f80926632abe40cdba12508d4449fe422b6129df97af7cccfe080a5","abstract_canon_sha256":"5a0fb99fe2ddc0d04a4cc3da46d5014498bf21152750c55e921e762f3b2edc2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:35.385263Z","signature_b64":"bDsTX1ubyVctKV3x0N6gRC5B/3PfiHEyQG8bCR1fGxGEf/CkttndtsHFi5S6i/m7CaIGY0Vw5QOkPqSA8n/sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2d63744ae1e293bf6d457db90efa62a20d4d6cf0985fec96ccddf02224eda69","last_reissued_at":"2026-05-18T01:34:35.384498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:35.384498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyarfas' conjectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour","submitted_at":"2014-11-24T14:32:58Z","abstract_excerpt":"Gyarfas conjectured in 1985 that for all $k$, $l$, every graph with no clique of size more than $k$ and no odd hole of length more than $l$ has chromatic number bounded by a function of $k$ and $l$. We prove three weaker statements: (1) Every triangle-free graph with sufficiently large chromatic number has an odd hole of length different from five; (2) For all $l$, every triangle-free graph with sufficiently large chromatic number contains either a 5-hole or an odd hole of length more than $l$; (3) For all $k$, $l$, every graph with no clique of size more than $k$ and sufficiently large chroma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6465","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":"1411.6465","created_at":"2026-05-18T01:34:35.384624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6465v2","created_at":"2026-05-18T01:34:35.384624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6465","created_at":"2026-05-18T01:34:35.384624+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LLDORFODYUT","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LLDORFODYUTX5WU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LLDORFO","created_at":"2026-05-18T12:28:16.859392+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/6LLDORFODYUTX5WUK7NZB35GFI","json":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI.json","graph_json":"https://pith.science/api/pith-number/6LLDORFODYUTX5WUK7NZB35GFI/graph.json","events_json":"https://pith.science/api/pith-number/6LLDORFODYUTX5WUK7NZB35GFI/events.json","paper":"https://pith.science/paper/6LLDORFO"},"agent_actions":{"view_html":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI","download_json":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI.json","view_paper":"https://pith.science/paper/6LLDORFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6465&json=true","fetch_graph":"https://pith.science/api/pith-number/6LLDORFODYUTX5WUK7NZB35GFI/graph.json","fetch_events":"https://pith.science/api/pith-number/6LLDORFODYUTX5WUK7NZB35GFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/action/storage_attestation","attest_author":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/action/author_attestation","sign_citation":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/action/citation_signature","submit_replication":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/action/replication_record"}},"created_at":"2026-05-18T01:34:35.384624+00:00","updated_at":"2026-05-18T01:34:35.384624+00:00"}