{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OCK2C3SKQDP7YO7CMHKF6SXMZO","short_pith_number":"pith:OCK2C3SK","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"},"canonical_sha256":"7095a16e4a80dffc3be261d45f4aeccba32908c1c4da9914aa4d5762370650a2","source":{"kind":"arxiv","id":"1309.4405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4405","created_at":"2026-05-18T03:13:08Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4405v1","created_at":"2026-05-18T03:13:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4405","created_at":"2026-05-18T03:13:08Z"},{"alias_kind":"pith_short_12","alias_value":"OCK2C3SKQDP7","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OCK2C3SKQDP7YO7C","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OCK2C3SK","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OCK2C3SKQDP7YO7CMHKF6SXMZO","target":"record","payload":{"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"},"canonical_sha256":"7095a16e4a80dffc3be261d45f4aeccba32908c1c4da9914aa4d5762370650a2","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"},"source_kind":"arxiv","source_id":"1309.4405","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkgZMYQe7exRXqVeQVeuE3bTyhZxzQRyqthAmcoilEz5oaHPPTapiMRAH8MbRlSYR0zKWHtprldck6i46ORpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:23:24.448894Z"},"content_sha256":"c228d7a003cb2cd2a4d38347ce3af0eb8359fbd6e2b4d71229e6e104e78ebd7b","schema_version":"1.0","event_id":"sha256:c228d7a003cb2cd2a4d38347ce3af0eb8359fbd6e2b4d71229e6e104e78ebd7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OCK2C3SKQDP7YO7CMHKF6SXMZO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PdJczbNH/3KhEgT/AsoCSFCA9miCREr5r+jDDs1Zex5Q6fC6nARHsS9SEgmYzAd182VY1k6BKAZSKTbxM0pCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:23:24.449244Z"},"content_sha256":"e1f4178ae03fba17cf32e57a2334d7a8684bdf9aaa4e03d2abf0a6b2fc3742eb","schema_version":"1.0","event_id":"sha256:e1f4178ae03fba17cf32e57a2334d7a8684bdf9aaa4e03d2abf0a6b2fc3742eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/bundle.json","state_url":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T01:23:24Z","links":{"resolver":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO","bundle":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/bundle.json","state":"https://pith.science/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCK2C3SKQDP7YO7CMHKF6SXMZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OCK2C3SKQDP7YO7CMHKF6SXMZO","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":"e64bb8977231ea2fbeb85afb4cfb8d1e71e654456305bc6d3ab8ed6c03dab981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-17T17:51:08Z","title_canon_sha256":"a5c04e989c1a4542f490b575fe99b2eb9f82c80eb04e575f22de1f5a10b64fe6"},"schema_version":"1.0","source":{"id":"1309.4405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4405","created_at":"2026-05-18T03:13:08Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4405v1","created_at":"2026-05-18T03:13:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4405","created_at":"2026-05-18T03:13:08Z"},{"alias_kind":"pith_short_12","alias_value":"OCK2C3SKQDP7","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OCK2C3SKQDP7YO7C","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OCK2C3SK","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:e1f4178ae03fba17cf32e57a2334d7a8684bdf9aaa4e03d2abf0a6b2fc3742eb","target":"graph","created_at":"2026-05-18T03:13:08Z","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 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","authors_text":"Piotr Faliszewski, Piotr Skowron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-17T17:51:08Z","title":"Approximating the MaxCover Problem with Bounded Frequencies in FPT Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4405","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:c228d7a003cb2cd2a4d38347ce3af0eb8359fbd6e2b4d71229e6e104e78ebd7b","target":"record","created_at":"2026-05-18T03:13:08Z","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":"e64bb8977231ea2fbeb85afb4cfb8d1e71e654456305bc6d3ab8ed6c03dab981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-17T17:51:08Z","title_canon_sha256":"a5c04e989c1a4542f490b575fe99b2eb9f82c80eb04e575f22de1f5a10b64fe6"},"schema_version":"1.0","source":{"id":"1309.4405","kind":"arxiv","version":1}},"canonical_sha256":"7095a16e4a80dffc3be261d45f4aeccba32908c1c4da9914aa4d5762370650a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7095a16e4a80dffc3be261d45f4aeccba32908c1c4da9914aa4d5762370650a2","first_computed_at":"2026-05-18T03:13:08.812432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:08.812432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"em87FOhLsZCLyvECAhFbRSsSHtVQgjI3Dziy4CTKSBnJumZC37LCDp2dLAWvE2KY/J5nkT560hQ0+5SYU9F4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:08.813285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c228d7a003cb2cd2a4d38347ce3af0eb8359fbd6e2b4d71229e6e104e78ebd7b","sha256:e1f4178ae03fba17cf32e57a2334d7a8684bdf9aaa4e03d2abf0a6b2fc3742eb"],"state_sha256":"c917a7a3745385edfb448da86abf9eb58fbaabaef1558efc657e7f33237445b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/S+XcbiEPjdoh9fIfeIBb2q5Y8GkVtnANNaBgiLmDmLjsknahATEan3qGvkt8LzTZyg7y5JqPFC9+i3juWWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:23:24.451214Z","bundle_sha256":"80528701456b461f4ebb036db83276a48c0a95d2c369766f28e65208bdfe559f"}}