{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QOXJDWZRTTP36G5XN3OP43RBE7","short_pith_number":"pith:QOXJDWZR","schema_version":"1.0","canonical_sha256":"83ae91db319cdfbf1bb76edcfe6e2127c443dcae49a0da4890c6b5c07aa1496d","source":{"kind":"arxiv","id":"1302.4347","version":1},"attestation_state":"computed","paper":{"title":"Large Neighborhood Local Search for the Maximum Set Packing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Ward, Maxim Sviridenko","submitted_at":"2013-02-18T16:48:00Z","abstract_excerpt":"In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by $k$. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee $(k+2)/3$. This local search algorithm is a special case of a more general procedure that allows to swap up to $\\Theta(\\log n)$ elements per iteration. We also design problem instances with locality gap $k/3$ even for a wide class of exponential time local search procedures, which can swap up to $cn$ elements for a constant $c$. This shows that our analysis of this class of algor"},"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":"1302.4347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-18T16:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"009e8c00a8c1e186dd80bc28ee3c11531655c6b43c7227d078e4e1c4d9e148ad","abstract_canon_sha256":"d285f38bbfd9e5eb0e8e9c310ba557dc43bf3561aa1d8ecd36a6674b1408f55c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.335744Z","signature_b64":"eLxQkmlNvpcZkX0iZt22sSTd+xudTaQZVU0TR+xrcf/ZeJRLLs12+2Sf72Jx9Yc4RXEYqSosAts+oXW8bQz4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83ae91db319cdfbf1bb76edcfe6e2127c443dcae49a0da4890c6b5c07aa1496d","last_reissued_at":"2026-05-18T03:33:23.334901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.334901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Neighborhood Local Search for the Maximum Set Packing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Ward, Maxim Sviridenko","submitted_at":"2013-02-18T16:48:00Z","abstract_excerpt":"In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by $k$. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee $(k+2)/3$. This local search algorithm is a special case of a more general procedure that allows to swap up to $\\Theta(\\log n)$ elements per iteration. We also design problem instances with locality gap $k/3$ even for a wide class of exponential time local search procedures, which can swap up to $cn$ elements for a constant $c$. This shows that our analysis of this class of algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4347","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":"1302.4347","created_at":"2026-05-18T03:33:23.335054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4347v1","created_at":"2026-05-18T03:33:23.335054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4347","created_at":"2026-05-18T03:33:23.335054+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOXJDWZRTTP3","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOXJDWZRTTP36G5X","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOXJDWZR","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02874","citing_title":"Ranking with Partitioning","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7","json":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7.json","graph_json":"https://pith.science/api/pith-number/QOXJDWZRTTP36G5XN3OP43RBE7/graph.json","events_json":"https://pith.science/api/pith-number/QOXJDWZRTTP36G5XN3OP43RBE7/events.json","paper":"https://pith.science/paper/QOXJDWZR"},"agent_actions":{"view_html":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7","download_json":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7.json","view_paper":"https://pith.science/paper/QOXJDWZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4347&json=true","fetch_graph":"https://pith.science/api/pith-number/QOXJDWZRTTP36G5XN3OP43RBE7/graph.json","fetch_events":"https://pith.science/api/pith-number/QOXJDWZRTTP36G5XN3OP43RBE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7/action/storage_attestation","attest_author":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7/action/author_attestation","sign_citation":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7/action/citation_signature","submit_replication":"https://pith.science/pith/QOXJDWZRTTP36G5XN3OP43RBE7/action/replication_record"}},"created_at":"2026-05-18T03:33:23.335054+00:00","updated_at":"2026-05-18T03:33:23.335054+00:00"}