{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P5MPKTR4A2DJYUWSZOFAV5JVWS","short_pith_number":"pith:P5MPKTR4","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"},"canonical_sha256":"7f58f54e3c06869c52d2cb8a0af535b4875832f0ab46a13200232e79de025854","source":{"kind":"arxiv","id":"1905.00305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00305","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00305v1","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00305","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"P5MPKTR4A2DJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P5MPKTR4A2DJYUWS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P5MPKTR4","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P5MPKTR4A2DJYUWSZOFAV5JVWS","target":"record","payload":{"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"},"canonical_sha256":"7f58f54e3c06869c52d2cb8a0af535b4875832f0ab46a13200232e79de025854","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"},"source_kind":"arxiv","source_id":"1905.00305","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wuNWjnVoTVhkYpzqbmVD2TEPVVg7ATHnZUkPfRgzhZC94rN6llThHQ3ahDGLcd5X09jjXhXYJPAJlt2uUMXpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:56.975914Z"},"content_sha256":"29725fa7ad7b7f99976d81ceb2d7c24a7e979ccb97f66e7a7d219027ff4ed53b","schema_version":"1.0","event_id":"sha256:29725fa7ad7b7f99976d81ceb2d7c24a7e979ccb97f66e7a7d219027ff4ed53b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P5MPKTR4A2DJYUWSZOFAV5JVWS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tgx9b5fMEktkTTeTW/YoYqT0w0YUgT5epsMDxi15ZrfzJM7OCpZ/ptFCDpEZSIQsqAjz9lyQHSA0McaZwb5FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:56.976536Z"},"content_sha256":"bf82fe15c056ec90bbd9315e43546ed6f78d31c2d899005d829dec11db95345c","schema_version":"1.0","event_id":"sha256:bf82fe15c056ec90bbd9315e43546ed6f78d31c2d899005d829dec11db95345c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/bundle.json","state_url":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T19:23:56Z","links":{"resolver":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS","bundle":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/bundle.json","state":"https://pith.science/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5MPKTR4A2DJYUWSZOFAV5JVWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P5MPKTR4A2DJYUWSZOFAV5JVWS","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":"2a59bd69d8004afa4e0caa5d715569b747ce7eb3465dccafbad848373b81ec59","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T13:23:30Z","title_canon_sha256":"b078f63459af8df4b436690981433b5486c4af8ee22751eb0d95dd953a6d16fc"},"schema_version":"1.0","source":{"id":"1905.00305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00305","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00305v1","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00305","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"P5MPKTR4A2DJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P5MPKTR4A2DJYUWS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P5MPKTR4","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:bf82fe15c056ec90bbd9315e43546ed6f78d31c2d899005d829dec11db95345c","target":"graph","created_at":"2026-05-17T23:47:13Z","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"},"paper":{"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 ","authors_text":"Astrid Pieterse, Hans L. Bodlaender, Sudeshna Kolay","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T13:23:30Z","title":"Parameterized Complexity of Conflict-free Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00305","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:29725fa7ad7b7f99976d81ceb2d7c24a7e979ccb97f66e7a7d219027ff4ed53b","target":"record","created_at":"2026-05-17T23:47:13Z","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":"2a59bd69d8004afa4e0caa5d715569b747ce7eb3465dccafbad848373b81ec59","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T13:23:30Z","title_canon_sha256":"b078f63459af8df4b436690981433b5486c4af8ee22751eb0d95dd953a6d16fc"},"schema_version":"1.0","source":{"id":"1905.00305","kind":"arxiv","version":1}},"canonical_sha256":"7f58f54e3c06869c52d2cb8a0af535b4875832f0ab46a13200232e79de025854","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f58f54e3c06869c52d2cb8a0af535b4875832f0ab46a13200232e79de025854","first_computed_at":"2026-05-17T23:47:13.210874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:13.210874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NKI99AclzssAhwXw976mJpNCX+W+SS7oDmLfhb/F+kncnt95NifBYQvBQ7BlSAHhiBSyLDjb/QYY702yI4odDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:13.211298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29725fa7ad7b7f99976d81ceb2d7c24a7e979ccb97f66e7a7d219027ff4ed53b","sha256:bf82fe15c056ec90bbd9315e43546ed6f78d31c2d899005d829dec11db95345c"],"state_sha256":"a3d4357f0a633a60a7682b3f63541f4339d4168e327df6c919b369bf234325b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BwD83goaSpKHalvvpYDh3J/THn/058ixolHMni+QWKWkFtd5FKaRBXxi1C3feTDSugUHUTCNciFxVnuEjlGYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:23:56.979697Z","bundle_sha256":"b234b3a83d8824840404660238b2b1cd482142a29b665888bd7cf48f54dfc52b"}}