{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IW4NEGDGTGQCVHJCA36TPMR5SK","short_pith_number":"pith:IW4NEGDG","schema_version":"1.0","canonical_sha256":"45b8d2186699a02a9d2206fd37b23d92853072a30b1240561ab0d1771aedce72","source":{"kind":"arxiv","id":"1904.13369","version":2},"attestation_state":"computed","paper":{"title":"Constrained Orthogonal Segment Stabbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi, Sayan Bandyapadhyay","submitted_at":"2019-04-30T17:04:08Z","abstract_excerpt":"Let $S$ and $D$ each be a set of orthogonal line segments in the plane. A line segment $s\\in S$ \\emph{stabs} a line segment $s'\\in D$ if $s\\cap s'\\neq\\emptyset$. It is known that the problem of stabbing the line segments in $D$ with the minimum number of line segments of $S$ is NP-hard. However, no better than $O(\\log |S\\cup D|)$-approximation is known for the problem. In this paper, we introduce a constrained version of this problem in which every horizontal line segment of $S\\cup D$ intersects a common vertical line. We study several versions of the problem, depending on which line segments "},"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":"1904.13369","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-30T17:04:08Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"7a0a2e4ed35aa8c0628d8ab43126355bb935f1a8763bc6db1b7829324394892d","abstract_canon_sha256":"dfe7c8c13c562df578eb7fdb979fc33a9b5d6b06bde4b01162c86910b07fd874"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:41.724869Z","signature_b64":"A+xQSTjF008LXs1eHYHsmMRgvhhzfJm6ICBWl9T7b3q8Niv3PvscsZL7LsE1Du439jpxYA1fR92DE6hu9xryAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45b8d2186699a02a9d2206fd37b23d92853072a30b1240561ab0d1771aedce72","last_reissued_at":"2026-05-17T23:42:41.724223Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:41.724223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Orthogonal Segment Stabbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi, Sayan Bandyapadhyay","submitted_at":"2019-04-30T17:04:08Z","abstract_excerpt":"Let $S$ and $D$ each be a set of orthogonal line segments in the plane. A line segment $s\\in S$ \\emph{stabs} a line segment $s'\\in D$ if $s\\cap s'\\neq\\emptyset$. It is known that the problem of stabbing the line segments in $D$ with the minimum number of line segments of $S$ is NP-hard. However, no better than $O(\\log |S\\cup D|)$-approximation is known for the problem. In this paper, we introduce a constrained version of this problem in which every horizontal line segment of $S\\cup D$ intersects a common vertical line. We study several versions of the problem, depending on which line segments "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.13369","kind":"arxiv","version":2},"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":"1904.13369","created_at":"2026-05-17T23:42:41.724327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.13369v2","created_at":"2026-05-17T23:42:41.724327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.13369","created_at":"2026-05-17T23:42:41.724327+00:00"},{"alias_kind":"pith_short_12","alias_value":"IW4NEGDGTGQC","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IW4NEGDGTGQCVHJC","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IW4NEGDG","created_at":"2026-05-18T12:33:18.533446+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/IW4NEGDGTGQCVHJCA36TPMR5SK","json":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK.json","graph_json":"https://pith.science/api/pith-number/IW4NEGDGTGQCVHJCA36TPMR5SK/graph.json","events_json":"https://pith.science/api/pith-number/IW4NEGDGTGQCVHJCA36TPMR5SK/events.json","paper":"https://pith.science/paper/IW4NEGDG"},"agent_actions":{"view_html":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK","download_json":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK.json","view_paper":"https://pith.science/paper/IW4NEGDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.13369&json=true","fetch_graph":"https://pith.science/api/pith-number/IW4NEGDGTGQCVHJCA36TPMR5SK/graph.json","fetch_events":"https://pith.science/api/pith-number/IW4NEGDGTGQCVHJCA36TPMR5SK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/action/storage_attestation","attest_author":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/action/author_attestation","sign_citation":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/action/citation_signature","submit_replication":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/action/replication_record"}},"created_at":"2026-05-17T23:42:41.724327+00:00","updated_at":"2026-05-17T23:42:41.724327+00:00"}