{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OCK2C3SKQDP7YO7CMHKF6SXMZO","short_pith_number":"pith:OCK2C3SK","schema_version":"1.0","canonical_sha256":"7095a16e4a80dffc3be261d45f4aeccba32908c1c4da9914aa4d5762370650a2","source":{"kind":"arxiv","id":"1309.4405","version":1},"attestation_state":"computed","paper":{"title":"Approximating the MaxCover Problem with Bounded Frequencies in FPT Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Piotr Faliszewski, Piotr Skowron","submitted_at":"2013-09-17T17:51:08Z","abstract_excerpt":"We study approximation algorithms for several variants of the MaxCover problem, with the focus on algorithms that run in FPT time. In the MaxCover problem we are given a set N of elements, a family S of subsets of N, and an integer K. The goal is to find up to K sets from S that jointly cover (i.e., include) as many elements as possible. This problem is well-known to be NP-hard and, under standard complexity-theoretic assumptions, the best possible polynomial-time approximation algorithm has approximation ratio (1 - 1/e). We first consider a variant of MaxCover with bounded element frequencies"},"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.4405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-17T17:51:08Z","cross_cats_sorted":[],"title_canon_sha256":"a5c04e989c1a4542f490b575fe99b2eb9f82c80eb04e575f22de1f5a10b64fe6","abstract_canon_sha256":"e64bb8977231ea2fbeb85afb4cfb8d1e71e654456305bc6d3ab8ed6c03dab981"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:08.813285Z","signature_b64":"em87FOhLsZCLyvECAhFbRSsSHtVQgjI3Dziy4CTKSBnJumZC37LCDp2dLAWvE2KY/J5nkT560hQ0+5SYU9F4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7095a16e4a80dffc3be261d45f4aeccba32908c1c4da9914aa4d5762370650a2","last_reissued_at":"2026-05-18T03:13:08.812432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:08.812432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the MaxCover Problem with Bounded Frequencies in FPT Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Piotr Faliszewski, Piotr Skowron","submitted_at":"2013-09-17T17:51:08Z","abstract_excerpt":"We study approximation algorithms for several variants of the MaxCover problem, with the focus on algorithms that run in FPT time. In the MaxCover problem we are given a set N of elements, a family S of subsets of N, and an integer K. The goal is to find up to K sets from S that jointly cover (i.e., include) as many elements as possible. This problem is well-known to be NP-hard and, under standard complexity-theoretic assumptions, the best possible polynomial-time approximation algorithm has approximation ratio (1 - 1/e). We first consider a variant of MaxCover with bounded element frequencies"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4405","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":"1309.4405","created_at":"2026-05-18T03:13:08.812565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4405v1","created_at":"2026-05-18T03:13:08.812565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4405","created_at":"2026-05-18T03:13:08.812565+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCK2C3SKQDP7","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCK2C3SKQDP7YO7C","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCK2C3SK","created_at":"2026-05-18T12:27:54.935989+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/OCK2C3SKQDP7YO7CMHKF6SXMZO","json":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO.json","graph_json":"https://pith.science/api/pith-number/OCK2C3SKQDP7YO7CMHKF6SXMZO/graph.json","events_json":"https://pith.science/api/pith-number/OCK2C3SKQDP7YO7CMHKF6SXMZO/events.json","paper":"https://pith.science/paper/OCK2C3SK"},"agent_actions":{"view_html":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO","download_json":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO.json","view_paper":"https://pith.science/paper/OCK2C3SK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4405&json=true","fetch_graph":"https://pith.science/api/pith-number/OCK2C3SKQDP7YO7CMHKF6SXMZO/graph.json","fetch_events":"https://pith.science/api/pith-number/OCK2C3SKQDP7YO7CMHKF6SXMZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/action/storage_attestation","attest_author":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/action/author_attestation","sign_citation":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/action/citation_signature","submit_replication":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/action/replication_record"}},"created_at":"2026-05-18T03:13:08.812565+00:00","updated_at":"2026-05-18T03:13:08.812565+00:00"}