{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2KW3SLC4MUE6DWWW3WKJZL774H","short_pith_number":"pith:2KW3SLC4","schema_version":"1.0","canonical_sha256":"d2adb92c5c6509e1dad6dd949cafffe1d13ceea86c75d79f79e5cd7d58bd32af","source":{"kind":"arxiv","id":"1512.03787","version":1},"attestation_state":"computed","paper":{"title":"(4,2)-choosability of planar graphs with forbidden structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Christopher Cox, Derrick Stolee, Kacy Messerschmidt, Kathleen Nowak, Kevin F. Palmowski, Kevin Moss, Kirsten Hogenson, Michael Dairyko, Mohit Kumbhat, Zhanar Berikkyzy","submitted_at":"2015-12-11T20:16:17Z","abstract_excerpt":"All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention. In terms of constraining the structure of the graph, for any $\\ell \\in \\{3,4,5,6,7\\}$, a planar graph is 4-choosable if it is $\\ell$-cycle-free. In terms of constraining the list assignment, one refinement of $k$-choosability is choosability with separation. A graph is $(k,s)$-choosable if the graph is colorable from lists of size $k$ where adjacent vertices have at"},"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":"1512.03787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-11T20:16:17Z","cross_cats_sorted":[],"title_canon_sha256":"a01812dfed298d1a838da44159bbb797385cf05bf1acbdaa901ee611a95241b1","abstract_canon_sha256":"c6e7694f6d54d2ded6606b35d88fa40515ea5a6124e0aa8caa1506e621eabfad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:41.589096Z","signature_b64":"NQdLLokUcEuKUu09w2lzOHVNmD2uXUa8UB9WJseeVtIYcqyXAtccBz1UI9sADgGCa/Qy9YRJUZwPm8yeGf50AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2adb92c5c6509e1dad6dd949cafffe1d13ceea86c75d79f79e5cd7d58bd32af","last_reissued_at":"2026-05-18T00:40:41.588377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:41.588377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(4,2)-choosability of planar graphs with forbidden structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Christopher Cox, Derrick Stolee, Kacy Messerschmidt, Kathleen Nowak, Kevin F. Palmowski, Kevin Moss, Kirsten Hogenson, Michael Dairyko, Mohit Kumbhat, Zhanar Berikkyzy","submitted_at":"2015-12-11T20:16:17Z","abstract_excerpt":"All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention. In terms of constraining the structure of the graph, for any $\\ell \\in \\{3,4,5,6,7\\}$, a planar graph is 4-choosable if it is $\\ell$-cycle-free. In terms of constraining the list assignment, one refinement of $k$-choosability is choosability with separation. A graph is $(k,s)$-choosable if the graph is colorable from lists of size $k$ where adjacent vertices have at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03787","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":"1512.03787","created_at":"2026-05-18T00:40:41.588491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03787v1","created_at":"2026-05-18T00:40:41.588491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03787","created_at":"2026-05-18T00:40:41.588491+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KW3SLC4MUE6","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KW3SLC4MUE6DWWW","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KW3SLC4","created_at":"2026-05-18T12:29:02.477457+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/2KW3SLC4MUE6DWWW3WKJZL774H","json":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H.json","graph_json":"https://pith.science/api/pith-number/2KW3SLC4MUE6DWWW3WKJZL774H/graph.json","events_json":"https://pith.science/api/pith-number/2KW3SLC4MUE6DWWW3WKJZL774H/events.json","paper":"https://pith.science/paper/2KW3SLC4"},"agent_actions":{"view_html":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H","download_json":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H.json","view_paper":"https://pith.science/paper/2KW3SLC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03787&json=true","fetch_graph":"https://pith.science/api/pith-number/2KW3SLC4MUE6DWWW3WKJZL774H/graph.json","fetch_events":"https://pith.science/api/pith-number/2KW3SLC4MUE6DWWW3WKJZL774H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/action/storage_attestation","attest_author":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/action/author_attestation","sign_citation":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/action/citation_signature","submit_replication":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/action/replication_record"}},"created_at":"2026-05-18T00:40:41.588491+00:00","updated_at":"2026-05-18T00:40:41.588491+00:00"}