{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4OCXOVIRLB3BTDZX53NWFLOGBX","short_pith_number":"pith:4OCXOVIR","canonical_record":{"source":{"id":"1409.3742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T14:14:04Z","cross_cats_sorted":[],"title_canon_sha256":"4ea4e7051481060235cf6913e42b2ed95800e57ce0242c03debb0ee559615ee4","abstract_canon_sha256":"9ebd5a7ee9981918c98d5f685515d19ee3884d06b6517d72fc248b69f98bc15d"},"schema_version":"1.0"},"canonical_sha256":"e3857755115876198f37eedb62adc60df683639644e5ecf6b36a8a80d9cb4f48","source":{"kind":"arxiv","id":"1409.3742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3742","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3742v1","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3742","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"4OCXOVIRLB3B","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4OCXOVIRLB3BTDZX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4OCXOVIR","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4OCXOVIRLB3BTDZX53NWFLOGBX","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T14:14:04Z","cross_cats_sorted":[],"title_canon_sha256":"4ea4e7051481060235cf6913e42b2ed95800e57ce0242c03debb0ee559615ee4","abstract_canon_sha256":"9ebd5a7ee9981918c98d5f685515d19ee3884d06b6517d72fc248b69f98bc15d"},"schema_version":"1.0"},"canonical_sha256":"e3857755115876198f37eedb62adc60df683639644e5ecf6b36a8a80d9cb4f48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:54.723686Z","signature_b64":"tV1HOVl3DubIirjiqbpHw62nCBhsL5a34vTkV6fGKBTuSHpvoetnQqchDwAcdbk490SZeyvuk9Y3V8opqc/iAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3857755115876198f37eedb62adc60df683639644e5ecf6b36a8a80d9cb4f48","last_reissued_at":"2026-05-18T02:42:54.723351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:54.723351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3742","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-18T02:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9nhoM/dFmjTARMgVE170DwqIv7xQGyQ3vn8d+Pk6ztI+VYBz2gtJarPthyTPuJ67AIwX1hb4hFGonGEBIIbBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:08:13.065177Z"},"content_sha256":"761ceefa387cd873fee38de301be707dfe2f3457aa9bd4995a67e22247be5bf1","schema_version":"1.0","event_id":"sha256:761ceefa387cd873fee38de301be707dfe2f3457aa9bd4995a67e22247be5bf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4OCXOVIRLB3BTDZX53NWFLOGBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristina Bazgan, Faisal N. Abu-Khzam, Henning Fernau, Morgan Chopin","submitted_at":"2014-09-12T14:14:04Z","abstract_excerpt":"Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. We exemplify this method to obtain the currently best approximation algorithms for \\textsc{Harmless Set}, \\textsc{Differential} and \\textsc{Multiple Nonblocker}, all of them can be considered in the context of securing networks or i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3742","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-18T02:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OovVlmA2+f+52Q9kmQDhopuXdgOdPfq0GpkWEzQ897kmcXtLY4eCTSKlWnEsvjRT2Fesd0ZxdJmTWYbOc06nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:08:13.065897Z"},"content_sha256":"5fbf2aa2e4e904b0fc2bf9743c730718f7778b496f7ba0de011435d55e2355de","schema_version":"1.0","event_id":"sha256:5fbf2aa2e4e904b0fc2bf9743c730718f7778b496f7ba0de011435d55e2355de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/bundle.json","state_url":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/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-05-25T05:08:13Z","links":{"resolver":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX","bundle":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/bundle.json","state":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4OCXOVIRLB3BTDZX53NWFLOGBX","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":"9ebd5a7ee9981918c98d5f685515d19ee3884d06b6517d72fc248b69f98bc15d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T14:14:04Z","title_canon_sha256":"4ea4e7051481060235cf6913e42b2ed95800e57ce0242c03debb0ee559615ee4"},"schema_version":"1.0","source":{"id":"1409.3742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3742","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3742v1","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3742","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"4OCXOVIRLB3B","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4OCXOVIRLB3BTDZX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4OCXOVIR","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:5fbf2aa2e4e904b0fc2bf9743c730718f7778b496f7ba0de011435d55e2355de","target":"graph","created_at":"2026-05-18T02:42:54Z","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":"Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. We exemplify this method to obtain the currently best approximation algorithms for \\textsc{Harmless Set}, \\textsc{Differential} and \\textsc{Multiple Nonblocker}, all of them can be considered in the context of securing networks or i","authors_text":"Cristina Bazgan, Faisal N. Abu-Khzam, Henning Fernau, Morgan Chopin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T14:14:04Z","title":"Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3742","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:761ceefa387cd873fee38de301be707dfe2f3457aa9bd4995a67e22247be5bf1","target":"record","created_at":"2026-05-18T02:42:54Z","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":"9ebd5a7ee9981918c98d5f685515d19ee3884d06b6517d72fc248b69f98bc15d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T14:14:04Z","title_canon_sha256":"4ea4e7051481060235cf6913e42b2ed95800e57ce0242c03debb0ee559615ee4"},"schema_version":"1.0","source":{"id":"1409.3742","kind":"arxiv","version":1}},"canonical_sha256":"e3857755115876198f37eedb62adc60df683639644e5ecf6b36a8a80d9cb4f48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3857755115876198f37eedb62adc60df683639644e5ecf6b36a8a80d9cb4f48","first_computed_at":"2026-05-18T02:42:54.723351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:54.723351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tV1HOVl3DubIirjiqbpHw62nCBhsL5a34vTkV6fGKBTuSHpvoetnQqchDwAcdbk490SZeyvuk9Y3V8opqc/iAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:54.723686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:761ceefa387cd873fee38de301be707dfe2f3457aa9bd4995a67e22247be5bf1","sha256:5fbf2aa2e4e904b0fc2bf9743c730718f7778b496f7ba0de011435d55e2355de"],"state_sha256":"8590ec87cf15779fe77548f6bf28706091816349af6a35a3a226346283e5cea5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aw9jErHHd7QOPtY95bJ8xiOSB/EOQsKO0ApkkJ3prN6LCTa8UlN4Pix/jKFo7xtDtAM5zLn4mzaAOfUuXXtoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:08:13.069259Z","bundle_sha256":"7d0fdfb2306b7df71e10a36f2a0ae5f5803506588fd38782eba06ea1772234e2"}}