{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZQH5DT6UFO2AZDBIXD6XAFNUHR","short_pith_number":"pith:ZQH5DT6U","schema_version":"1.0","canonical_sha256":"cc0fd1cfd42bb40c8c28b8fd7015b43c451c652c45ae2f5ce94fbde769bac348","source":{"kind":"arxiv","id":"1811.02940","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.02940","created_at":"2026-05-18T00:01:20.335322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02940v1","created_at":"2026-05-18T00:01:20.335322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02940","created_at":"2026-05-18T00:01:20.335322+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQH5DT6UFO2A","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQH5DT6UFO2AZDBI","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQH5DT6U","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR","json":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR.json","graph_json":"https://pith.science/api/pith-number/ZQH5DT6UFO2AZDBIXD6XAFNUHR/graph.json","events_json":"https://pith.science/api/pith-number/ZQH5DT6UFO2AZDBIXD6XAFNUHR/events.json","paper":"https://pith.science/paper/ZQH5DT6U"},"agent_actions":{"view_html":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR","download_json":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR.json","view_paper":"https://pith.science/paper/ZQH5DT6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02940&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQH5DT6UFO2AZDBIXD6XAFNUHR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQH5DT6UFO2AZDBIXD6XAFNUHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/action/storage_attestation","attest_author":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/action/author_attestation","sign_citation":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/action/citation_signature","submit_replication":"https://pith.science/pith/ZQH5DT6UFO2AZDBIXD6XAFNUHR/action/replication_record"}},"created_at":"2026-05-18T00:01:20.335322+00:00","updated_at":"2026-05-18T00:01:20.335322+00:00"}