{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5XQEG54BAC6QMNQQBO7IXCCFWC","short_pith_number":"pith:5XQEG54B","schema_version":"1.0","canonical_sha256":"ede043778100bd0636100bbe8b8845b0933ec6af465c3493678485a16d5584f0","source":{"kind":"arxiv","id":"1708.04218","version":1},"attestation_state":"computed","paper":{"title":"From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Guy Kortsarz, Luca Trevisan, Marek Cygan, Parinya Chalermsook, Pasin Manurangsi","submitted_at":"2017-08-14T17:27:41Z","abstract_excerpt":"We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, which have been asked several times (e.g., [Marx08, FGMS12, DF13]), are whether there is a non-trivial FPT-approximation algorithm for the Maximum Clique (Clique) and Minimum Dominating Set (DomSet) problems parameterized by the size of the optimal solution. In particular, letting $\\text{OPT}$ be the optimum and $N$ be the size of the input, is there an algorithm that runs in $t(\\text{OPT})"},"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":"1708.04218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-14T17:27:41Z","cross_cats_sorted":[],"title_canon_sha256":"fbe64db801b4fe34402da7950850d5c7aff69c4b9ded34d38d7672e8dbd1dd2a","abstract_canon_sha256":"85b485ac12d92ce28257fa9a80f4b89203b1ab3227181be2ccac7fd4e751c4ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:06.768572Z","signature_b64":"m4I5dDEpBpb0zzNkedxmRMPEUYbHmHwLLA1Tc2GZRCeFeyZ9ZC4pYVut6pAPFSyChu1hji7FxgTJ3Xkq4oyDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede043778100bd0636100bbe8b8845b0933ec6af465c3493678485a16d5584f0","last_reissued_at":"2026-05-18T00:38:06.767950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:06.767950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Guy Kortsarz, Luca Trevisan, Marek Cygan, Parinya Chalermsook, Pasin Manurangsi","submitted_at":"2017-08-14T17:27:41Z","abstract_excerpt":"We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, which have been asked several times (e.g., [Marx08, FGMS12, DF13]), are whether there is a non-trivial FPT-approximation algorithm for the Maximum Clique (Clique) and Minimum Dominating Set (DomSet) problems parameterized by the size of the optimal solution. In particular, letting $\\text{OPT}$ be the optimum and $N$ be the size of the input, is there an algorithm that runs in $t(\\text{OPT})"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04218","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.04218","created_at":"2026-05-18T00:38:06.768049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04218v1","created_at":"2026-05-18T00:38:06.768049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04218","created_at":"2026-05-18T00:38:06.768049+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XQEG54BAC6Q","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XQEG54BAC6QMNQQ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XQEG54B","created_at":"2026-05-18T12:31:03.183658+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/5XQEG54BAC6QMNQQBO7IXCCFWC","json":"https://pith.science/pith/5XQEG54BAC6QMNQQBO7IXCCFWC.json","graph_json":"https://pith.science/api/pith-number/5XQEG54BAC6QMNQQBO7IXCCFWC/graph.json","events_json":"https://pith.science/api/pith-number/5XQEG54BAC6QMNQQBO7IXCCFWC/events.json","paper":"https://pith.science/paper/5XQEG54B"},"agent_actions":{"view_html":"https://pith.science/pith/5XQEG54BAC6QMNQQBO7IXCCFWC","download_json":"https://pith.science/pith/5XQEG54BAC6QMNQQBO7IXCCFWC.json","view_paper":"https://pith.science/paper/5XQEG54B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04218&json=true","fetch_graph":"https://pith.science/api/pith-number/5XQEG54BAC6QMNQQBO7IXCCFWC/graph.json","fetch_events":"https://pith.science/api/pith-number/5XQEG54BAC6QMNQQBO7IXCCFWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XQEG54BAC6QMNQQBO7IXCCFWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XQEG54BAC6QMNQQBO7IXCCFWC/action/storage_attestation","attest_author":"https://pith.science/pith/5XQEG54BAC6QMNQQBO7IXCCFWC/action/author_attestation","sign_citation":"https://pith.science/pith/5XQEG54BAC6QMNQQBO7IXCCFWC/action/citation_signature","submit_replication":"https://pith.science/pith/5XQEG54BAC6QMNQQBO7IXCCFWC/action/replication_record"}},"created_at":"2026-05-18T00:38:06.768049+00:00","updated_at":"2026-05-18T00:38:06.768049+00:00"}