{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZRLTCAO7TUIEWYCPYB43YRQ2PY","short_pith_number":"pith:ZRLTCAO7","schema_version":"1.0","canonical_sha256":"cc573101df9d104b604fc079bc461a7e0d79edf1573de58378c17b95ae5028df","source":{"kind":"arxiv","id":"2605.14499","version":1},"attestation_state":"computed","paper":{"title":"Hitting Axis-Parallel Segments with Weighted Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier.","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Jatin Yadav, Rajiv Raman, Siddhartha Sarkar","submitted_at":"2026-05-14T07:38:53Z","abstract_excerpt":"We study a geometric hitting-set problem in which the input consists of a set $P$ of weighted points and a family $S=H\\cup V$ of axis-parallel segments in the plane. The goal is to select a minimum-weight subset of $P$ that hits every segment in $S$. Even restricted geometric hitting-set problems are known to be computationally hard, and for axis-parallel segments the standard decomposition into horizontal and vertical sub-instances yields only a simple factor-$2$ approximation.\n  We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a random"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14499","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T07:38:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"892c44f7c22756dd1daf270084526279826f90703fbf6a1bca9cab893fd5ad3e","abstract_canon_sha256":"f434d680cb49f07d37717a213b94d62451753a0be2a6cd9111786a092966c33b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:06.337856Z","signature_b64":"sdz+/2iRaNjGuHO4CCaleSASiKCCVJ0mZ40VIJMxt6kxkiXHWhIbhkghKHAnc6nBh/WMfkgqI2GLPvwaF82RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc573101df9d104b604fc079bc461a7e0d79edf1573de58378c17b95ae5028df","last_reissued_at":"2026-05-17T23:39:06.337154Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:06.337154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting Axis-Parallel Segments with Weighted Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier.","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Jatin Yadav, Rajiv Raman, Siddhartha Sarkar","submitted_at":"2026-05-14T07:38:53Z","abstract_excerpt":"We study a geometric hitting-set problem in which the input consists of a set $P$ of weighted points and a family $S=H\\cup V$ of axis-parallel segments in the plane. The goal is to select a minimum-weight subset of $P$ that hits every segment in $S$. Even restricted geometric hitting-set problems are known to be computationally hard, and for axis-parallel segments the standard decomposition into horizontal and vertical sub-instances yields only a simple factor-$2$ approximation.\n  We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a random"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a randomized (1+2/e)-approximation by combining systematic rounding on horizontal lines with an exact repair step on residual vertical sub-instances.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The LP relaxation admits an efficient solution whose fractional optimum is within a constant factor of the integral optimum, and that the rounding analysis holds without additional assumptions on point or segment positions beyond axis-parallelism.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An LP-rounding algorithm yields a randomized (1 + 2/e)-approximation for weighted hitting set of axis-parallel segments, with a (1 + 1/(e-1)) bound in the unweighted case and 1 + 1/e when one orientation consists of lines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c31ff41486780d14e61ae45da56ea8860db0f8ea942348c6edb38b60943860c4"},"source":{"id":"2605.14499","kind":"arxiv","version":1},"verdict":{"id":"e5f08f6d-769e-407b-bbd9-cc3bc666878e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:10:53.806777Z","strongest_claim":"We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a randomized (1+2/e)-approximation by combining systematic rounding on horizontal lines with an exact repair step on residual vertical sub-instances.","one_line_summary":"An LP-rounding algorithm yields a randomized (1 + 2/e)-approximation for weighted hitting set of axis-parallel segments, with a (1 + 1/(e-1)) bound in the unweighted case and 1 + 1/e when one orientation consists of lines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The LP relaxation admits an efficient solution whose fractional optimum is within a constant factor of the integral optimum, and that the rounding analysis holds without additional assumptions on point or segment positions beyond axis-parallelism.","pith_extraction_headline":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier."},"references":{"count":34,"sample":[{"doi":"","year":2019,"title":"Approximationschemesforindependent set and sparse subsets of polygons.Journal of the ACM, 66(4):29:1–29:40, 2019","work_id":"8b2999d8-49e2-4601-9e26-22ea57dc1177","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"A non-linear lower bound for planar epsilon-nets.Discret","work_id":"20aecde9-b3dd-4ed4-ab34-20b83222306b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Small-sizeϵ-nets for axis-parallel rectangles and boxes.SIAM J","work_id":"a59230f4-3ca2-4e4e-a022-8ecfd1ebaa06","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Katz, Gila Morgenstern, and Yelena Yuditsky","work_id":"c3afed10-afbc-4cf1-b508-a02ae7220bd0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"On the number of points in general position in the plane","work_id":"2db04dd3-3eac-4738-a324-652cf1cdb30b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":34,"snapshot_sha256":"23ef8044d10a4bf6980b7cd5e290253318e2b863e5089860bdc20e4d45b55b9e","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":"2605.14499","created_at":"2026-05-17T23:39:06.337275+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14499v1","created_at":"2026-05-17T23:39:06.337275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14499","created_at":"2026-05-17T23:39:06.337275+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRLTCAO7TUIE","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRLTCAO7TUIEWYCP","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRLTCAO7","created_at":"2026-05-18T12:33:37.589309+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/ZRLTCAO7TUIEWYCPYB43YRQ2PY","json":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY.json","graph_json":"https://pith.science/api/pith-number/ZRLTCAO7TUIEWYCPYB43YRQ2PY/graph.json","events_json":"https://pith.science/api/pith-number/ZRLTCAO7TUIEWYCPYB43YRQ2PY/events.json","paper":"https://pith.science/paper/ZRLTCAO7"},"agent_actions":{"view_html":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY","download_json":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY.json","view_paper":"https://pith.science/paper/ZRLTCAO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14499&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRLTCAO7TUIEWYCPYB43YRQ2PY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRLTCAO7TUIEWYCPYB43YRQ2PY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/action/storage_attestation","attest_author":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/action/author_attestation","sign_citation":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/action/citation_signature","submit_replication":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/action/replication_record"}},"created_at":"2026-05-17T23:39:06.337275+00:00","updated_at":"2026-05-17T23:39:06.337275+00:00"}