{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZQH5DT6UFO2AZDBIXD6XAFNUHR","short_pith_number":"pith:ZQH5DT6U","canonical_record":{"source":{"id":"1811.02940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:38:24Z","cross_cats_sorted":[],"title_canon_sha256":"d9afbc346ddceda4a40f5b7dc9ec4d407d75dfd7c5335bc6341df57e8d8f0cfa","abstract_canon_sha256":"e3e0f9bf2d101314c4cb49182fcdfcb3f696dd393ebd18817aa8e8197d7603cb"},"schema_version":"1.0"},"canonical_sha256":"cc0fd1cfd42bb40c8c28b8fd7015b43c451c652c45ae2f5ce94fbde769bac348","source":{"kind":"arxiv","id":"1811.02940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02940","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02940v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02940","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZQH5DT6UFO2A","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZQH5DT6UFO2AZDBI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZQH5DT6U","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZQH5DT6UFO2AZDBIXD6XAFNUHR","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:38:24Z","cross_cats_sorted":[],"title_canon_sha256":"d9afbc346ddceda4a40f5b7dc9ec4d407d75dfd7c5335bc6341df57e8d8f0cfa","abstract_canon_sha256":"e3e0f9bf2d101314c4cb49182fcdfcb3f696dd393ebd18817aa8e8197d7603cb"},"schema_version":"1.0"},"canonical_sha256":"cc0fd1cfd42bb40c8c28b8fd7015b43c451c652c45ae2f5ce94fbde769bac348","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.335825Z","signature_b64":"VSg9V6+m8AHluB0EPFQX6RLtrJllTyr7nRIlNdReyqsbNRg+N64liOXf1qTD1DZ2nErGdCMxnYP2tukncpbvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc0fd1cfd42bb40c8c28b8fd7015b43c451c652c45ae2f5ce94fbde769bac348","last_reissued_at":"2026-05-18T00:01:20.335227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.335227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02940","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lFGTp+GzgJQmDndGoKBJ94gJa8X/Tw+iqZbwUmisgU7JjHETlYoas+tlURVl/o+F63FArvgIdFHoFufNeKFwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:49:07.538986Z"},"content_sha256":"460f873df8fc87548930a8545d13c4b7b0016539ca0e8ff02e1d061eb0a0f047","schema_version":"1.0","event_id":"sha256:460f873df8fc87548930a8545d13c4b7b0016539ca0e8ff02e1d061eb0a0f047"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZQH5DT6UFO2AZDBIXD6XAFNUHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Minimal Edge Density of $K_4$-free 6-critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Wenbo Gao","submitted_at":"2018-11-07T15:38:24Z","abstract_excerpt":"Kostochka and Yancey resolved a famous conjecture of Ore on the asymptotic density of $k$-critical graphs by proving that every $k$-critical graph $G$ satisfies $|E(G)| \\geq (\\frac{k}{2} - \\frac{1}{k-1})|V(G)| - \\frac{k(k-3)}{2(k-1)}$. The class of graphs for which this bound is tight, $k$-Ore graphs, contain a notably large number of $K_{k-2}$-subgraphs. Subsequent work attempted to determine the asymptotic density for $k$-critical graphs that do \\emph{not} contain large cliques as subgraphs, but only partial progress has been made on this problem. The second author showed that if $G$ is 5-cr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02940","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioMckN32sOirVG8QpzQ1pzGtsXBl9E+hny//Z5dOrxKvI+w0o8eXR19Gd4bE8LOqLQIhNaSoEHzzspZmrm8xCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:49:07.540018Z"},"content_sha256":"2153d120ede435343ea94872f1fa67410a6ef672c05a7bde7a521aab7933b3cd","schema_version":"1.0","event_id":"sha256:2153d120ede435343ea94872f1fa67410a6ef672c05a7bde7a521aab7933b3cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/bundle.json","state_url":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/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-30T13:49:07Z","links":{"resolver":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR","bundle":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/bundle.json","state":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZQH5DT6UFO2AZDBIXD6XAFNUHR","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":"e3e0f9bf2d101314c4cb49182fcdfcb3f696dd393ebd18817aa8e8197d7603cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:38:24Z","title_canon_sha256":"d9afbc346ddceda4a40f5b7dc9ec4d407d75dfd7c5335bc6341df57e8d8f0cfa"},"schema_version":"1.0","source":{"id":"1811.02940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02940","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02940v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02940","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZQH5DT6UFO2A","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZQH5DT6UFO2AZDBI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZQH5DT6U","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:2153d120ede435343ea94872f1fa67410a6ef672c05a7bde7a521aab7933b3cd","target":"graph","created_at":"2026-05-18T00:01:20Z","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":"Kostochka and Yancey resolved a famous conjecture of Ore on the asymptotic density of $k$-critical graphs by proving that every $k$-critical graph $G$ satisfies $|E(G)| \\geq (\\frac{k}{2} - \\frac{1}{k-1})|V(G)| - \\frac{k(k-3)}{2(k-1)}$. The class of graphs for which this bound is tight, $k$-Ore graphs, contain a notably large number of $K_{k-2}$-subgraphs. Subsequent work attempted to determine the asymptotic density for $k$-critical graphs that do \\emph{not} contain large cliques as subgraphs, but only partial progress has been made on this problem. The second author showed that if $G$ is 5-cr","authors_text":"Luke Postle, Wenbo Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:38:24Z","title":"On the Minimal Edge Density of $K_4$-free 6-critical Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02940","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:460f873df8fc87548930a8545d13c4b7b0016539ca0e8ff02e1d061eb0a0f047","target":"record","created_at":"2026-05-18T00:01:20Z","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":"e3e0f9bf2d101314c4cb49182fcdfcb3f696dd393ebd18817aa8e8197d7603cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:38:24Z","title_canon_sha256":"d9afbc346ddceda4a40f5b7dc9ec4d407d75dfd7c5335bc6341df57e8d8f0cfa"},"schema_version":"1.0","source":{"id":"1811.02940","kind":"arxiv","version":1}},"canonical_sha256":"cc0fd1cfd42bb40c8c28b8fd7015b43c451c652c45ae2f5ce94fbde769bac348","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc0fd1cfd42bb40c8c28b8fd7015b43c451c652c45ae2f5ce94fbde769bac348","first_computed_at":"2026-05-18T00:01:20.335227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.335227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VSg9V6+m8AHluB0EPFQX6RLtrJllTyr7nRIlNdReyqsbNRg+N64liOXf1qTD1DZ2nErGdCMxnYP2tukncpbvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.335825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:460f873df8fc87548930a8545d13c4b7b0016539ca0e8ff02e1d061eb0a0f047","sha256:2153d120ede435343ea94872f1fa67410a6ef672c05a7bde7a521aab7933b3cd"],"state_sha256":"1f849bc6a7d85e8f2ac73d1bb29f50f730b20a51aeb5f652ec7494d8e3d65b4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+i0biOwZKof7L+DtRwkTLRN+db14hiPld01LNA9v+Jz/1s+Tp8zvXS5au1IA52i0lCcLzCs6JZcBIkAi+qgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:49:07.543834Z","bundle_sha256":"1d0f6db24163a5befe87f11395eba17374c76ecc6f01dad0d1157f86919cbede"}}