{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P6H57KR4JYPJMK66H3KXZCCEID","short_pith_number":"pith:P6H57KR4","canonical_record":{"source":{"id":"1905.01822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-06T04:29:28Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"ea3c5b69e4a03e69fc21f35891375508479619ce30f457f1a735f92edaf9623b","abstract_canon_sha256":"82e8ca0d35d87f8ab757f4e540a8ce87bf47a6832d401903e4bcb30517f8fe6d"},"schema_version":"1.0"},"canonical_sha256":"7f8fdfaa3c4e1e962bde3ed57c884440fe761194f6f1ae0250d432edc1d42da7","source":{"kind":"arxiv","id":"1905.01822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01822","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01822v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01822","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"P6H57KR4JYPJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P6H57KR4JYPJMK66","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P6H57KR4","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P6H57KR4JYPJMK66H3KXZCCEID","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-06T04:29:28Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"ea3c5b69e4a03e69fc21f35891375508479619ce30f457f1a735f92edaf9623b","abstract_canon_sha256":"82e8ca0d35d87f8ab757f4e540a8ce87bf47a6832d401903e4bcb30517f8fe6d"},"schema_version":"1.0"},"canonical_sha256":"7f8fdfaa3c4e1e962bde3ed57c884440fe761194f6f1ae0250d432edc1d42da7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.326555Z","signature_b64":"Z+J9KOEdLkcafjWfcbKWEHnurV8925lAllfDsNXTrRPpBY7q8NDEGc+jJ8XQwCwx2VdngwIUBeBghxX1DhBiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f8fdfaa3c4e1e962bde3ed57c884440fe761194f6f1ae0250d432edc1d42da7","last_reissued_at":"2026-05-17T23:46:57.325830Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.325830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01822","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:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WmsbNhsEJbJFuHIRbfDyiAziyPKZcstmf0I/0CfMzx4z2tlfUUBk32efpsAkaEDwqk+Goz6sXyfSsc/4wwaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:35:39.055490Z"},"content_sha256":"9b784cf2c96ae963d5c10bde2791134ab369345cfc257b4cbc599af3b9d4e0c9","schema_version":"1.0","event_id":"sha256:9b784cf2c96ae963d5c10bde2791134ab369345cfc257b4cbc599af3b9d4e0c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P6H57KR4JYPJMK66H3KXZCCEID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Dolly Yadav, Meghana M Reddy, Pradeesha Ashok, Saket Saurabh","submitted_at":"2019-05-06T04:29:28Z","abstract_excerpt":"We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph $G=(V,E)$, \\emph{conflict-free coloring} of $G$ refers to coloring a subset of $V$ such that for every vertex $v$, there is a color that is assigned to exactly one vertex in the closed neighborhood of $v$. The \\emph{k-Conflict-free Coloring} problem is to decide whether $G$ can be conflict-free colored using at most $k$ colors. This problem is NP-hard even for $k=1$ and therefore under standard complexity theoretic assumptions, FPT algorithms do not exist when parameterised by the so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01822","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:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUHnKgVY1PPDBvuqfVGwfjwY+uR6I6rztOdzas9gRvJt3oArtzjLOwNSe9t+xeIBAhmecOF8Mw9b7PZsCdUUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:35:39.055988Z"},"content_sha256":"c5eaa59a57374696f37420ee9d0d38eb567db69e8204b82c942a7a0385cbb350","schema_version":"1.0","event_id":"sha256:c5eaa59a57374696f37420ee9d0d38eb567db69e8204b82c942a7a0385cbb350"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6H57KR4JYPJMK66H3KXZCCEID/bundle.json","state_url":"https://pith.science/pith/P6H57KR4JYPJMK66H3KXZCCEID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6H57KR4JYPJMK66H3KXZCCEID/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-31T16:35:39Z","links":{"resolver":"https://pith.science/pith/P6H57KR4JYPJMK66H3KXZCCEID","bundle":"https://pith.science/pith/P6H57KR4JYPJMK66H3KXZCCEID/bundle.json","state":"https://pith.science/pith/P6H57KR4JYPJMK66H3KXZCCEID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6H57KR4JYPJMK66H3KXZCCEID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P6H57KR4JYPJMK66H3KXZCCEID","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":"82e8ca0d35d87f8ab757f4e540a8ce87bf47a6832d401903e4bcb30517f8fe6d","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-06T04:29:28Z","title_canon_sha256":"ea3c5b69e4a03e69fc21f35891375508479619ce30f457f1a735f92edaf9623b"},"schema_version":"1.0","source":{"id":"1905.01822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01822","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01822v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01822","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"P6H57KR4JYPJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P6H57KR4JYPJMK66","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P6H57KR4","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:c5eaa59a57374696f37420ee9d0d38eb567db69e8204b82c942a7a0385cbb350","target":"graph","created_at":"2026-05-17T23:46:57Z","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":"We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph $G=(V,E)$, \\emph{conflict-free coloring} of $G$ refers to coloring a subset of $V$ such that for every vertex $v$, there is a color that is assigned to exactly one vertex in the closed neighborhood of $v$. The \\emph{k-Conflict-free Coloring} problem is to decide whether $G$ can be conflict-free colored using at most $k$ colors. This problem is NP-hard even for $k=1$ and therefore under standard complexity theoretic assumptions, FPT algorithms do not exist when parameterised by the so","authors_text":"Akanksha Agrawal, Dolly Yadav, Meghana M Reddy, Pradeesha Ashok, Saket Saurabh","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-06T04:29:28Z","title":"FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01822","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:9b784cf2c96ae963d5c10bde2791134ab369345cfc257b4cbc599af3b9d4e0c9","target":"record","created_at":"2026-05-17T23:46:57Z","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":"82e8ca0d35d87f8ab757f4e540a8ce87bf47a6832d401903e4bcb30517f8fe6d","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-06T04:29:28Z","title_canon_sha256":"ea3c5b69e4a03e69fc21f35891375508479619ce30f457f1a735f92edaf9623b"},"schema_version":"1.0","source":{"id":"1905.01822","kind":"arxiv","version":1}},"canonical_sha256":"7f8fdfaa3c4e1e962bde3ed57c884440fe761194f6f1ae0250d432edc1d42da7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f8fdfaa3c4e1e962bde3ed57c884440fe761194f6f1ae0250d432edc1d42da7","first_computed_at":"2026-05-17T23:46:57.325830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:57.325830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z+J9KOEdLkcafjWfcbKWEHnurV8925lAllfDsNXTrRPpBY7q8NDEGc+jJ8XQwCwx2VdngwIUBeBghxX1DhBiDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:57.326555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b784cf2c96ae963d5c10bde2791134ab369345cfc257b4cbc599af3b9d4e0c9","sha256:c5eaa59a57374696f37420ee9d0d38eb567db69e8204b82c942a7a0385cbb350"],"state_sha256":"5da6bd4be864cd5b939ac2e52c8e1a1137d094e29a473098c613ef49cfcd4e07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DKpWPy/2RtCuHPccGnuHNAili8yUS6ngcCIYh9ZltqotT3mAVR2+wSu8zx6fsiYEtB9UrMMyuH59N58x1YHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:35:39.059397Z","bundle_sha256":"c0c31937f3b6e7299efcf32dcaaa8248722cc66c5e914e16e52f44f2517d8fd6"}}