{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7RSAGGP74DM4EFIMLWIF2VDXV2","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":"5d275641f790bc64a71bb18f811b479d1f969e1e7f7a1972e6a168369f039bb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-27T20:25:15Z","title_canon_sha256":"aa6b9422730469c2de5bd76f9feab5a0f01e3890c03b4f833b4961da2c424c0e"},"schema_version":"1.0","source":{"id":"1404.6821","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6821","created_at":"2026-05-18T00:33:44Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6821v3","created_at":"2026-05-18T00:33:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6821","created_at":"2026-05-18T00:33:44Z"},{"alias_kind":"pith_short_12","alias_value":"7RSAGGP74DM4","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7RSAGGP74DM4EFIM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7RSAGGP7","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:0429335555f1ef2953b1128adeb76b9816923788fe1e30c2a1482d69550b3361","target":"graph","created_at":"2026-05-18T00:33:44Z","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":"A graph $G$ is called $(a,b)$-choosable if for any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $a$ permissible colours, there is a $b$-tuple $L$-colouring of $G$. An $(a,1)$-choosable graph is also called $a$-choosable. In the pioneering paper on list colouring of graphs by Erd\\H{o}s, Rubin and Taylor, $2$-choosable graphs are characterized. Confirming a special case of a conjecture of Erd\\H{o}s--Rubin--Taylor, Tuza and Voigt proved that $2$-choosable graphs are $(2m,m)$-choosable for any positive integer $m$. On the other hand, Voigt proved that if $m$ is an odd integ","authors_text":"Gregory J. Puleo, Jixian Meng, Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-27T20:25:15Z","title":"On (4,2)-Choosable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6821","kind":"arxiv","version":3},"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:bc619607f1b528e5356ccf8a417ef865845064b3d49ddad8bce5d3680108f287","target":"record","created_at":"2026-05-18T00:33:44Z","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":"5d275641f790bc64a71bb18f811b479d1f969e1e7f7a1972e6a168369f039bb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-27T20:25:15Z","title_canon_sha256":"aa6b9422730469c2de5bd76f9feab5a0f01e3890c03b4f833b4961da2c424c0e"},"schema_version":"1.0","source":{"id":"1404.6821","kind":"arxiv","version":3}},"canonical_sha256":"fc640319ffe0d9c2150c5d905d5477ae8ad8e6628bfa9313609b479660779b17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc640319ffe0d9c2150c5d905d5477ae8ad8e6628bfa9313609b479660779b17","first_computed_at":"2026-05-18T00:33:44.370330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:44.370330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c/Dcihrdul4eI7R3MJK0Yc565+emsc7PeFu9VImASsij0ZeKSTlt0R94RItRAaLH/7Eco9KPUkL9PKNABuDeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:44.370947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6821","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc619607f1b528e5356ccf8a417ef865845064b3d49ddad8bce5d3680108f287","sha256:0429335555f1ef2953b1128adeb76b9816923788fe1e30c2a1482d69550b3361"],"state_sha256":"dca854709732dc683592a9b1ba4d5fa90a89114e6b1ded83ea5932bc1e9386c2"}