{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P5MPKTR4A2DJYUWSZOFAV5JVWS","short_pith_number":"pith:P5MPKTR4","schema_version":"1.0","canonical_sha256":"7f58f54e3c06869c52d2cb8a0af535b4875832f0ab46a13200232e79de025854","source":{"kind":"arxiv","id":"1905.00305","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of Conflict-free Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Hans L. Bodlaender, Sudeshna Kolay","submitted_at":"2019-05-01T13:23:30Z","abstract_excerpt":"Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring $c:V(G) \\rightarrow \\{1,2,\\ldots,q\\}$ such that for each vertex $v \\in V(G)$ there is a vertex in $N(v)$ that is uniquely colored from the rest of the vertices in $N(v)$. When we replace $N(v)$ by the closed neighborhood $N[v]$, then we call such a coloring a q-closed neighborhood conflict-free coloring or simply q-CNCF-coloring. In this paper, we study the NP-hard decision questions of whether for a constant q an input graph has a q-ONCF-coloring or a q-CNCF-coloring. We will study these two "},"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":"1905.00305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T13:23:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b078f63459af8df4b436690981433b5486c4af8ee22751eb0d95dd953a6d16fc","abstract_canon_sha256":"2a59bd69d8004afa4e0caa5d715569b747ce7eb3465dccafbad848373b81ec59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:13.211298Z","signature_b64":"NKI99AclzssAhwXw976mJpNCX+W+SS7oDmLfhb/F+kncnt95NifBYQvBQ7BlSAHhiBSyLDjb/QYY702yI4odDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f58f54e3c06869c52d2cb8a0af535b4875832f0ab46a13200232e79de025854","last_reissued_at":"2026-05-17T23:47:13.210874Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:13.210874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Conflict-free Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Hans L. Bodlaender, Sudeshna Kolay","submitted_at":"2019-05-01T13:23:30Z","abstract_excerpt":"Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring $c:V(G) \\rightarrow \\{1,2,\\ldots,q\\}$ such that for each vertex $v \\in V(G)$ there is a vertex in $N(v)$ that is uniquely colored from the rest of the vertices in $N(v)$. When we replace $N(v)$ by the closed neighborhood $N[v]$, then we call such a coloring a q-closed neighborhood conflict-free coloring or simply q-CNCF-coloring. In this paper, we study the NP-hard decision questions of whether for a constant q an input graph has a q-ONCF-coloring or a q-CNCF-coloring. We will study these two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00305","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":""},"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":"1905.00305","created_at":"2026-05-17T23:47:13.210961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00305v1","created_at":"2026-05-17T23:47:13.210961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00305","created_at":"2026-05-17T23:47:13.210961+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5MPKTR4A2DJ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5MPKTR4A2DJYUWS","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5MPKTR4","created_at":"2026-05-18T12:33:24.271573+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/P5MPKTR4A2DJYUWSZOFAV5JVWS","json":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS.json","graph_json":"https://pith.science/api/pith-number/P5MPKTR4A2DJYUWSZOFAV5JVWS/graph.json","events_json":"https://pith.science/api/pith-number/P5MPKTR4A2DJYUWSZOFAV5JVWS/events.json","paper":"https://pith.science/paper/P5MPKTR4"},"agent_actions":{"view_html":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS","download_json":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS.json","view_paper":"https://pith.science/paper/P5MPKTR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00305&json=true","fetch_graph":"https://pith.science/api/pith-number/P5MPKTR4A2DJYUWSZOFAV5JVWS/graph.json","fetch_events":"https://pith.science/api/pith-number/P5MPKTR4A2DJYUWSZOFAV5JVWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/action/storage_attestation","attest_author":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/action/author_attestation","sign_citation":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/action/citation_signature","submit_replication":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/action/replication_record"}},"created_at":"2026-05-17T23:47:13.210961+00:00","updated_at":"2026-05-17T23:47:13.210961+00:00"}