{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VCF473SJKGAYTNGDI72UGE4CLP","short_pith_number":"pith:VCF473SJ","schema_version":"1.0","canonical_sha256":"a88bcfee49518189b4c347f54313825be1865b47637e3ad2769f4903eb45f823","source":{"kind":"arxiv","id":"1608.06989","version":1},"attestation_state":"computed","paper":{"title":"A better lower bound on average degree of k-list-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2016-08-24T23:57:09Z","abstract_excerpt":"We improve the best known bounds on average degree of $k$-list-critical graphs for $k \\ge 6$. Specifically, for $k \\ge 7$ we show that every non-complete $k$-list-critical graph has average degree at least $k-1 + \\frac{(k-3)^2 (2 k-3)}{k^4-2 k^3-11 k^2+28 k-14}$ and every non-complete $6$-list-critical graph has average degree at least $5 + \\frac{93}{766}$. The same bounds hold for online $k$-list-critical graphs."},"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":"1608.06989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T23:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"98d810bdef9e40b6d01baa63873f04c79272d4c6c98241da529aae3dbf1166ec","abstract_canon_sha256":"2aa064af05d5fe4ad3bfa96f4776838d4b2690b6e2384c2d8b945ca038b3c12c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:56.338989Z","signature_b64":"BdxtSqNQh2+uD9D+C3JvXFvTtNOeV3lJGXwnSh/RcaY8e7rQiIs+BNwiGfp40kI6/IE8HeIzkD/7NajVm8XgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a88bcfee49518189b4c347f54313825be1865b47637e3ad2769f4903eb45f823","last_reissued_at":"2026-05-18T01:07:56.338495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:56.338495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A better lower bound on average degree of k-list-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2016-08-24T23:57:09Z","abstract_excerpt":"We improve the best known bounds on average degree of $k$-list-critical graphs for $k \\ge 6$. Specifically, for $k \\ge 7$ we show that every non-complete $k$-list-critical graph has average degree at least $k-1 + \\frac{(k-3)^2 (2 k-3)}{k^4-2 k^3-11 k^2+28 k-14}$ and every non-complete $6$-list-critical graph has average degree at least $5 + \\frac{93}{766}$. The same bounds hold for online $k$-list-critical graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06989","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":"1608.06989","created_at":"2026-05-18T01:07:56.338572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06989v1","created_at":"2026-05-18T01:07:56.338572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06989","created_at":"2026-05-18T01:07:56.338572+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCF473SJKGAY","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCF473SJKGAYTNGD","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCF473SJ","created_at":"2026-05-18T12:30:48.956258+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/VCF473SJKGAYTNGDI72UGE4CLP","json":"https://pith.science/pith/VCF473SJKGAYTNGDI72UGE4CLP.json","graph_json":"https://pith.science/api/pith-number/VCF473SJKGAYTNGDI72UGE4CLP/graph.json","events_json":"https://pith.science/api/pith-number/VCF473SJKGAYTNGDI72UGE4CLP/events.json","paper":"https://pith.science/paper/VCF473SJ"},"agent_actions":{"view_html":"https://pith.science/pith/VCF473SJKGAYTNGDI72UGE4CLP","download_json":"https://pith.science/pith/VCF473SJKGAYTNGDI72UGE4CLP.json","view_paper":"https://pith.science/paper/VCF473SJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06989&json=true","fetch_graph":"https://pith.science/api/pith-number/VCF473SJKGAYTNGDI72UGE4CLP/graph.json","fetch_events":"https://pith.science/api/pith-number/VCF473SJKGAYTNGDI72UGE4CLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCF473SJKGAYTNGDI72UGE4CLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCF473SJKGAYTNGDI72UGE4CLP/action/storage_attestation","attest_author":"https://pith.science/pith/VCF473SJKGAYTNGDI72UGE4CLP/action/author_attestation","sign_citation":"https://pith.science/pith/VCF473SJKGAYTNGDI72UGE4CLP/action/citation_signature","submit_replication":"https://pith.science/pith/VCF473SJKGAYTNGDI72UGE4CLP/action/replication_record"}},"created_at":"2026-05-18T01:07:56.338572+00:00","updated_at":"2026-05-18T01:07:56.338572+00:00"}