{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QYKGZ7FNDBMKYOA5DUTOCBB537","short_pith_number":"pith:QYKGZ7FN","schema_version":"1.0","canonical_sha256":"86146cfcad1858ac381d1d26e1043ddffa858cd2a96279472797b2f77942959a","source":{"kind":"arxiv","id":"1809.09979","version":1},"attestation_state":"computed","paper":{"title":"Approximability of Covering Cells with Line Segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Lu\\'is Fernando Schultz Xavier da Silveira, Paz Carmi, Saeed Mehrabi","submitted_at":"2018-09-26T13:33:45Z","abstract_excerpt":"In COCOA 2015, Korman et al. studied the following geometric covering problem: given a set $S$ of $n$ line segments in the plane, find a minimum number of line segments such that every cell in the arrangement of the line segments is covered. Here, a line segment $s$ covers a cell $f$ if $s$ is incident to $f$. The problem was shown to be NP-hard, even if the line segments in $S$ are axis-parallel, and it remains NP-hard when the goal is cover the \"rectangular\" cells (i.e., cells that are defined by exactly four axis-parallel line segments).\n  In this paper, we consider the approximability of t"},"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.09979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-26T13:33:45Z","cross_cats_sorted":[],"title_canon_sha256":"5b133386d545567b98f1e1ce04526bdac48c4544897a8d7bc53330f196b8e56e","abstract_canon_sha256":"ca5836ece793a0d332af4e5a198a250944876f336627179f9615c47460373ea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.083836Z","signature_b64":"zlPMU3OBfALP70Z2B9EPL7bd8zN/rkopR4e4MXucbXs+mRchqdlc1GYkeUXpFDnd0vpiRY+0qZdmoXiWFX7EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86146cfcad1858ac381d1d26e1043ddffa858cd2a96279472797b2f77942959a","last_reissued_at":"2026-05-18T00:04:43.083148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.083148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximability of Covering Cells with Line Segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Lu\\'is Fernando Schultz Xavier da Silveira, Paz Carmi, Saeed Mehrabi","submitted_at":"2018-09-26T13:33:45Z","abstract_excerpt":"In COCOA 2015, Korman et al. studied the following geometric covering problem: given a set $S$ of $n$ line segments in the plane, find a minimum number of line segments such that every cell in the arrangement of the line segments is covered. Here, a line segment $s$ covers a cell $f$ if $s$ is incident to $f$. The problem was shown to be NP-hard, even if the line segments in $S$ are axis-parallel, and it remains NP-hard when the goal is cover the \"rectangular\" cells (i.e., cells that are defined by exactly four axis-parallel line segments).\n  In this paper, we consider the approximability of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09979","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.09979","created_at":"2026-05-18T00:04:43.083236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09979v1","created_at":"2026-05-18T00:04:43.083236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09979","created_at":"2026-05-18T00:04:43.083236+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYKGZ7FNDBMK","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYKGZ7FNDBMKYOA5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYKGZ7FN","created_at":"2026-05-18T12:32:50.500415+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/QYKGZ7FNDBMKYOA5DUTOCBB537","json":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537.json","graph_json":"https://pith.science/api/pith-number/QYKGZ7FNDBMKYOA5DUTOCBB537/graph.json","events_json":"https://pith.science/api/pith-number/QYKGZ7FNDBMKYOA5DUTOCBB537/events.json","paper":"https://pith.science/paper/QYKGZ7FN"},"agent_actions":{"view_html":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537","download_json":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537.json","view_paper":"https://pith.science/paper/QYKGZ7FN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09979&json=true","fetch_graph":"https://pith.science/api/pith-number/QYKGZ7FNDBMKYOA5DUTOCBB537/graph.json","fetch_events":"https://pith.science/api/pith-number/QYKGZ7FNDBMKYOA5DUTOCBB537/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/action/storage_attestation","attest_author":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/action/author_attestation","sign_citation":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/action/citation_signature","submit_replication":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/action/replication_record"}},"created_at":"2026-05-18T00:04:43.083236+00:00","updated_at":"2026-05-18T00:04:43.083236+00:00"}