{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5E76NTPNG6CPZQDLZ3W2QWCAC7","short_pith_number":"pith:5E76NTPN","schema_version":"1.0","canonical_sha256":"e93fe6cded3784fcc06bceeda8584017ccc4c7c9d0e30f1ef17e7b124b1d3e95","source":{"kind":"arxiv","id":"1808.01767","version":3},"attestation_state":"computed","paper":{"title":"DP-Degree Colorable Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Schweser","submitted_at":"2018-08-06T08:30:28Z","abstract_excerpt":"In order to solve a question on list coloring of planar graphs, Dvo\\v{r}\\'{a}k and Postle introduced the concept of so called DP-coloring, thereby extending the concept of list-coloring. DP-coloring was anaylized in detail by Bernshteyn, Kostochka, and Pron for graphs and multigraphs; they characterized DP-degree colorable multigraphs and deduced a Brooks' type result from this. The characterization of the corresponding 'bad' covers was later given by Kim and Ozeki. In this paper, the concept of DP-colorings is extended to hypergraphs having multiple (hyper-)edges. We characterize the DP-degre"},"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":"1808.01767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-06T08:30:28Z","cross_cats_sorted":[],"title_canon_sha256":"98eeb23ccbad995bf82a3d9cdb663b83feee195c35b771ec449d7d8884c0c79a","abstract_canon_sha256":"894af1544e0fbbd08a9d235b04659f281bc19a780acfaeac9e0bed14dad36e71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:53.810194Z","signature_b64":"M4WAYomUWcj69hKlaVYddHygTUJ7q+GTChE9vQXFkkhb7ojZ1T2HKPd3eTXZ+05TMSaisH/FT01NAAakLerdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e93fe6cded3784fcc06bceeda8584017ccc4c7c9d0e30f1ef17e7b124b1d3e95","last_reissued_at":"2026-05-17T23:42:53.809524Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:53.809524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DP-Degree Colorable Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Schweser","submitted_at":"2018-08-06T08:30:28Z","abstract_excerpt":"In order to solve a question on list coloring of planar graphs, Dvo\\v{r}\\'{a}k and Postle introduced the concept of so called DP-coloring, thereby extending the concept of list-coloring. DP-coloring was anaylized in detail by Bernshteyn, Kostochka, and Pron for graphs and multigraphs; they characterized DP-degree colorable multigraphs and deduced a Brooks' type result from this. The characterization of the corresponding 'bad' covers was later given by Kim and Ozeki. In this paper, the concept of DP-colorings is extended to hypergraphs having multiple (hyper-)edges. We characterize the DP-degre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01767","kind":"arxiv","version":3},"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":"1808.01767","created_at":"2026-05-17T23:42:53.809649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.01767v3","created_at":"2026-05-17T23:42:53.809649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01767","created_at":"2026-05-17T23:42:53.809649+00:00"},{"alias_kind":"pith_short_12","alias_value":"5E76NTPNG6CP","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5E76NTPNG6CPZQDL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5E76NTPN","created_at":"2026-05-18T12:32:08.215937+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/5E76NTPNG6CPZQDLZ3W2QWCAC7","json":"https://pith.science/pith/5E76NTPNG6CPZQDLZ3W2QWCAC7.json","graph_json":"https://pith.science/api/pith-number/5E76NTPNG6CPZQDLZ3W2QWCAC7/graph.json","events_json":"https://pith.science/api/pith-number/5E76NTPNG6CPZQDLZ3W2QWCAC7/events.json","paper":"https://pith.science/paper/5E76NTPN"},"agent_actions":{"view_html":"https://pith.science/pith/5E76NTPNG6CPZQDLZ3W2QWCAC7","download_json":"https://pith.science/pith/5E76NTPNG6CPZQDLZ3W2QWCAC7.json","view_paper":"https://pith.science/paper/5E76NTPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.01767&json=true","fetch_graph":"https://pith.science/api/pith-number/5E76NTPNG6CPZQDLZ3W2QWCAC7/graph.json","fetch_events":"https://pith.science/api/pith-number/5E76NTPNG6CPZQDLZ3W2QWCAC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5E76NTPNG6CPZQDLZ3W2QWCAC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5E76NTPNG6CPZQDLZ3W2QWCAC7/action/storage_attestation","attest_author":"https://pith.science/pith/5E76NTPNG6CPZQDLZ3W2QWCAC7/action/author_attestation","sign_citation":"https://pith.science/pith/5E76NTPNG6CPZQDLZ3W2QWCAC7/action/citation_signature","submit_replication":"https://pith.science/pith/5E76NTPNG6CPZQDLZ3W2QWCAC7/action/replication_record"}},"created_at":"2026-05-17T23:42:53.809649+00:00","updated_at":"2026-05-17T23:42:53.809649+00:00"}