{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4OCXOVIRLB3BTDZX53NWFLOGBX","short_pith_number":"pith:4OCXOVIR","schema_version":"1.0","canonical_sha256":"e3857755115876198f37eedb62adc60df683639644e5ecf6b36a8a80d9cb4f48","source":{"kind":"arxiv","id":"1409.3742","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.3742","created_at":"2026-05-18T02:42:54.723404+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3742v1","created_at":"2026-05-18T02:42:54.723404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3742","created_at":"2026-05-18T02:42:54.723404+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OCXOVIRLB3B","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OCXOVIRLB3BTDZX","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OCXOVIR","created_at":"2026-05-18T12:28:14.216126+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/4OCXOVIRLB3BTDZX53NWFLOGBX","json":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX.json","graph_json":"https://pith.science/api/pith-number/4OCXOVIRLB3BTDZX53NWFLOGBX/graph.json","events_json":"https://pith.science/api/pith-number/4OCXOVIRLB3BTDZX53NWFLOGBX/events.json","paper":"https://pith.science/paper/4OCXOVIR"},"agent_actions":{"view_html":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX","download_json":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX.json","view_paper":"https://pith.science/paper/4OCXOVIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3742&json=true","fetch_graph":"https://pith.science/api/pith-number/4OCXOVIRLB3BTDZX53NWFLOGBX/graph.json","fetch_events":"https://pith.science/api/pith-number/4OCXOVIRLB3BTDZX53NWFLOGBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/action/storage_attestation","attest_author":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/action/author_attestation","sign_citation":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/action/citation_signature","submit_replication":"https://pith.science/pith/4OCXOVIRLB3BTDZX53NWFLOGBX/action/replication_record"}},"created_at":"2026-05-18T02:42:54.723404+00:00","updated_at":"2026-05-18T02:42:54.723404+00:00"}