{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:COPZ3XDCGHTPGBULSCIWPUYGYX","short_pith_number":"pith:COPZ3XDC","canonical_record":{"source":{"id":"1711.11029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T18:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"46d3c81dc966cda436d7a21455878745481d2866072d0931e78b37189c77f715","abstract_canon_sha256":"a9be439365c98710b87b9b4781f51595d60b32604ac8a7fc74aa30497720e16a"},"schema_version":"1.0"},"canonical_sha256":"139f9ddc6231e6f3068b909167d306c5fac8abc4e198c6a6db11c1f42d3434cf","source":{"kind":"arxiv","id":"1711.11029","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11029","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11029v2","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11029","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"COPZ3XDCGHTP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"COPZ3XDCGHTPGBUL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"COPZ3XDC","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:COPZ3XDCGHTPGBULSCIWPUYGYX","target":"record","payload":{"canonical_record":{"source":{"id":"1711.11029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T18:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"46d3c81dc966cda436d7a21455878745481d2866072d0931e78b37189c77f715","abstract_canon_sha256":"a9be439365c98710b87b9b4781f51595d60b32604ac8a7fc74aa30497720e16a"},"schema_version":"1.0"},"canonical_sha256":"139f9ddc6231e6f3068b909167d306c5fac8abc4e198c6a6db11c1f42d3434cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:37.044017Z","signature_b64":"59hHMifkLmTYunwzm8ZLrSHfrTocbHWOrQFAkoEoLQJVvR4jxMN2WV3QoUTfpscPTHUQhtn/eWYs25gMTbIcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"139f9ddc6231e6f3068b909167d306c5fac8abc4e198c6a6db11c1f42d3434cf","last_reissued_at":"2026-05-18T00:18:37.043404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:37.043404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.11029","source_version":2,"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-18T00:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlCkVw8M8oCQe+YqTcxWiyZk6o07FMcot1j9wukWZ95WtP/4VALSrNdd+m5SaTeZ5zMG7oQqV80WP7BMKavxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:33:46.750697Z"},"content_sha256":"a1ffce892b9c456ca1dd966c609609dbba8cf6afbd4c61e7518910e92c524903","schema_version":"1.0","event_id":"sha256:a1ffce892b9c456ca1dd966c609609dbba8cf6afbd4c61e7518910e92c524903"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:COPZ3XDCGHTPGBULSCIWPUYGYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Parameterized Complexity of Approximating Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bundit Laekhanukit, Karthik C. S., Pasin Manurangsi","submitted_at":"2017-11-29T18:58:47Z","abstract_excerpt":"We study the parameterized complexity of approximating the $k$-Dominating Set (DomSet) problem where an integer $k$ and a graph $G$ on $n$ vertices are given as input, and the goal is to find a dominating set of size at most $F(k) \\cdot k$ whenever the graph $G$ has a dominating set of size $k$. When such an algorithm runs in time $T(k) \\cdot poly(n)$ (i.e., FPT-time) for some computable function $T$, it is said to be an $F(k)$-FPT-approximation algorithm for $k$-DomSet. We prove the following for every computable functions $T, F$ and every constant $\\varepsilon > 0$:\n  $\\bullet$ Assuming $W[1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11029","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":""},"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-18T00:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRAKwgiJhiAmZmftzi0P0t346dyNvJRFRzHexSeN0Uy/atfXhktXmomYFfLj7LKQdibyMwaPffkHeA83ttZhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:33:46.751085Z"},"content_sha256":"9b07cf107755a28c0526c1f6c554aac6cf36b84c9fa30c7316522a138da24f34","schema_version":"1.0","event_id":"sha256:9b07cf107755a28c0526c1f6c554aac6cf36b84c9fa30c7316522a138da24f34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/bundle.json","state_url":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/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-06-01T22:33:46Z","links":{"resolver":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX","bundle":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/bundle.json","state":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:COPZ3XDCGHTPGBULSCIWPUYGYX","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":"a9be439365c98710b87b9b4781f51595d60b32604ac8a7fc74aa30497720e16a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T18:58:47Z","title_canon_sha256":"46d3c81dc966cda436d7a21455878745481d2866072d0931e78b37189c77f715"},"schema_version":"1.0","source":{"id":"1711.11029","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11029","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11029v2","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11029","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"COPZ3XDCGHTP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"COPZ3XDCGHTPGBUL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"COPZ3XDC","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:9b07cf107755a28c0526c1f6c554aac6cf36b84c9fa30c7316522a138da24f34","target":"graph","created_at":"2026-05-18T00:18:37Z","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 study the parameterized complexity of approximating the $k$-Dominating Set (DomSet) problem where an integer $k$ and a graph $G$ on $n$ vertices are given as input, and the goal is to find a dominating set of size at most $F(k) \\cdot k$ whenever the graph $G$ has a dominating set of size $k$. When such an algorithm runs in time $T(k) \\cdot poly(n)$ (i.e., FPT-time) for some computable function $T$, it is said to be an $F(k)$-FPT-approximation algorithm for $k$-DomSet. We prove the following for every computable functions $T, F$ and every constant $\\varepsilon > 0$:\n  $\\bullet$ Assuming $W[1","authors_text":"Bundit Laekhanukit, Karthik C. S., Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T18:58:47Z","title":"On the Parameterized Complexity of Approximating Dominating Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11029","kind":"arxiv","version":2},"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:a1ffce892b9c456ca1dd966c609609dbba8cf6afbd4c61e7518910e92c524903","target":"record","created_at":"2026-05-18T00:18:37Z","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":"a9be439365c98710b87b9b4781f51595d60b32604ac8a7fc74aa30497720e16a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T18:58:47Z","title_canon_sha256":"46d3c81dc966cda436d7a21455878745481d2866072d0931e78b37189c77f715"},"schema_version":"1.0","source":{"id":"1711.11029","kind":"arxiv","version":2}},"canonical_sha256":"139f9ddc6231e6f3068b909167d306c5fac8abc4e198c6a6db11c1f42d3434cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"139f9ddc6231e6f3068b909167d306c5fac8abc4e198c6a6db11c1f42d3434cf","first_computed_at":"2026-05-18T00:18:37.043404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:37.043404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"59hHMifkLmTYunwzm8ZLrSHfrTocbHWOrQFAkoEoLQJVvR4jxMN2WV3QoUTfpscPTHUQhtn/eWYs25gMTbIcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:37.044017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11029","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1ffce892b9c456ca1dd966c609609dbba8cf6afbd4c61e7518910e92c524903","sha256:9b07cf107755a28c0526c1f6c554aac6cf36b84c9fa30c7316522a138da24f34"],"state_sha256":"f082115edfd5c04693c914a9abc8997a0eda413e80cb88f58fa89a6e0958e9e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXEtVPWbYicjDJRn21Q/0+RhAlcUqLsJKlLtyc0t4sW+rPbeS4QkwJSZXr9+jPPMt1/2Jl7RfDtLe8bGzn7YAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:33:46.752975Z","bundle_sha256":"cb950d300e0b0dd79489cb6c04e1399a053f18fb8fdce7fd0d9f4120196e107d"}}