{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XLS66ENQSXR2VOQE62K7G6NJMU","short_pith_number":"pith:XLS66ENQ","schema_version":"1.0","canonical_sha256":"bae5ef11b095e3aaba04f695f379a965249bd0abdfa4ae4b96d3f315551c4fd4","source":{"kind":"arxiv","id":"1309.4718","version":3},"attestation_state":"computed","paper":{"title":"Parameterized Exact and Approximation Algorithms for Maximum $k$-Set Cover and Related Satisfiability Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Edouard Bonnet, Florian Sikora, Vangelis Th. Paschos","submitted_at":"2013-09-18T17:40:53Z","abstract_excerpt":"Given a family of subsets $\\mathcal S$ over a set of elements~$X$ and two integers~$p$ and~$k$, Max k-Set Cover consists of finding a subfamily~$\\mathcal T \\subseteq \\mathcal S$ of cardinality at most~$k$, covering at least~$p$ elements of~$X$. This problem is W[2]-hard when parameterized by~$k$, and FPT when parameterized by $p$. We investigate the parameterized approximability of the problem with respect to parameters~$k$ and~$p$. Then, we show that Max Sat-k, a satisfiability problem generalizing Max k-Set Cover, is also FPT with respect to parameter~$p$."},"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":"1309.4718","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-18T17:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"adcec8309028a4dc133a3273bb9711f4a9aa2077b58abc784bbb367a2e0a6584","abstract_canon_sha256":"36b78dc98537f56fb93d6b6a46a6750cc113c01cd2e54318adff02124135e1d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:53.677384Z","signature_b64":"6W5PQZ53Hj95F8O5vFzNataRf9n+nDA9OQRmGB+XKvHmkt3yiMDdQAbTbfFzd4hHxi9cRlj1VM+5PSupHC1WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae5ef11b095e3aaba04f695f379a965249bd0abdfa4ae4b96d3f315551c4fd4","last_reissued_at":"2026-05-18T01:03:53.676653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:53.676653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Exact and Approximation Algorithms for Maximum $k$-Set Cover and Related Satisfiability Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Edouard Bonnet, Florian Sikora, Vangelis Th. Paschos","submitted_at":"2013-09-18T17:40:53Z","abstract_excerpt":"Given a family of subsets $\\mathcal S$ over a set of elements~$X$ and two integers~$p$ and~$k$, Max k-Set Cover consists of finding a subfamily~$\\mathcal T \\subseteq \\mathcal S$ of cardinality at most~$k$, covering at least~$p$ elements of~$X$. This problem is W[2]-hard when parameterized by~$k$, and FPT when parameterized by $p$. We investigate the parameterized approximability of the problem with respect to parameters~$k$ and~$p$. Then, we show that Max Sat-k, a satisfiability problem generalizing Max k-Set Cover, is also FPT with respect to parameter~$p$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4718","kind":"arxiv","version":3},"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":"1309.4718","created_at":"2026-05-18T01:03:53.676770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4718v3","created_at":"2026-05-18T01:03:53.676770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4718","created_at":"2026-05-18T01:03:53.676770+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLS66ENQSXR2","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLS66ENQSXR2VOQE","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLS66ENQ","created_at":"2026-05-18T12:28:06.772260+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/XLS66ENQSXR2VOQE62K7G6NJMU","json":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU.json","graph_json":"https://pith.science/api/pith-number/XLS66ENQSXR2VOQE62K7G6NJMU/graph.json","events_json":"https://pith.science/api/pith-number/XLS66ENQSXR2VOQE62K7G6NJMU/events.json","paper":"https://pith.science/paper/XLS66ENQ"},"agent_actions":{"view_html":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU","download_json":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU.json","view_paper":"https://pith.science/paper/XLS66ENQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4718&json=true","fetch_graph":"https://pith.science/api/pith-number/XLS66ENQSXR2VOQE62K7G6NJMU/graph.json","fetch_events":"https://pith.science/api/pith-number/XLS66ENQSXR2VOQE62K7G6NJMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/action/storage_attestation","attest_author":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/action/author_attestation","sign_citation":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/action/citation_signature","submit_replication":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/action/replication_record"}},"created_at":"2026-05-18T01:03:53.676770+00:00","updated_at":"2026-05-18T01:03:53.676770+00:00"}