{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IHLOR77PMQ734XWZH3WKQCBTVI","short_pith_number":"pith:IHLOR77P","schema_version":"1.0","canonical_sha256":"41d6e8ffef643fbe5ed93eeca80833aa1b4c5fa3b92439719b058aa559582469","source":{"kind":"arxiv","id":"1809.10078","version":1},"attestation_state":"computed","paper":{"title":"Convex partial transversals of planar regions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Irina Kostitsyna, J\\'er\\^ome Urhausen, Jordi L. Vermeulen, Lionov Wiratma, Maarten L\\\"offler, Marc van Kreveld, Mees van de Kerkhof, Vahideh Keikha","submitted_at":"2018-09-26T15:50:00Z","abstract_excerpt":"We consider the problem of testing, for a given set of planar regions $\\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\\cal R$. We provide a polynomial time algorithm for the case where the regions are disjoint line segments with a constant number of orientations. On the other hand, we show that the problem is NP-hard when the regions are intersecting axis-aligned rectangles or 3-oriented line segments. For several natural intermediate classes of shapes (arbitrary disjoint segments, intersecting 2-oriented segments) the problem"},"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":"1809.10078","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2018-09-26T15:50:00Z","cross_cats_sorted":[],"title_canon_sha256":"d9c0772a4ba6dd5802f49130899468ba71b9f97d3cc64ef5baddc172a8fe1188","abstract_canon_sha256":"a6bb90633d4eeaf96858b6795880b56467ce95df317927292a4ccf465c460aeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:42.649384Z","signature_b64":"95Aqf/u+tXeaFJKYXneg2RgT3PhveRCswu7KIEEDtwqch/sS0dAfKpqMLuUqk9qLsQ6U5OCxjhKQ14K2w4swDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41d6e8ffef643fbe5ed93eeca80833aa1b4c5fa3b92439719b058aa559582469","last_reissued_at":"2026-05-18T00:04:42.648821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:42.648821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex partial transversals of planar regions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Irina Kostitsyna, J\\'er\\^ome Urhausen, Jordi L. Vermeulen, Lionov Wiratma, Maarten L\\\"offler, Marc van Kreveld, Mees van de Kerkhof, Vahideh Keikha","submitted_at":"2018-09-26T15:50:00Z","abstract_excerpt":"We consider the problem of testing, for a given set of planar regions $\\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\\cal R$. We provide a polynomial time algorithm for the case where the regions are disjoint line segments with a constant number of orientations. On the other hand, we show that the problem is NP-hard when the regions are intersecting axis-aligned rectangles or 3-oriented line segments. For several natural intermediate classes of shapes (arbitrary disjoint segments, intersecting 2-oriented segments) the problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10078","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":"1809.10078","created_at":"2026-05-18T00:04:42.648908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10078v1","created_at":"2026-05-18T00:04:42.648908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10078","created_at":"2026-05-18T00:04:42.648908+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHLOR77PMQ73","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHLOR77PMQ734XWZ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHLOR77P","created_at":"2026-05-18T12:32:28.185984+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/IHLOR77PMQ734XWZH3WKQCBTVI","json":"https://pith.science/pith/IHLOR77PMQ734XWZH3WKQCBTVI.json","graph_json":"https://pith.science/api/pith-number/IHLOR77PMQ734XWZH3WKQCBTVI/graph.json","events_json":"https://pith.science/api/pith-number/IHLOR77PMQ734XWZH3WKQCBTVI/events.json","paper":"https://pith.science/paper/IHLOR77P"},"agent_actions":{"view_html":"https://pith.science/pith/IHLOR77PMQ734XWZH3WKQCBTVI","download_json":"https://pith.science/pith/IHLOR77PMQ734XWZH3WKQCBTVI.json","view_paper":"https://pith.science/paper/IHLOR77P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10078&json=true","fetch_graph":"https://pith.science/api/pith-number/IHLOR77PMQ734XWZH3WKQCBTVI/graph.json","fetch_events":"https://pith.science/api/pith-number/IHLOR77PMQ734XWZH3WKQCBTVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHLOR77PMQ734XWZH3WKQCBTVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHLOR77PMQ734XWZH3WKQCBTVI/action/storage_attestation","attest_author":"https://pith.science/pith/IHLOR77PMQ734XWZH3WKQCBTVI/action/author_attestation","sign_citation":"https://pith.science/pith/IHLOR77PMQ734XWZH3WKQCBTVI/action/citation_signature","submit_replication":"https://pith.science/pith/IHLOR77PMQ734XWZH3WKQCBTVI/action/replication_record"}},"created_at":"2026-05-18T00:04:42.648908+00:00","updated_at":"2026-05-18T00:04:42.648908+00:00"}