{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IW4NEGDGTGQCVHJCA36TPMR5SK","short_pith_number":"pith:IW4NEGDG","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"},"canonical_sha256":"45b8d2186699a02a9d2206fd37b23d92853072a30b1240561ab0d1771aedce72","source":{"kind":"arxiv","id":"1904.13369","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.13369","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"arxiv_version","alias_value":"1904.13369v2","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.13369","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"pith_short_12","alias_value":"IW4NEGDGTGQC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IW4NEGDGTGQCVHJC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IW4NEGDG","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IW4NEGDGTGQCVHJCA36TPMR5SK","target":"record","payload":{"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"},"canonical_sha256":"45b8d2186699a02a9d2206fd37b23d92853072a30b1240561ab0d1771aedce72","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"},"source_kind":"arxiv","source_id":"1904.13369","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3cDOGapAsJAedw/86tVyASxjv7T5xFQm+nNMqDKlUMbG8CDqDFgpbv/RHkzW1IuzUEhnBZFKkcp6JyKsMBmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:10:42.209359Z"},"content_sha256":"5fd4dd811460a85073dc1576da69586fb82d4100665ab8b6416338eda38a8de6","schema_version":"1.0","event_id":"sha256:5fd4dd811460a85073dc1576da69586fb82d4100665ab8b6416338eda38a8de6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IW4NEGDGTGQCVHJCA36TPMR5SK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCs+5uZSexZseXMHl32lnfKdoSFkE3eMK5J2N1kkLViOE6gzoYvLJc4WfxFoikrlOkzgolRHSTslRcAd2272Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:10:42.209713Z"},"content_sha256":"7fcaab49823d8be414a3849292b20137b95efe673c533a5e9d9b0b2a8947a07f","schema_version":"1.0","event_id":"sha256:7fcaab49823d8be414a3849292b20137b95efe673c533a5e9d9b0b2a8947a07f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/bundle.json","state_url":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T22:10:42Z","links":{"resolver":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK","bundle":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/bundle.json","state":"https://pith.science/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IW4NEGDGTGQCVHJCA36TPMR5SK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IW4NEGDGTGQCVHJCA36TPMR5SK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dfe7c8c13c562df578eb7fdb979fc33a9b5d6b06bde4b01162c86910b07fd874","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-30T17:04:08Z","title_canon_sha256":"7a0a2e4ed35aa8c0628d8ab43126355bb935f1a8763bc6db1b7829324394892d"},"schema_version":"1.0","source":{"id":"1904.13369","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.13369","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"arxiv_version","alias_value":"1904.13369v2","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.13369","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"pith_short_12","alias_value":"IW4NEGDGTGQC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IW4NEGDGTGQCVHJC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IW4NEGDG","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:7fcaab49823d8be414a3849292b20137b95efe673c533a5e9d9b0b2a8947a07f","target":"graph","created_at":"2026-05-17T23:42:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Saeed Mehrabi, Sayan Bandyapadhyay","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-30T17:04:08Z","title":"Constrained Orthogonal Segment Stabbing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.13369","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5fd4dd811460a85073dc1576da69586fb82d4100665ab8b6416338eda38a8de6","target":"record","created_at":"2026-05-17T23:42:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dfe7c8c13c562df578eb7fdb979fc33a9b5d6b06bde4b01162c86910b07fd874","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-30T17:04:08Z","title_canon_sha256":"7a0a2e4ed35aa8c0628d8ab43126355bb935f1a8763bc6db1b7829324394892d"},"schema_version":"1.0","source":{"id":"1904.13369","kind":"arxiv","version":2}},"canonical_sha256":"45b8d2186699a02a9d2206fd37b23d92853072a30b1240561ab0d1771aedce72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45b8d2186699a02a9d2206fd37b23d92853072a30b1240561ab0d1771aedce72","first_computed_at":"2026-05-17T23:42:41.724223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:41.724223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A+xQSTjF008LXs1eHYHsmMRgvhhzfJm6ICBWl9T7b3q8Niv3PvscsZL7LsE1Du439jpxYA1fR92DE6hu9xryAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:41.724869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.13369","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fd4dd811460a85073dc1576da69586fb82d4100665ab8b6416338eda38a8de6","sha256:7fcaab49823d8be414a3849292b20137b95efe673c533a5e9d9b0b2a8947a07f"],"state_sha256":"7fa37f052e871b3c926702092c34c6fe8ec62154b7f04555fd8278dd772e9750"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTfa06Fku1ZtlQLwuYyZtvMhNp8X0UeIQvG4M6ebsfPzsHbDQxdGLJ9ZPzuvGj0h7KRAFPuU6y5jqG4XGxP+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:10:42.211705Z","bundle_sha256":"e99c2b2cc567730fff1c06c2779054a92f93e80f97a981bbff548594feeb6f01"}}