{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VVIWPGBPYZOTAWI3BK76WUIO4X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"26fb03acdc0c20693b4a871157c0e94e4b1960a5eabcfe813a105fe5cdf37d9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-05T17:26:24Z","title_canon_sha256":"b8bb6a0381c08924c91d24ce0797ea0e89d4bea7b48bc9cb2245e4650b874f98"},"schema_version":"1.0","source":{"id":"1209.1050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1050","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1050v1","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1050","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"VVIWPGBPYZOT","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VVIWPGBPYZOTAWI3","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VVIWPGBP","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:49a5e6ee0c0dd6b76eabbb2fc0351e6c97cbc6ea69e2d4c1a9dff9e6c04072ff","target":"graph","created_at":"2026-05-18T03:46:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexandr Kostochka, Matthew Yancey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-05T17:26:24Z","title":"Ore's Conjecture on color-critical graphs is almost true"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1050","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a573847bbacc804bb575c0d8342e62350676de9b326c47c536986e385768285f","target":"record","created_at":"2026-05-18T03:46:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"26fb03acdc0c20693b4a871157c0e94e4b1960a5eabcfe813a105fe5cdf37d9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-05T17:26:24Z","title_canon_sha256":"b8bb6a0381c08924c91d24ce0797ea0e89d4bea7b48bc9cb2245e4650b874f98"},"schema_version":"1.0","source":{"id":"1209.1050","kind":"arxiv","version":1}},"canonical_sha256":"ad5167982fc65d30591b0abfeb510ee5c8078032e560d68f1a0df348080fe745","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad5167982fc65d30591b0abfeb510ee5c8078032e560d68f1a0df348080fe745","first_computed_at":"2026-05-18T03:46:15.603158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:15.603158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GoyhdWMLc1G0KtOY6V1EBW9O+pDmQv07DRXlP0bve34Fl4n15iUbF5N8cRyn+MbmHyEYevcidHSCj0muBrepAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:15.604035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a573847bbacc804bb575c0d8342e62350676de9b326c47c536986e385768285f","sha256:49a5e6ee0c0dd6b76eabbb2fc0351e6c97cbc6ea69e2d4c1a9dff9e6c04072ff"],"state_sha256":"e91e2c5db6b4c49b83de3a8168b4caed7c3f7cd309a2bc1181ac87229eb5154a"}