{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XLS66ENQSXR2VOQE62K7G6NJMU","short_pith_number":"pith:XLS66ENQ","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"},"canonical_sha256":"bae5ef11b095e3aaba04f695f379a965249bd0abdfa4ae4b96d3f315551c4fd4","source":{"kind":"arxiv","id":"1309.4718","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4718","created_at":"2026-05-18T01:03:53Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4718v3","created_at":"2026-05-18T01:03:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4718","created_at":"2026-05-18T01:03:53Z"},{"alias_kind":"pith_short_12","alias_value":"XLS66ENQSXR2","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XLS66ENQSXR2VOQE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XLS66ENQ","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XLS66ENQSXR2VOQE62K7G6NJMU","target":"record","payload":{"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"},"canonical_sha256":"bae5ef11b095e3aaba04f695f379a965249bd0abdfa4ae4b96d3f315551c4fd4","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"},"source_kind":"arxiv","source_id":"1309.4718","source_version":3,"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-18T01:03:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygIy679M74GOuzQnXwuv20Ar/0jEtaS2BtLMMcakQqb9ykieE2MjvsVeoJ45NSwZWiKSuLXduQUB/qSgjOybCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:16:19.262604Z"},"content_sha256":"98645972408879547f72b77c04eff40d50abdf0d8d8df7eaf07a5577bd5ca187","schema_version":"1.0","event_id":"sha256:98645972408879547f72b77c04eff40d50abdf0d8d8df7eaf07a5577bd5ca187"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XLS66ENQSXR2VOQE62K7G6NJMU","target":"graph","payload":{"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"},"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-18T01:03:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kez/VSNUOtjhAGo50W5dTtcxj9BFzglgEU1zQ30ygNWpOyaZ4J2qeXU0T4y76hsA9Bc6mxZSyO/pvgVna0geAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:16:19.262938Z"},"content_sha256":"82c9d6814017fcdf20609bb6b7cf1aa519bd2e83faa131e24c78e540da49a80f","schema_version":"1.0","event_id":"sha256:82c9d6814017fcdf20609bb6b7cf1aa519bd2e83faa131e24c78e540da49a80f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/bundle.json","state_url":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLS66ENQSXR2VOQE62K7G6NJMU/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-01T15:16:19Z","links":{"resolver":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU","bundle":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/bundle.json","state":"https://pith.science/pith/XLS66ENQSXR2VOQE62K7G6NJMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLS66ENQSXR2VOQE62K7G6NJMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XLS66ENQSXR2VOQE62K7G6NJMU","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":"36b78dc98537f56fb93d6b6a46a6750cc113c01cd2e54318adff02124135e1d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-18T17:40:53Z","title_canon_sha256":"adcec8309028a4dc133a3273bb9711f4a9aa2077b58abc784bbb367a2e0a6584"},"schema_version":"1.0","source":{"id":"1309.4718","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4718","created_at":"2026-05-18T01:03:53Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4718v3","created_at":"2026-05-18T01:03:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4718","created_at":"2026-05-18T01:03:53Z"},{"alias_kind":"pith_short_12","alias_value":"XLS66ENQSXR2","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XLS66ENQSXR2VOQE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XLS66ENQ","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:82c9d6814017fcdf20609bb6b7cf1aa519bd2e83faa131e24c78e540da49a80f","target":"graph","created_at":"2026-05-18T01:03:53Z","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":"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$.","authors_text":"Edouard Bonnet, Florian Sikora, Vangelis Th. Paschos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-18T17:40:53Z","title":"Parameterized Exact and Approximation Algorithms for Maximum $k$-Set Cover and Related Satisfiability Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4718","kind":"arxiv","version":3},"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:98645972408879547f72b77c04eff40d50abdf0d8d8df7eaf07a5577bd5ca187","target":"record","created_at":"2026-05-18T01:03:53Z","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":"36b78dc98537f56fb93d6b6a46a6750cc113c01cd2e54318adff02124135e1d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-18T17:40:53Z","title_canon_sha256":"adcec8309028a4dc133a3273bb9711f4a9aa2077b58abc784bbb367a2e0a6584"},"schema_version":"1.0","source":{"id":"1309.4718","kind":"arxiv","version":3}},"canonical_sha256":"bae5ef11b095e3aaba04f695f379a965249bd0abdfa4ae4b96d3f315551c4fd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bae5ef11b095e3aaba04f695f379a965249bd0abdfa4ae4b96d3f315551c4fd4","first_computed_at":"2026-05-18T01:03:53.676653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:53.676653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6W5PQZ53Hj95F8O5vFzNataRf9n+nDA9OQRmGB+XKvHmkt3yiMDdQAbTbfFzd4hHxi9cRlj1VM+5PSupHC1WCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:53.677384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4718","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98645972408879547f72b77c04eff40d50abdf0d8d8df7eaf07a5577bd5ca187","sha256:82c9d6814017fcdf20609bb6b7cf1aa519bd2e83faa131e24c78e540da49a80f"],"state_sha256":"66411575d7527a8b6c79f883f6ba2107fcc17a42adfbe268d0911293643db0b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+0JzlhT0QmWPYrnWpFUDQBrEnnUgO9U2s6V1On0QVYXD6rZBXLTgyZ6DqDrULivh3yxCke0k8mVxPOxCHOmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:16:19.264843Z","bundle_sha256":"cb7cd0610689e0a618b85e5396f0e0ef794383f776328c58b5481370c65ca4d2"}}