{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YQRD6N2KKG3PMWV3KGOCHMYQN7","short_pith_number":"pith:YQRD6N2K","canonical_record":{"source":{"id":"1209.1173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T04:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"9b205df937c17f0b3ee2e9d167247d32201245056df731e89526e14b04cd3f8c","abstract_canon_sha256":"3644a184353d80e33c7f77cd1f88464514ad85255ef5fb01c16f8248e220a8d2"},"schema_version":"1.0"},"canonical_sha256":"c4223f374a51b6f65abb519c23b3106fdd0c97bd086db15f4749da322b30ad73","source":{"kind":"arxiv","id":"1209.1173","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1173","created_at":"2026-05-18T03:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1173v1","created_at":"2026-05-18T03:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1173","created_at":"2026-05-18T03:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"YQRD6N2KKG3P","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YQRD6N2KKG3PMWV3","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YQRD6N2K","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YQRD6N2KKG3PMWV3KGOCHMYQN7","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T04:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"9b205df937c17f0b3ee2e9d167247d32201245056df731e89526e14b04cd3f8c","abstract_canon_sha256":"3644a184353d80e33c7f77cd1f88464514ad85255ef5fb01c16f8248e220a8d2"},"schema_version":"1.0"},"canonical_sha256":"c4223f374a51b6f65abb519c23b3106fdd0c97bd086db15f4749da322b30ad73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:06.351553Z","signature_b64":"5hiJJUaQKz9fj0nKYaTL1AJhKWQ0nKWnujUF+KqKH6ixLD4VzJJKzE5tx/twFp41nPBxc2575FxUl+TRDaIRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4223f374a51b6f65abb519c23b3106fdd0c97bd086db15f4749da322b30ad73","last_reissued_at":"2026-05-18T03:46:06.350857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:06.350857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1173","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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpH9DcvceBCfIPlI5hat7umOgaEokl303iGzKL9JG7ari4VHBnRfZJ13Y3Za9mG4I7PAl6QqqLX8WFnxQOFBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:24:27.168515Z"},"content_sha256":"c1ab9768f4571736b02c0c95fd5fc60f6c9bb48e60fd5823e2d24b6387cbdf18","schema_version":"1.0","event_id":"sha256:c1ab9768f4571736b02c0c95fd5fc60f6c9bb48e60fd5823e2d24b6387cbdf18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YQRD6N2KKG3PMWV3KGOCHMYQN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ore's Conjecture for $k=4$ and Gr\\\" otzsch Theorem","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-06T04:14:38Z","abstract_excerpt":"A graph $G$ is $k$-{\\em 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. In a very recent paper, we gave 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$. In this note, we present a simple proof of the bound for $k=4$. It implies the case $k=4$ of the conjecture by Ore from 1967 that for every $k\\geq 4$ and $n\\geq k+2$, $f_k(n+k-1)=f(n)+\\frac{k-1}{2}(k - \\frac{2}{k-1})$. We also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1173","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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44YyJ2o9tloVq/kwj28yTVi/roOG/b/cUD05APo0Aa6vhqIhaHpob6mEPxlhb+Ewfla5wPwi8SHq12y2YRW7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:24:27.168858Z"},"content_sha256":"b2905c22d30150aabcc65296cfb8653695e1cdc68bd46a7adfb87db348e9d108","schema_version":"1.0","event_id":"sha256:b2905c22d30150aabcc65296cfb8653695e1cdc68bd46a7adfb87db348e9d108"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQRD6N2KKG3PMWV3KGOCHMYQN7/bundle.json","state_url":"https://pith.science/pith/YQRD6N2KKG3PMWV3KGOCHMYQN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQRD6N2KKG3PMWV3KGOCHMYQN7/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-06-08T22:24:27Z","links":{"resolver":"https://pith.science/pith/YQRD6N2KKG3PMWV3KGOCHMYQN7","bundle":"https://pith.science/pith/YQRD6N2KKG3PMWV3KGOCHMYQN7/bundle.json","state":"https://pith.science/pith/YQRD6N2KKG3PMWV3KGOCHMYQN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQRD6N2KKG3PMWV3KGOCHMYQN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YQRD6N2KKG3PMWV3KGOCHMYQN7","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":"3644a184353d80e33c7f77cd1f88464514ad85255ef5fb01c16f8248e220a8d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T04:14:38Z","title_canon_sha256":"9b205df937c17f0b3ee2e9d167247d32201245056df731e89526e14b04cd3f8c"},"schema_version":"1.0","source":{"id":"1209.1173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1173","created_at":"2026-05-18T03:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1173v1","created_at":"2026-05-18T03:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1173","created_at":"2026-05-18T03:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"YQRD6N2KKG3P","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YQRD6N2KKG3PMWV3","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YQRD6N2K","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:b2905c22d30150aabcc65296cfb8653695e1cdc68bd46a7adfb87db348e9d108","target":"graph","created_at":"2026-05-18T03:46:06Z","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$-{\\em 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. In a very recent paper, we gave 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$. In this note, we present a simple proof of the bound for $k=4$. It implies the case $k=4$ of the conjecture by Ore from 1967 that for every $k\\geq 4$ and $n\\geq k+2$, $f_k(n+k-1)=f(n)+\\frac{k-1}{2}(k - \\frac{2}{k-1})$. We also","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-06T04:14:38Z","title":"Ore's Conjecture for $k=4$ and Gr\\\" otzsch Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1173","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:c1ab9768f4571736b02c0c95fd5fc60f6c9bb48e60fd5823e2d24b6387cbdf18","target":"record","created_at":"2026-05-18T03:46:06Z","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":"3644a184353d80e33c7f77cd1f88464514ad85255ef5fb01c16f8248e220a8d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T04:14:38Z","title_canon_sha256":"9b205df937c17f0b3ee2e9d167247d32201245056df731e89526e14b04cd3f8c"},"schema_version":"1.0","source":{"id":"1209.1173","kind":"arxiv","version":1}},"canonical_sha256":"c4223f374a51b6f65abb519c23b3106fdd0c97bd086db15f4749da322b30ad73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4223f374a51b6f65abb519c23b3106fdd0c97bd086db15f4749da322b30ad73","first_computed_at":"2026-05-18T03:46:06.350857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:06.350857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5hiJJUaQKz9fj0nKYaTL1AJhKWQ0nKWnujUF+KqKH6ixLD4VzJJKzE5tx/twFp41nPBxc2575FxUl+TRDaIRBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:06.351553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1ab9768f4571736b02c0c95fd5fc60f6c9bb48e60fd5823e2d24b6387cbdf18","sha256:b2905c22d30150aabcc65296cfb8653695e1cdc68bd46a7adfb87db348e9d108"],"state_sha256":"cc3897c8afd71360b4cd8a14287b9f83ebaf2d4c1331f40db9500e4c3cf40b2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oL7SuPHQ63eX1h3+0og3ULh8KAUJRhrhTBsqsbsgM9SS1lD6hbCGp7WtqJFOvgLZRFIzLdN4a34it44UyIulBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:24:27.170787Z","bundle_sha256":"0f05cdf538a12f2a615952110472fe2d99d5198c1bb08b6b52b468be097a6fdf"}}