{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CZSQTABPI6DXKMBX2DNI7F2TT7","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":"efeed858d35b5ca43346d617e981e0920979618045441877e200f4f29798ee0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-28T04:44:58Z","title_canon_sha256":"2d2b63613e2374f20cf8588b0892d723b5552c2c1999890ea5deb845d783cb20"},"schema_version":"1.0","source":{"id":"1406.7355","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7355","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7355v2","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7355","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"CZSQTABPI6DX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CZSQTABPI6DXKMBX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CZSQTABP","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:310037868fce628a0ceacf6eedda71f28baa497d77e008e33fc7d0a97b095a70","target":"graph","created_at":"2026-05-18T01:23:45Z","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":"We prove that every $k$-list-critical graph ($k \\ge 7$) on $n \\ge k+2$ vertices has at least $\\frac12 \\left(k-1 + \\frac{k-3}{(k-c)(k-1) + k-3}\\right)n$ edges where $c = (k-3)\\left(\\frac12 - \\frac{1}{(k-1)(k-2)}\\right)$. This improves the bound established by Kostochka and Stiebitz. The same bound holds for online $k$-list-critical graphs, improving the bound established by Riasat and Schauz. Both bounds follow from a more general result stating that either a graph has many edges or it has an Alon-Tarsi orientable induced subgraph satisfying a certain degree condition.","authors_text":"Hal Kierstead, Landon Rabern","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-28T04:44:58Z","title":"Improved lower bounds on the number of edges in list critical and online list critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7355","kind":"arxiv","version":2},"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:fe037918390348667ca713e5ef56b7d0dd4cc89d6b5aad30bc187d1327183af3","target":"record","created_at":"2026-05-18T01:23:45Z","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":"efeed858d35b5ca43346d617e981e0920979618045441877e200f4f29798ee0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-28T04:44:58Z","title_canon_sha256":"2d2b63613e2374f20cf8588b0892d723b5552c2c1999890ea5deb845d783cb20"},"schema_version":"1.0","source":{"id":"1406.7355","kind":"arxiv","version":2}},"canonical_sha256":"166509802f4787753037d0da8f97539feaaf3a1af8aa132398886e2437d7b375","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"166509802f4787753037d0da8f97539feaaf3a1af8aa132398886e2437d7b375","first_computed_at":"2026-05-18T01:23:45.423822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:45.423822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZzdHhYS9SzY4GECtwiNfnPDf1J/GGoNAi5w2g/ec9rP1HcCiqpftMTRevKgosPvwMY3tOvu0UoZbg9dPTRGbBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:45.424475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7355","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe037918390348667ca713e5ef56b7d0dd4cc89d6b5aad30bc187d1327183af3","sha256:310037868fce628a0ceacf6eedda71f28baa497d77e008e33fc7d0a97b095a70"],"state_sha256":"372f9effe915d2b817fe0219b30dcd8b0c9280a9b1bcbcf29cfe6dce7ae31709"}