{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:O3KQ76JR27IDM4AN2EVPOYJISV","short_pith_number":"pith:O3KQ76JR","schema_version":"1.0","canonical_sha256":"76d50ff931d7d036700dd12af7612895462f8161bd47f5caebac7ca331f1b34c","source":{"kind":"arxiv","id":"2312.15962","version":2},"attestation_state":"computed","paper":{"title":"Truncated degree DP-colourability of $K_{2,4}$-minor free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Wang, Huan Zhou, On-Hei Solomon Lo, Xuding Zhu","submitted_at":"2023-12-26T08:53:08Z","abstract_excerpt":"Assume $G$ is a graph and $k$ is a positive integer. Let $f$ from $V(G)$ to $ N$ be defined as $f(v)$ is the minimum of $k$ and $d(v)$. If $G$ is $f$-DP-colourable (respectively, $f$-choosable), then we say $G$ is $k$-truncated degree DP-colourable (respectively, $k$-truncated degree-choosable). Hutchinson proved that 2-connected maximal outerplanar graphs other than the triangle are $5$-truncated degree-choosable, and asked whether the result can be extended to all outerplanar graphs, and the question remained open.\n  This paper proves that 2-connected $K24$-minor free graphs other than cycle"},"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":"2312.15962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-26T08:53:08Z","cross_cats_sorted":[],"title_canon_sha256":"fe522d5a1912a621aef85cfbee1b05c91f6e838a9d53989a12f10191b4853077","abstract_canon_sha256":"3240455fb0095087fc332d9c62e5679747b44905ab183b507714e61ebb0235b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:25:04.024302Z","signature_b64":"6qauaSo2RzmO/wbs/z0/sbJJsVjlDnb/qeJenzNTUBLVvJm91FhWfB0SnFi5kxniq4q7R2PnjUDpZQcjFtCACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76d50ff931d7d036700dd12af7612895462f8161bd47f5caebac7ca331f1b34c","last_reissued_at":"2026-07-05T10:25:04.023293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:25:04.023293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truncated degree DP-colourability of $K_{2,4}$-minor free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Wang, Huan Zhou, On-Hei Solomon Lo, Xuding Zhu","submitted_at":"2023-12-26T08:53:08Z","abstract_excerpt":"Assume $G$ is a graph and $k$ is a positive integer. Let $f$ from $V(G)$ to $ N$ be defined as $f(v)$ is the minimum of $k$ and $d(v)$. If $G$ is $f$-DP-colourable (respectively, $f$-choosable), then we say $G$ is $k$-truncated degree DP-colourable (respectively, $k$-truncated degree-choosable). Hutchinson proved that 2-connected maximal outerplanar graphs other than the triangle are $5$-truncated degree-choosable, and asked whether the result can be extended to all outerplanar graphs, and the question remained open.\n  This paper proves that 2-connected $K24$-minor free graphs other than cycle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15962","kind":"arxiv","version":2},"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/2312.15962/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":"2312.15962","created_at":"2026-07-05T10:25:04.023439+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.15962v2","created_at":"2026-07-05T10:25:04.023439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15962","created_at":"2026-07-05T10:25:04.023439+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3KQ76JR27ID","created_at":"2026-07-05T10:25:04.023439+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3KQ76JR27IDM4AN","created_at":"2026-07-05T10:25:04.023439+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3KQ76JR","created_at":"2026-07-05T10:25:04.023439+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10453","citing_title":"Degree-truncated choosability of graphs","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV","json":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV.json","graph_json":"https://pith.science/api/pith-number/O3KQ76JR27IDM4AN2EVPOYJISV/graph.json","events_json":"https://pith.science/api/pith-number/O3KQ76JR27IDM4AN2EVPOYJISV/events.json","paper":"https://pith.science/paper/O3KQ76JR"},"agent_actions":{"view_html":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV","download_json":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV.json","view_paper":"https://pith.science/paper/O3KQ76JR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.15962&json=true","fetch_graph":"https://pith.science/api/pith-number/O3KQ76JR27IDM4AN2EVPOYJISV/graph.json","fetch_events":"https://pith.science/api/pith-number/O3KQ76JR27IDM4AN2EVPOYJISV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV/action/storage_attestation","attest_author":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV/action/author_attestation","sign_citation":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV/action/citation_signature","submit_replication":"https://pith.science/pith/O3KQ76JR27IDM4AN2EVPOYJISV/action/replication_record"}},"created_at":"2026-07-05T10:25:04.023439+00:00","updated_at":"2026-07-05T10:25:04.023439+00:00"}