{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VHGRZGOHUTLHCBVQ7WEPY7EJR5","short_pith_number":"pith:VHGRZGOH","schema_version":"1.0","canonical_sha256":"a9cd1c99c7a4d67106b0fd88fc7c898f6093a2cf168ea031ba47b1f67f26417d","source":{"kind":"arxiv","id":"2302.01875","version":2},"attestation_state":"computed","paper":{"title":"Graphs with large minimum degree and no small odd cycles are $3$-colourable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domenico Mergoni Cecchelli, Jozef Skokan, Julia B\\\"ottcher, N\\'ora Frankl, Olaf Parczyk","submitted_at":"2023-02-03T17:24:54Z","abstract_excerpt":"Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$-vertex graph $G$ with minimum degree at least $\\frac{1}{2k-1}n$ and without odd cycles of length less than $2k+1$ is $3$-colourable. In fact, we prove a stronger result that works with a slightly smaller minimum degree."},"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":"2302.01875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-03T17:24:54Z","cross_cats_sorted":[],"title_canon_sha256":"51ae6d98be6f7dd647d3c5c6d37506d53878ddee4e7d9fbbbcdbc8ac2dee2557","abstract_canon_sha256":"fd4279671f47dc8ea38125d6fb70904b04469d6c92e5091e0f80eca87be4974d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:50.346207Z","signature_b64":"wi09yJrSzNNxK66TksEJFM3H6n2+uZmjFbmrIHwyfXuEDYvLyT5IVCX/7orxLjMCFLCyigK4B9thIhN5C1mpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9cd1c99c7a4d67106b0fd88fc7c898f6093a2cf168ea031ba47b1f67f26417d","last_reissued_at":"2026-07-05T05:48:50.345758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:50.345758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with large minimum degree and no small odd cycles are $3$-colourable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domenico Mergoni Cecchelli, Jozef Skokan, Julia B\\\"ottcher, N\\'ora Frankl, Olaf Parczyk","submitted_at":"2023-02-03T17:24:54Z","abstract_excerpt":"Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$-vertex graph $G$ with minimum degree at least $\\frac{1}{2k-1}n$ and without odd cycles of length less than $2k+1$ is $3$-colourable. In fact, we prove a stronger result that works with a slightly smaller minimum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.01875","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.01875/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2302.01875","created_at":"2026-07-05T05:48:50.345815+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.01875v2","created_at":"2026-07-05T05:48:50.345815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.01875","created_at":"2026-07-05T05:48:50.345815+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHGRZGOHUTLH","created_at":"2026-07-05T05:48:50.345815+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHGRZGOHUTLHCBVQ","created_at":"2026-07-05T05:48:50.345815+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHGRZGOH","created_at":"2026-07-05T05:48:50.345815+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09394","citing_title":"On the chromatic profile for tripartite graphs and beyond","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09394","citing_title":"On the chromatic profile for tripartite graphs and beyond","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5","json":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5.json","graph_json":"https://pith.science/api/pith-number/VHGRZGOHUTLHCBVQ7WEPY7EJR5/graph.json","events_json":"https://pith.science/api/pith-number/VHGRZGOHUTLHCBVQ7WEPY7EJR5/events.json","paper":"https://pith.science/paper/VHGRZGOH"},"agent_actions":{"view_html":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5","download_json":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5.json","view_paper":"https://pith.science/paper/VHGRZGOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.01875&json=true","fetch_graph":"https://pith.science/api/pith-number/VHGRZGOHUTLHCBVQ7WEPY7EJR5/graph.json","fetch_events":"https://pith.science/api/pith-number/VHGRZGOHUTLHCBVQ7WEPY7EJR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/action/storage_attestation","attest_author":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/action/author_attestation","sign_citation":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/action/citation_signature","submit_replication":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/action/replication_record"}},"created_at":"2026-07-05T05:48:50.345815+00:00","updated_at":"2026-07-05T05:48:50.345815+00:00"}