{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VVIWPGBPYZOTAWI3BK76WUIO4X","short_pith_number":"pith:VVIWPGBP","schema_version":"1.0","canonical_sha256":"ad5167982fc65d30591b0abfeb510ee5c8078032e560d68f1a0df348080fe745","source":{"kind":"arxiv","id":"1209.1050","version":1},"attestation_state":"computed","paper":{"title":"Ore's Conjecture on color-critical graphs is almost true","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Matthew Yancey","submitted_at":"2012-09-05T17:26:24Z","abstract_excerpt":"A graph $G$ is $k$-critical if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. We give a lower bound, $f_k(n) \\geq F(k,n)$, that is sharp for every $n=1 ({\\rm mod} k-1)$. It is also sharp for $k=4$ and every $n\\geq 6$. The result improves the classical bounds by Gallai and Dirac and subsequent bounds by Krivelevich and Kostochka and Stiebitz. It establishes the asymptotics of $f_k(n)$ for every fixed $k$. It also proves that the conjecture by Ore from 1967 that for every $k"},"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":"1209.1050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-05T17:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"b8bb6a0381c08924c91d24ce0797ea0e89d4bea7b48bc9cb2245e4650b874f98","abstract_canon_sha256":"26fb03acdc0c20693b4a871157c0e94e4b1960a5eabcfe813a105fe5cdf37d9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:15.604035Z","signature_b64":"GoyhdWMLc1G0KtOY6V1EBW9O+pDmQv07DRXlP0bve34Fl4n15iUbF5N8cRyn+MbmHyEYevcidHSCj0muBrepAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad5167982fc65d30591b0abfeb510ee5c8078032e560d68f1a0df348080fe745","last_reissued_at":"2026-05-18T03:46:15.603158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:15.603158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ore's Conjecture on color-critical graphs is almost true","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Matthew Yancey","submitted_at":"2012-09-05T17:26:24Z","abstract_excerpt":"A graph $G$ is $k$-critical if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. We give a lower bound, $f_k(n) \\geq F(k,n)$, that is sharp for every $n=1 ({\\rm mod} k-1)$. It is also sharp for $k=4$ and every $n\\geq 6$. The result improves the classical bounds by Gallai and Dirac and subsequent bounds by Krivelevich and Kostochka and Stiebitz. It establishes the asymptotics of $f_k(n)$ for every fixed $k$. It also proves that the conjecture by Ore from 1967 that for every $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1050","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.1050","created_at":"2026-05-18T03:46:15.603341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.1050v1","created_at":"2026-05-18T03:46:15.603341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1050","created_at":"2026-05-18T03:46:15.603341+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVIWPGBPYZOT","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVIWPGBPYZOTAWI3","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVIWPGBP","created_at":"2026-05-18T12:27:25.539911+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/VVIWPGBPYZOTAWI3BK76WUIO4X","json":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X.json","graph_json":"https://pith.science/api/pith-number/VVIWPGBPYZOTAWI3BK76WUIO4X/graph.json","events_json":"https://pith.science/api/pith-number/VVIWPGBPYZOTAWI3BK76WUIO4X/events.json","paper":"https://pith.science/paper/VVIWPGBP"},"agent_actions":{"view_html":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X","download_json":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X.json","view_paper":"https://pith.science/paper/VVIWPGBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.1050&json=true","fetch_graph":"https://pith.science/api/pith-number/VVIWPGBPYZOTAWI3BK76WUIO4X/graph.json","fetch_events":"https://pith.science/api/pith-number/VVIWPGBPYZOTAWI3BK76WUIO4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/action/storage_attestation","attest_author":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/action/author_attestation","sign_citation":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/action/citation_signature","submit_replication":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/action/replication_record"}},"created_at":"2026-05-18T03:46:15.603341+00:00","updated_at":"2026-05-18T03:46:15.603341+00:00"}