{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VVIWPGBPYZOTAWI3BK76WUIO4X","short_pith_number":"pith:VVIWPGBP","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"},"canonical_sha256":"ad5167982fc65d30591b0abfeb510ee5c8078032e560d68f1a0df348080fe745","source":{"kind":"arxiv","id":"1209.1050","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VVIWPGBPYZOTAWI3BK76WUIO4X","target":"record","payload":{"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"},"canonical_sha256":"ad5167982fc65d30591b0abfeb510ee5c8078032e560d68f1a0df348080fe745","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"},"source_kind":"arxiv","source_id":"1209.1050","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4plhGcowMpH5sJgrb8BHXVy96qtYGo3nMf0e/guoz/+ScQbUJm4qvom6TTukOv0hDS4Jh5R79+J4xZpHNKdFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:44:40.997335Z"},"content_sha256":"a573847bbacc804bb575c0d8342e62350676de9b326c47c536986e385768285f","schema_version":"1.0","event_id":"sha256:a573847bbacc804bb575c0d8342e62350676de9b326c47c536986e385768285f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VVIWPGBPYZOTAWI3BK76WUIO4X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuS5a8Vp1QeLMHVcYsPhM657VFpkYWFSd5cHH5iRxhfoUKrW1MaGLg93DV53aPlAiVbvg27r5lyi0xekPfpbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:44:40.997699Z"},"content_sha256":"49a5e6ee0c0dd6b76eabbb2fc0351e6c97cbc6ea69e2d4c1a9dff9e6c04072ff","schema_version":"1.0","event_id":"sha256:49a5e6ee0c0dd6b76eabbb2fc0351e6c97cbc6ea69e2d4c1a9dff9e6c04072ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/bundle.json","state_url":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T08:44:40Z","links":{"resolver":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X","bundle":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/bundle.json","state":"https://pith.science/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVIWPGBPYZOTAWI3BK76WUIO4X/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fHOwx40HtyJE34VraDcbsW9LpNQ7DdteHGmaY4xnCSqHxI7ifQTdMhp9mug7OWB3i2JdYcmnWw/S9YnKk5rAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:44:40.999783Z","bundle_sha256":"5294c34f9398a5ef23a7b19127f6a3ebe26b2188a354ff1efc2c65211c338426"}}