{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OSFKKX4TFYR5DYQW4QK3EUDTHE","short_pith_number":"pith:OSFKKX4T","schema_version":"1.0","canonical_sha256":"748aa55f932e23d1e216e415b2507339096093dbd85e23c67d09e7de910eaa8c","source":{"kind":"arxiv","id":"2507.10453","version":1},"attestation_state":"computed","paper":{"title":"Degree-truncated choosability of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huan Zhou, Jialu Zhu, Xuding Zhu","submitted_at":"2025-07-14T16:31:11Z","abstract_excerpt":"A graph $G$ is called degree-truncated $k$-choosable if for every list assignment $L$ with $|L(v)| \\ge \\min\\{d_G(v), k\\}$ for each vertex $v$, $G$ is $L$-colourable. Richter asked whether every 3-connected non-complete planar graph is degree-truncated 6-choosable. We answer this question in negative by constructing a 3-connected non-complete planar graph which is not degree-truncated 7-choosable. Then we prove that every 3-connected non-complete planar graph is degree-truncated 16-DP-colourable (and hence degree-truncated $16$-choosable). We further prove that for an arbitrary proper minor clo"},"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":"2507.10453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T16:31:11Z","cross_cats_sorted":[],"title_canon_sha256":"40356dac317eaafe5f86eaba821fe7a40019a9e42bc260d36a79ac06186eba3a","abstract_canon_sha256":"f596e56b73100372764f29cc983db75c90f20988f22f228a33dfceefcaca313d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:51.649054Z","signature_b64":"i2fePaa5W6MNUxij2m86xwS1Zfz1Iz0a4pzbWBFFUpxITB6bcmKFlNm8bbT67Tamxn35nGoJaEZQawkHZrsJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"748aa55f932e23d1e216e415b2507339096093dbd85e23c67d09e7de910eaa8c","last_reissued_at":"2026-07-05T11:36:51.648520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:51.648520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree-truncated choosability of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huan Zhou, Jialu Zhu, Xuding Zhu","submitted_at":"2025-07-14T16:31:11Z","abstract_excerpt":"A graph $G$ is called degree-truncated $k$-choosable if for every list assignment $L$ with $|L(v)| \\ge \\min\\{d_G(v), k\\}$ for each vertex $v$, $G$ is $L$-colourable. Richter asked whether every 3-connected non-complete planar graph is degree-truncated 6-choosable. We answer this question in negative by constructing a 3-connected non-complete planar graph which is not degree-truncated 7-choosable. Then we prove that every 3-connected non-complete planar graph is degree-truncated 16-DP-colourable (and hence degree-truncated $16$-choosable). We further prove that for an arbitrary proper minor clo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10453","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.10453/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.10453","created_at":"2026-07-05T11:36:51.648581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.10453v1","created_at":"2026-07-05T11:36:51.648581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10453","created_at":"2026-07-05T11:36:51.648581+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSFKKX4TFYR5","created_at":"2026-07-05T11:36:51.648581+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSFKKX4TFYR5DYQW","created_at":"2026-07-05T11:36:51.648581+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSFKKX4T","created_at":"2026-07-05T11:36:51.648581+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/OSFKKX4TFYR5DYQW4QK3EUDTHE","json":"https://pith.science/pith/OSFKKX4TFYR5DYQW4QK3EUDTHE.json","graph_json":"https://pith.science/api/pith-number/OSFKKX4TFYR5DYQW4QK3EUDTHE/graph.json","events_json":"https://pith.science/api/pith-number/OSFKKX4TFYR5DYQW4QK3EUDTHE/events.json","paper":"https://pith.science/paper/OSFKKX4T"},"agent_actions":{"view_html":"https://pith.science/pith/OSFKKX4TFYR5DYQW4QK3EUDTHE","download_json":"https://pith.science/pith/OSFKKX4TFYR5DYQW4QK3EUDTHE.json","view_paper":"https://pith.science/paper/OSFKKX4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.10453&json=true","fetch_graph":"https://pith.science/api/pith-number/OSFKKX4TFYR5DYQW4QK3EUDTHE/graph.json","fetch_events":"https://pith.science/api/pith-number/OSFKKX4TFYR5DYQW4QK3EUDTHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSFKKX4TFYR5DYQW4QK3EUDTHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSFKKX4TFYR5DYQW4QK3EUDTHE/action/storage_attestation","attest_author":"https://pith.science/pith/OSFKKX4TFYR5DYQW4QK3EUDTHE/action/author_attestation","sign_citation":"https://pith.science/pith/OSFKKX4TFYR5DYQW4QK3EUDTHE/action/citation_signature","submit_replication":"https://pith.science/pith/OSFKKX4TFYR5DYQW4QK3EUDTHE/action/replication_record"}},"created_at":"2026-07-05T11:36:51.648581+00:00","updated_at":"2026-07-05T11:36:51.648581+00:00"}