{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QFEVOLWAINQBSTXMV4STTLPGUJ","short_pith_number":"pith:QFEVOLWA","canonical_record":{"source":{"id":"1408.0846","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-05T01:12:33Z","cross_cats_sorted":[],"title_canon_sha256":"0ae42fda998a487c77f1b48e3c49acb049556cc6ab05edaf554e60781c79f59d","abstract_canon_sha256":"08786b2be273950be6f7992bb80e4f1d882d3a35ded92099913c48f7814150ce"},"schema_version":"1.0"},"canonical_sha256":"8149572ec04360194eecaf2539ade6a262d3ab0a78c17dcdb6e4f3ae901a2111","source":{"kind":"arxiv","id":"1408.0846","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0846","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0846v3","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0846","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"QFEVOLWAINQB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QFEVOLWAINQBSTXM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QFEVOLWA","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QFEVOLWAINQBSTXMV4STTLPGUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0846","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-05T01:12:33Z","cross_cats_sorted":[],"title_canon_sha256":"0ae42fda998a487c77f1b48e3c49acb049556cc6ab05edaf554e60781c79f59d","abstract_canon_sha256":"08786b2be273950be6f7992bb80e4f1d882d3a35ded92099913c48f7814150ce"},"schema_version":"1.0"},"canonical_sha256":"8149572ec04360194eecaf2539ade6a262d3ab0a78c17dcdb6e4f3ae901a2111","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:21.397903Z","signature_b64":"/AyqVgqOLzqNp6Y1w2xiv8ewc/GpYEfAjKXB/WOZq//j5QbOncHoub8UPItfM+J8gBSIRGX7+rZIYJmBjj/1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8149572ec04360194eecaf2539ade6a262d3ab0a78c17dcdb6e4f3ae901a2111","last_reissued_at":"2026-05-18T00:47:21.397230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:21.397230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0846","source_version":3,"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-18T00:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zm17b0V2vkUrHpUCy4DghGHLB6e6geQt+6wFiW3+/0zwTKKGVkRqsxojzOMQB6jFnKTFGhe/a11AyvsDTJjQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:21:05.530726Z"},"content_sha256":"d16094db6bc2ab4218f969b2a753c6c0850f705b61d63eaf04e221fd81089587","schema_version":"1.0","event_id":"sha256:d16094db6bc2ab4218f969b2a753c6c0850f705b61d63eaf04e221fd81089587"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QFEVOLWAINQBSTXMV4STTLPGUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Brooks-type result for sparse critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Matthew Yancey","submitted_at":"2014-08-05T01:12:33Z","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. Recently the authors gave a lower bound, $f_k(n) \\geq \\left\\lceil \\frac{(k+1)(k-2)|V(G)|-k(k-3)}{2(k-1)}\\right\\rceil$, that solves a conjecture by Gallai from 1963 and is sharp for every $n\\equiv 1\\,({\\rm mod }\\, k-1)$. It is also sharp for $k=4$ and every $n\\geq 6$. In this paper we refine the result by describing all $n$-vertex $k$-critical graphs $G$ with $|E(G)|= \\frac{(k+1)(k-2)|V(G)|-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0846","kind":"arxiv","version":3},"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-18T00:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imvrXnL5tsTsKvH761LCNBrg+JgcH1AfyX4Dm2HHi7UrOtx5aK95cbHCXWMcY9aiHYHa/rGXNuy9H6UI8xlBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:21:05.531071Z"},"content_sha256":"e8e48f3302260284c40f63a53565f3e768207c1b354cbdc420f16fa14311007d","schema_version":"1.0","event_id":"sha256:e8e48f3302260284c40f63a53565f3e768207c1b354cbdc420f16fa14311007d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFEVOLWAINQBSTXMV4STTLPGUJ/bundle.json","state_url":"https://pith.science/pith/QFEVOLWAINQBSTXMV4STTLPGUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFEVOLWAINQBSTXMV4STTLPGUJ/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-28T10:21:05Z","links":{"resolver":"https://pith.science/pith/QFEVOLWAINQBSTXMV4STTLPGUJ","bundle":"https://pith.science/pith/QFEVOLWAINQBSTXMV4STTLPGUJ/bundle.json","state":"https://pith.science/pith/QFEVOLWAINQBSTXMV4STTLPGUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFEVOLWAINQBSTXMV4STTLPGUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QFEVOLWAINQBSTXMV4STTLPGUJ","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":"08786b2be273950be6f7992bb80e4f1d882d3a35ded92099913c48f7814150ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-05T01:12:33Z","title_canon_sha256":"0ae42fda998a487c77f1b48e3c49acb049556cc6ab05edaf554e60781c79f59d"},"schema_version":"1.0","source":{"id":"1408.0846","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0846","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0846v3","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0846","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"QFEVOLWAINQB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QFEVOLWAINQBSTXM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QFEVOLWA","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:e8e48f3302260284c40f63a53565f3e768207c1b354cbdc420f16fa14311007d","target":"graph","created_at":"2026-05-18T00:47:21Z","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. Recently the authors gave a lower bound, $f_k(n) \\geq \\left\\lceil \\frac{(k+1)(k-2)|V(G)|-k(k-3)}{2(k-1)}\\right\\rceil$, that solves a conjecture by Gallai from 1963 and is sharp for every $n\\equiv 1\\,({\\rm mod }\\, k-1)$. It is also sharp for $k=4$ and every $n\\geq 6$. In this paper we refine the result by describing all $n$-vertex $k$-critical graphs $G$ with $|E(G)|= \\frac{(k+1)(k-2)|V(G)|-","authors_text":"Alexandr Kostochka, Matthew Yancey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-05T01:12:33Z","title":"A Brooks-type result for sparse critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0846","kind":"arxiv","version":3},"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:d16094db6bc2ab4218f969b2a753c6c0850f705b61d63eaf04e221fd81089587","target":"record","created_at":"2026-05-18T00:47:21Z","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":"08786b2be273950be6f7992bb80e4f1d882d3a35ded92099913c48f7814150ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-05T01:12:33Z","title_canon_sha256":"0ae42fda998a487c77f1b48e3c49acb049556cc6ab05edaf554e60781c79f59d"},"schema_version":"1.0","source":{"id":"1408.0846","kind":"arxiv","version":3}},"canonical_sha256":"8149572ec04360194eecaf2539ade6a262d3ab0a78c17dcdb6e4f3ae901a2111","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8149572ec04360194eecaf2539ade6a262d3ab0a78c17dcdb6e4f3ae901a2111","first_computed_at":"2026-05-18T00:47:21.397230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:21.397230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/AyqVgqOLzqNp6Y1w2xiv8ewc/GpYEfAjKXB/WOZq//j5QbOncHoub8UPItfM+J8gBSIRGX7+rZIYJmBjj/1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:21.397903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0846","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d16094db6bc2ab4218f969b2a753c6c0850f705b61d63eaf04e221fd81089587","sha256:e8e48f3302260284c40f63a53565f3e768207c1b354cbdc420f16fa14311007d"],"state_sha256":"1a29381de20be3464f0a63c318f5eec5b8d86dbdff5a26225a877dcd29bd9226"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCfFBMHp3nKjdKUrrEaSn4QssMU/ca5TiqfOJXxGOzhrpWmmBpnTj7C5WUy4GOtMe5zpBEIE2MVK743nn7JKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:21:05.533077Z","bundle_sha256":"40316245721cb20539000a091ef2fcb3198c0daf7b17f12c3853d02c91f78af9"}}