{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F2BHZD5RJLWHNUHRUQ5CP3YORD","short_pith_number":"pith:F2BHZD5R","canonical_record":{"source":{"id":"1310.5576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-21T14:46:23Z","cross_cats_sorted":[],"title_canon_sha256":"f436daa123b4a866407e57796f3a9e0885f96d8f993588f7d7016c84147234d6","abstract_canon_sha256":"9a9bc31da8a5b5c04b29b23cad6306da4aef85766ed980710a9f7c3f1183f383"},"schema_version":"1.0"},"canonical_sha256":"2e827c8fb14aec76d0f1a43a27ef0e88e1c88807f8c44faf006a3ede7d3db5f5","source":{"kind":"arxiv","id":"1310.5576","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5576","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5576v1","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5576","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"F2BHZD5RJLWH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F2BHZD5RJLWHNUHR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F2BHZD5R","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F2BHZD5RJLWHNUHRUQ5CP3YORD","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-21T14:46:23Z","cross_cats_sorted":[],"title_canon_sha256":"f436daa123b4a866407e57796f3a9e0885f96d8f993588f7d7016c84147234d6","abstract_canon_sha256":"9a9bc31da8a5b5c04b29b23cad6306da4aef85766ed980710a9f7c3f1183f383"},"schema_version":"1.0"},"canonical_sha256":"2e827c8fb14aec76d0f1a43a27ef0e88e1c88807f8c44faf006a3ede7d3db5f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:34.885414Z","signature_b64":"a+JVvQ/+IdiyBzPBU6KHGeOuBlo3/03pDuW4dohzBWsloDxAd0kCqcXMXq/J0PsolcuxhKEQonCQ95CuKVGCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e827c8fb14aec76d0f1a43a27ef0e88e1c88807f8c44faf006a3ede7d3db5f5","last_reissued_at":"2026-05-18T03:09:34.884804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:34.884804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5576","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:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tM6jt+FnHVxyi4ext1jS3iNxn9MTIMAZTq2yw2RiDNhgYxESrEMCBSns43+/KIX9kn/PlWziKVQ+ewf3I/9iAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:16:07.430758Z"},"content_sha256":"e9ae45b7852b38f28296eb7f35b59fb7eecee0fa3387d942ee457bb783b3f826","schema_version":"1.0","event_id":"sha256:e9ae45b7852b38f28296eb7f35b59fb7eecee0fa3387d942ee457bb783b3f826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F2BHZD5RJLWHNUHRUQ5CP3YORD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized (in)approximability of subset problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Edouard Bonnet, Vangelis Th. Paschos","submitted_at":"2013-10-21T14:46:23Z","abstract_excerpt":"We discuss approximability and inapproximability in FPT-time for a large class of subset problems where a feasible solution $S$ is a subset of the input data and the value of $S$ is $|S|$. The class handled encompasses many well-known graph, set, or satisfiability problems such as Dominating Set, Vertex Cover, Set Cover, Independent Set, Feedback Vertex Set, etc. In a first time, we introduce the notion of intersective approximability that generalizes the one of safe approximability and show strong parameterized inapproximability results for many of the subset problems handled. Then, we study "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5576","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:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSIwoFHB64MIjQjEC/o0vd8Uf2sgyQTHQpP91CvSC+Z+pU4GAXOfArZLaJbhuRA6gw4svmIB9NdY/39kRWCaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:16:07.431190Z"},"content_sha256":"9c084ac334ee769d5a2c8de5a809c5bc15e211e3fe233dcb2a0fb6959da069f2","schema_version":"1.0","event_id":"sha256:9c084ac334ee769d5a2c8de5a809c5bc15e211e3fe233dcb2a0fb6959da069f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2BHZD5RJLWHNUHRUQ5CP3YORD/bundle.json","state_url":"https://pith.science/pith/F2BHZD5RJLWHNUHRUQ5CP3YORD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2BHZD5RJLWHNUHRUQ5CP3YORD/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-06T09:16:07Z","links":{"resolver":"https://pith.science/pith/F2BHZD5RJLWHNUHRUQ5CP3YORD","bundle":"https://pith.science/pith/F2BHZD5RJLWHNUHRUQ5CP3YORD/bundle.json","state":"https://pith.science/pith/F2BHZD5RJLWHNUHRUQ5CP3YORD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2BHZD5RJLWHNUHRUQ5CP3YORD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F2BHZD5RJLWHNUHRUQ5CP3YORD","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":"9a9bc31da8a5b5c04b29b23cad6306da4aef85766ed980710a9f7c3f1183f383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-21T14:46:23Z","title_canon_sha256":"f436daa123b4a866407e57796f3a9e0885f96d8f993588f7d7016c84147234d6"},"schema_version":"1.0","source":{"id":"1310.5576","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5576","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5576v1","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5576","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"F2BHZD5RJLWH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F2BHZD5RJLWHNUHR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F2BHZD5R","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:9c084ac334ee769d5a2c8de5a809c5bc15e211e3fe233dcb2a0fb6959da069f2","target":"graph","created_at":"2026-05-18T03:09:34Z","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 discuss approximability and inapproximability in FPT-time for a large class of subset problems where a feasible solution $S$ is a subset of the input data and the value of $S$ is $|S|$. The class handled encompasses many well-known graph, set, or satisfiability problems such as Dominating Set, Vertex Cover, Set Cover, Independent Set, Feedback Vertex Set, etc. In a first time, we introduce the notion of intersective approximability that generalizes the one of safe approximability and show strong parameterized inapproximability results for many of the subset problems handled. Then, we study ","authors_text":"Edouard Bonnet, Vangelis Th. Paschos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-21T14:46:23Z","title":"Parameterized (in)approximability of subset problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5576","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:e9ae45b7852b38f28296eb7f35b59fb7eecee0fa3387d942ee457bb783b3f826","target":"record","created_at":"2026-05-18T03:09:34Z","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":"9a9bc31da8a5b5c04b29b23cad6306da4aef85766ed980710a9f7c3f1183f383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-21T14:46:23Z","title_canon_sha256":"f436daa123b4a866407e57796f3a9e0885f96d8f993588f7d7016c84147234d6"},"schema_version":"1.0","source":{"id":"1310.5576","kind":"arxiv","version":1}},"canonical_sha256":"2e827c8fb14aec76d0f1a43a27ef0e88e1c88807f8c44faf006a3ede7d3db5f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e827c8fb14aec76d0f1a43a27ef0e88e1c88807f8c44faf006a3ede7d3db5f5","first_computed_at":"2026-05-18T03:09:34.884804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:34.884804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a+JVvQ/+IdiyBzPBU6KHGeOuBlo3/03pDuW4dohzBWsloDxAd0kCqcXMXq/J0PsolcuxhKEQonCQ95CuKVGCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:34.885414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5576","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9ae45b7852b38f28296eb7f35b59fb7eecee0fa3387d942ee457bb783b3f826","sha256:9c084ac334ee769d5a2c8de5a809c5bc15e211e3fe233dcb2a0fb6959da069f2"],"state_sha256":"fdd4c78593ddfc4114e4087100ca68a74bb9d6614f85678657dbef7c47a29f68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LdJoS3JqX5NmFUGndkedpjCvjp/ndjRgkfUlz9o+BAy+xpiobgnAExaFSKinnWJsYEZBueshsqaY5z7KjiaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T09:16:07.433679Z","bundle_sha256":"5e42bd199b23fc439c04a3c75d2215fc61ba3129dadafc897c3913bbf7024a12"}}