{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:COPZ3XDCGHTPGBULSCIWPUYGYX","short_pith_number":"pith:COPZ3XDC","schema_version":"1.0","canonical_sha256":"139f9ddc6231e6f3068b909167d306c5fac8abc4e198c6a6db11c1f42d3434cf","source":{"kind":"arxiv","id":"1711.11029","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.11029","created_at":"2026-05-18T00:18:37.043500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11029v2","created_at":"2026-05-18T00:18:37.043500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11029","created_at":"2026-05-18T00:18:37.043500+00:00"},{"alias_kind":"pith_short_12","alias_value":"COPZ3XDCGHTP","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"COPZ3XDCGHTPGBUL","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"COPZ3XDC","created_at":"2026-05-18T12:31:10.602751+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/COPZ3XDCGHTPGBULSCIWPUYGYX","json":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX.json","graph_json":"https://pith.science/api/pith-number/COPZ3XDCGHTPGBULSCIWPUYGYX/graph.json","events_json":"https://pith.science/api/pith-number/COPZ3XDCGHTPGBULSCIWPUYGYX/events.json","paper":"https://pith.science/paper/COPZ3XDC"},"agent_actions":{"view_html":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX","download_json":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX.json","view_paper":"https://pith.science/paper/COPZ3XDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11029&json=true","fetch_graph":"https://pith.science/api/pith-number/COPZ3XDCGHTPGBULSCIWPUYGYX/graph.json","fetch_events":"https://pith.science/api/pith-number/COPZ3XDCGHTPGBULSCIWPUYGYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/action/storage_attestation","attest_author":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/action/author_attestation","sign_citation":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/action/citation_signature","submit_replication":"https://pith.science/pith/COPZ3XDCGHTPGBULSCIWPUYGYX/action/replication_record"}},"created_at":"2026-05-18T00:18:37.043500+00:00","updated_at":"2026-05-18T00:18:37.043500+00:00"}