{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5XQEG54BAC6QMNQQBO7IXCCFWC","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":"85b485ac12d92ce28257fa9a80f4b89203b1ab3227181be2ccac7fd4e751c4ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-14T17:27:41Z","title_canon_sha256":"fbe64db801b4fe34402da7950850d5c7aff69c4b9ded34d38d7672e8dbd1dd2a"},"schema_version":"1.0","source":{"id":"1708.04218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04218","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04218v1","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04218","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"pith_short_12","alias_value":"5XQEG54BAC6Q","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XQEG54BAC6QMNQQ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XQEG54B","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:a370423266d4ad5fcf667b1400b5bd23a15c584f9dee2ceb0efcd81d4c1e6331","target":"graph","created_at":"2026-05-18T00:38:06Z","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 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})","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Guy Kortsarz, Luca Trevisan, Marek Cygan, Parinya Chalermsook, Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-14T17:27:41Z","title":"From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04218","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:175947378553108c70b52d14e2fc63acc57e09180d1c302cbaf641378fabe0fc","target":"record","created_at":"2026-05-18T00:38:06Z","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":"85b485ac12d92ce28257fa9a80f4b89203b1ab3227181be2ccac7fd4e751c4ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-14T17:27:41Z","title_canon_sha256":"fbe64db801b4fe34402da7950850d5c7aff69c4b9ded34d38d7672e8dbd1dd2a"},"schema_version":"1.0","source":{"id":"1708.04218","kind":"arxiv","version":1}},"canonical_sha256":"ede043778100bd0636100bbe8b8845b0933ec6af465c3493678485a16d5584f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede043778100bd0636100bbe8b8845b0933ec6af465c3493678485a16d5584f0","first_computed_at":"2026-05-18T00:38:06.767950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:06.767950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m4I5dDEpBpb0zzNkedxmRMPEUYbHmHwLLA1Tc2GZRCeFeyZ9ZC4pYVut6pAPFSyChu1hji7FxgTJ3Xkq4oyDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:06.768572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:175947378553108c70b52d14e2fc63acc57e09180d1c302cbaf641378fabe0fc","sha256:a370423266d4ad5fcf667b1400b5bd23a15c584f9dee2ceb0efcd81d4c1e6331"],"state_sha256":"a49b3f3a53921882a6905e085e618b897b3acbcbea029f422b48e921bf633e39"}