{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EOIAF2FMQ34ZD4USYOFQBOIQLT","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":"c1686eca9992f23373d765c506588e69c25e78d78d65d045e0f9f7a99731ce9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T14:30:45Z","title_canon_sha256":"94a7d94e036102b186b8c7ebdad85566e3af09f8f01402f3f97742eee585d6c5"},"schema_version":"1.0","source":{"id":"2606.06216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06216","created_at":"2026-06-05T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06216v1","created_at":"2026-06-05T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06216","created_at":"2026-06-05T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"EOIAF2FMQ34Z","created_at":"2026-06-05T01:15:38Z"},{"alias_kind":"pith_short_16","alias_value":"EOIAF2FMQ34ZD4US","created_at":"2026-06-05T01:15:38Z"},{"alias_kind":"pith_short_8","alias_value":"EOIAF2FM","created_at":"2026-06-05T01:15:38Z"}],"graph_snapshots":[{"event_id":"sha256:3410bcc814c718b20013d38811b8cbe780071a5451e42fed5912cf2586b0fcc6","target":"graph","created_at":"2026-06-05T01:15:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.06216/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Assume $G$ is a graph and $k$ is a positive integer. Let $f:V(G)\\to \\mathbb{N}$ be defined as $f(v)=\\min\\{k,d_G(v)\\}$. If $G$ is $f$-choosable, then we say $G$ is degree-truncated $k$-choosable. The degree-truncated choice number of $G$ is $\\operatorname{ch}^{\\text{\\st{d}}}(G) = \\min\\{k: G \\text{ is degree-truncated $k$-choosable}\\}$. For a family $\\mathcal{G}$ of graphs, $\\operatorname{ch}^{\\text{\\st{d}}}(\\mathcal{G}) = \\max\\{\\operatorname{ch}^{\\text{\\st{d}}}(G):G \\in \\mathcal{G}\\}$. Let $\\mathcal{P}$ denote the family of 3-connected non-complete planar graphs. Richter asked in 2008 whether $","authors_text":"Huan Zhou, Huijuan Xu, Jialu Zhu, Xuding Zhu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06216","kind":"arxiv","version":1},"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:12814f737150208b179f0b95d3b06fde24e3bea593cf2454bf38c85286605aef","target":"record","created_at":"2026-06-05T01:15:38Z","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":"c1686eca9992f23373d765c506588e69c25e78d78d65d045e0f9f7a99731ce9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T14:30:45Z","title_canon_sha256":"94a7d94e036102b186b8c7ebdad85566e3af09f8f01402f3f97742eee585d6c5"},"schema_version":"1.0","source":{"id":"2606.06216","kind":"arxiv","version":1}},"canonical_sha256":"239002e8ac86f991f292c38b00b9105ce0359ef04aa9d5a3977aebb9d89a5233","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"239002e8ac86f991f292c38b00b9105ce0359ef04aa9d5a3977aebb9d89a5233","first_computed_at":"2026-06-05T01:15:38.091290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:38.091290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b5r6oQjDdXvbcfJL+YHwMZQ++LyYpF0eMb5i7XXJZV0a6RK9H8pePGUZpW5rlZmf1iwf5cErOD3yuIzFAeV3Dw==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:38.091957Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.06216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12814f737150208b179f0b95d3b06fde24e3bea593cf2454bf38c85286605aef","sha256:3410bcc814c718b20013d38811b8cbe780071a5451e42fed5912cf2586b0fcc6"],"state_sha256":"0b4dd88677a3505d89a7232719ee67401a563e365da4890ecae1a18d71cecfe0"}