{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:O5STEN5JRYWEH67X254MZWXNZL","short_pith_number":"pith:O5STEN5J","schema_version":"1.0","canonical_sha256":"77653237a98e2c43fbf7d778ccdaedcacbe17d1b415038374584405684765e5c","source":{"kind":"arxiv","id":"1512.06736","version":1},"attestation_state":"computed","paper":{"title":"On Lagrangian Relaxation and Reoptimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Kulik, Gal Tamir, Hadas Shachnai","submitted_at":"2015-12-21T17:58:38Z","abstract_excerpt":"We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of {\\em subset selection} problems with linear constraints. Given a problem in this class and some small $\\eps \\in (0,1)$, we show that if there exists an $r$-approximation algorithm for the Lagrangian relaxation of the problem, for some $r \\in (0,1)$, then our technique achieves a ratio of $\\frac{r}{r+1} -\\! \\eps$ to the optimal, and this ratio is tight.\n  The number of calls to the $"},"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":"1512.06736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-21T17:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"c6d42979b26a09be1b90c1a584945ce763484849c46aa043f6dffd3ad973d748","abstract_canon_sha256":"a78e85e3ecf35149717fa858acf448cadc1a3932810641734629e4f11cb28437"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:59.805255Z","signature_b64":"Nv4Dcy/ZhhjOeYNIkAXqgH0J+d7Ks/4hTm0YOgqW5KaHF+9tVP6B+UYGJJPTleihFhQuQJnIyecyEQAW85aUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77653237a98e2c43fbf7d778ccdaedcacbe17d1b415038374584405684765e5c","last_reissued_at":"2026-05-18T01:23:59.804554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:59.804554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Lagrangian Relaxation and Reoptimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Kulik, Gal Tamir, Hadas Shachnai","submitted_at":"2015-12-21T17:58:38Z","abstract_excerpt":"We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of {\\em subset selection} problems with linear constraints. Given a problem in this class and some small $\\eps \\in (0,1)$, we show that if there exists an $r$-approximation algorithm for the Lagrangian relaxation of the problem, for some $r \\in (0,1)$, then our technique achieves a ratio of $\\frac{r}{r+1} -\\! \\eps$ to the optimal, and this ratio is tight.\n  The number of calls to the $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06736","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":"1512.06736","created_at":"2026-05-18T01:23:59.804689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06736v1","created_at":"2026-05-18T01:23:59.804689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06736","created_at":"2026-05-18T01:23:59.804689+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5STEN5JRYWE","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5STEN5JRYWEH67X","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5STEN5J","created_at":"2026-05-18T12:29:34.919912+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/O5STEN5JRYWEH67X254MZWXNZL","json":"https://pith.science/pith/O5STEN5JRYWEH67X254MZWXNZL.json","graph_json":"https://pith.science/api/pith-number/O5STEN5JRYWEH67X254MZWXNZL/graph.json","events_json":"https://pith.science/api/pith-number/O5STEN5JRYWEH67X254MZWXNZL/events.json","paper":"https://pith.science/paper/O5STEN5J"},"agent_actions":{"view_html":"https://pith.science/pith/O5STEN5JRYWEH67X254MZWXNZL","download_json":"https://pith.science/pith/O5STEN5JRYWEH67X254MZWXNZL.json","view_paper":"https://pith.science/paper/O5STEN5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06736&json=true","fetch_graph":"https://pith.science/api/pith-number/O5STEN5JRYWEH67X254MZWXNZL/graph.json","fetch_events":"https://pith.science/api/pith-number/O5STEN5JRYWEH67X254MZWXNZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5STEN5JRYWEH67X254MZWXNZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5STEN5JRYWEH67X254MZWXNZL/action/storage_attestation","attest_author":"https://pith.science/pith/O5STEN5JRYWEH67X254MZWXNZL/action/author_attestation","sign_citation":"https://pith.science/pith/O5STEN5JRYWEH67X254MZWXNZL/action/citation_signature","submit_replication":"https://pith.science/pith/O5STEN5JRYWEH67X254MZWXNZL/action/replication_record"}},"created_at":"2026-05-18T01:23:59.804689+00:00","updated_at":"2026-05-18T01:23:59.804689+00:00"}