{"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"}