{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:33RHWY37MLIDMT25NSVJHGLCZ2","short_pith_number":"pith:33RHWY37","schema_version":"1.0","canonical_sha256":"dee27b637f62d0364f5d6caa939962ce9b4ec9507985028055e0870d53ef473e","source":{"kind":"arxiv","id":"1308.3520","version":1},"attestation_state":"computed","paper":{"title":"Fixed-Parameter and Approximation Algorithms: A New Look","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, MohammadTaghi Hajiaghayi, Rajesh Chitnis","submitted_at":"2013-08-15T22:17:59Z","abstract_excerpt":"A Fixed-Parameter Tractable (\\FPT) $\\rho$-approximation algorithm for a minimization (resp. maximization) parameterized problem $P$ is an FPT algorithm that, given an instance $(x, k)\\in P$ computes a solution of cost at most $k \\cdot \\rho(k)$ (resp. $k/\\rho(k)$) if a solution of cost at most (resp. at least) $k$ exists; otherwise the output can be arbitrary. For well-known intractable problems such as the W[1]-hard {Clique} and W[2]-hard {Set Cover} problems, the natural question is whether we can get any \\FPT-approximation. It is widely believed that both {Clique} and {Set-Cover} admit no FP"},"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":"1308.3520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-15T22:17:59Z","cross_cats_sorted":[],"title_canon_sha256":"8bf0b65b0f0393af08257e062cfd512c826538f65514991d6ccc7d4488db8800","abstract_canon_sha256":"8195217016cecdbcd38466a9fc08af950efe5ce30ae29b2dfb89c8a58527a0f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:44.690349Z","signature_b64":"dkGyu2oDZrKjkrzi12Y0eSKmR5WutFsZrUVzV21m07XjkKKRaNn44f/dhc1ngw6FNRSOW5pKWBt55iiOA8QKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee27b637f62d0364f5d6caa939962ce9b4ec9507985028055e0870d53ef473e","last_reissued_at":"2026-05-18T03:15:44.689589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:44.689589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-Parameter and Approximation Algorithms: A New Look","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, MohammadTaghi Hajiaghayi, Rajesh Chitnis","submitted_at":"2013-08-15T22:17:59Z","abstract_excerpt":"A Fixed-Parameter Tractable (\\FPT) $\\rho$-approximation algorithm for a minimization (resp. maximization) parameterized problem $P$ is an FPT algorithm that, given an instance $(x, k)\\in P$ computes a solution of cost at most $k \\cdot \\rho(k)$ (resp. $k/\\rho(k)$) if a solution of cost at most (resp. at least) $k$ exists; otherwise the output can be arbitrary. For well-known intractable problems such as the W[1]-hard {Clique} and W[2]-hard {Set Cover} problems, the natural question is whether we can get any \\FPT-approximation. It is widely believed that both {Clique} and {Set-Cover} admit no FP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3520","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":"1308.3520","created_at":"2026-05-18T03:15:44.689716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3520v1","created_at":"2026-05-18T03:15:44.689716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3520","created_at":"2026-05-18T03:15:44.689716+00:00"},{"alias_kind":"pith_short_12","alias_value":"33RHWY37MLID","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"33RHWY37MLIDMT25","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"33RHWY37","created_at":"2026-05-18T12:27:32.513160+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/33RHWY37MLIDMT25NSVJHGLCZ2","json":"https://pith.science/pith/33RHWY37MLIDMT25NSVJHGLCZ2.json","graph_json":"https://pith.science/api/pith-number/33RHWY37MLIDMT25NSVJHGLCZ2/graph.json","events_json":"https://pith.science/api/pith-number/33RHWY37MLIDMT25NSVJHGLCZ2/events.json","paper":"https://pith.science/paper/33RHWY37"},"agent_actions":{"view_html":"https://pith.science/pith/33RHWY37MLIDMT25NSVJHGLCZ2","download_json":"https://pith.science/pith/33RHWY37MLIDMT25NSVJHGLCZ2.json","view_paper":"https://pith.science/paper/33RHWY37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3520&json=true","fetch_graph":"https://pith.science/api/pith-number/33RHWY37MLIDMT25NSVJHGLCZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/33RHWY37MLIDMT25NSVJHGLCZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33RHWY37MLIDMT25NSVJHGLCZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33RHWY37MLIDMT25NSVJHGLCZ2/action/storage_attestation","attest_author":"https://pith.science/pith/33RHWY37MLIDMT25NSVJHGLCZ2/action/author_attestation","sign_citation":"https://pith.science/pith/33RHWY37MLIDMT25NSVJHGLCZ2/action/citation_signature","submit_replication":"https://pith.science/pith/33RHWY37MLIDMT25NSVJHGLCZ2/action/replication_record"}},"created_at":"2026-05-18T03:15:44.689716+00:00","updated_at":"2026-05-18T03:15:44.689716+00:00"}