{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QL26ZDLNSTXIK3H5OEMVMKMEEW","short_pith_number":"pith:QL26ZDLN","schema_version":"1.0","canonical_sha256":"82f5ec8d6d94ee856cfd711956298425b6178ad4055a918dcc37460702e30286","source":{"kind":"arxiv","id":"1806.02851","version":1},"attestation_state":"computed","paper":{"title":"Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Joachim Spoerhase, Krzysztof Fleszar, Thomas C. van Dijk, Timothy M. Chan","submitted_at":"2018-06-07T18:20:53Z","abstract_excerpt":"We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizontal line segments of minimum total length so that every rectangle is stabbed by some line segment. A line segment stabs a rectangle if it intersects its left and its right boundary. The problem, which we call Stabbing, can be motivated by a resource allocation problem and has applications in geometric network design. To the best of our knowledge, only special cases of this problem have been considered so far.\n  Stabb"},"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":"1806.02851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-06-07T18:20:53Z","cross_cats_sorted":[],"title_canon_sha256":"121de2a1b339eef6723d0de712ffe68de81c08eaf084b03df4fa021c6e876f6c","abstract_canon_sha256":"87cb844fa13c30a9ea504998e34d4426aa6fcc887f00575da3612a977235f758"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:54.622117Z","signature_b64":"M18f1p/Q60AwSUpMUXR2DUAqfKSFgofLvu+IX1eJyN2+b4pYPbxTAPV20jd6S5MvJwYByAWQ1nqPJTHspc/sAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82f5ec8d6d94ee856cfd711956298425b6178ad4055a918dcc37460702e30286","last_reissued_at":"2026-05-18T00:13:54.621301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:54.621301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Joachim Spoerhase, Krzysztof Fleszar, Thomas C. van Dijk, Timothy M. Chan","submitted_at":"2018-06-07T18:20:53Z","abstract_excerpt":"We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizontal line segments of minimum total length so that every rectangle is stabbed by some line segment. A line segment stabs a rectangle if it intersects its left and its right boundary. The problem, which we call Stabbing, can be motivated by a resource allocation problem and has applications in geometric network design. To the best of our knowledge, only special cases of this problem have been considered so far.\n  Stabb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02851","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":"1806.02851","created_at":"2026-05-18T00:13:54.621415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02851v1","created_at":"2026-05-18T00:13:54.621415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02851","created_at":"2026-05-18T00:13:54.621415+00:00"},{"alias_kind":"pith_short_12","alias_value":"QL26ZDLNSTXI","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QL26ZDLNSTXIK3H5","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QL26ZDLN","created_at":"2026-05-18T12:32:46.962924+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/QL26ZDLNSTXIK3H5OEMVMKMEEW","json":"https://pith.science/pith/QL26ZDLNSTXIK3H5OEMVMKMEEW.json","graph_json":"https://pith.science/api/pith-number/QL26ZDLNSTXIK3H5OEMVMKMEEW/graph.json","events_json":"https://pith.science/api/pith-number/QL26ZDLNSTXIK3H5OEMVMKMEEW/events.json","paper":"https://pith.science/paper/QL26ZDLN"},"agent_actions":{"view_html":"https://pith.science/pith/QL26ZDLNSTXIK3H5OEMVMKMEEW","download_json":"https://pith.science/pith/QL26ZDLNSTXIK3H5OEMVMKMEEW.json","view_paper":"https://pith.science/paper/QL26ZDLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02851&json=true","fetch_graph":"https://pith.science/api/pith-number/QL26ZDLNSTXIK3H5OEMVMKMEEW/graph.json","fetch_events":"https://pith.science/api/pith-number/QL26ZDLNSTXIK3H5OEMVMKMEEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QL26ZDLNSTXIK3H5OEMVMKMEEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QL26ZDLNSTXIK3H5OEMVMKMEEW/action/storage_attestation","attest_author":"https://pith.science/pith/QL26ZDLNSTXIK3H5OEMVMKMEEW/action/author_attestation","sign_citation":"https://pith.science/pith/QL26ZDLNSTXIK3H5OEMVMKMEEW/action/citation_signature","submit_replication":"https://pith.science/pith/QL26ZDLNSTXIK3H5OEMVMKMEEW/action/replication_record"}},"created_at":"2026-05-18T00:13:54.621415+00:00","updated_at":"2026-05-18T00:13:54.621415+00:00"}