{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QYKGZ7FNDBMKYOA5DUTOCBB537","short_pith_number":"pith:QYKGZ7FN","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"},"canonical_sha256":"86146cfcad1858ac381d1d26e1043ddffa858cd2a96279472797b2f77942959a","source":{"kind":"arxiv","id":"1809.09979","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09979","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09979v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09979","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"QYKGZ7FNDBMK","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QYKGZ7FNDBMKYOA5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QYKGZ7FN","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QYKGZ7FNDBMKYOA5DUTOCBB537","target":"record","payload":{"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"},"canonical_sha256":"86146cfcad1858ac381d1d26e1043ddffa858cd2a96279472797b2f77942959a","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"},"source_kind":"arxiv","source_id":"1809.09979","source_version":1,"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-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDU6MIu4tBhZ7284IyQQV7dSceYCAoXgTiXUzJv7WE25xMr/rHByyN/45CgMgX2zZI6fdl4CAA1R3IGY1HwTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:38:24.107366Z"},"content_sha256":"12b14a6f544ee602c48e53e45214b390758fff0ad7bd22e34d3c9f16ede60156","schema_version":"1.0","event_id":"sha256:12b14a6f544ee602c48e53e45214b390758fff0ad7bd22e34d3c9f16ede60156"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QYKGZ7FNDBMKYOA5DUTOCBB537","target":"graph","payload":{"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"},"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-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JT8amXTNfq5usUiTiP9eH4SUOgmAbiELkoN+u3W0c1SClNGQJ0jPdwJibdRwfS+CmOGRhKPZzf4Azr267jE/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:38:24.107721Z"},"content_sha256":"8a3e18e2184812cd305a046756f9af0cc99a421a127a45c6d202fb352487f102","schema_version":"1.0","event_id":"sha256:8a3e18e2184812cd305a046756f9af0cc99a421a127a45c6d202fb352487f102"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/bundle.json","state_url":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/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-04T12:38:24Z","links":{"resolver":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537","bundle":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/bundle.json","state":"https://pith.science/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYKGZ7FNDBMKYOA5DUTOCBB537/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QYKGZ7FNDBMKYOA5DUTOCBB537","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":"ca5836ece793a0d332af4e5a198a250944876f336627179f9615c47460373ea1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-26T13:33:45Z","title_canon_sha256":"5b133386d545567b98f1e1ce04526bdac48c4544897a8d7bc53330f196b8e56e"},"schema_version":"1.0","source":{"id":"1809.09979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09979","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09979v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09979","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"QYKGZ7FNDBMK","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QYKGZ7FNDBMKYOA5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QYKGZ7FN","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:8a3e18e2184812cd305a046756f9af0cc99a421a127a45c6d202fb352487f102","target":"graph","created_at":"2026-05-18T00:04:43Z","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":"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","authors_text":"Anil Maheshwari, Lu\\'is Fernando Schultz Xavier da Silveira, Paz Carmi, Saeed Mehrabi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-26T13:33:45Z","title":"Approximability of Covering Cells with Line Segments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09979","kind":"arxiv","version":1},"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:12b14a6f544ee602c48e53e45214b390758fff0ad7bd22e34d3c9f16ede60156","target":"record","created_at":"2026-05-18T00:04:43Z","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":"ca5836ece793a0d332af4e5a198a250944876f336627179f9615c47460373ea1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-26T13:33:45Z","title_canon_sha256":"5b133386d545567b98f1e1ce04526bdac48c4544897a8d7bc53330f196b8e56e"},"schema_version":"1.0","source":{"id":"1809.09979","kind":"arxiv","version":1}},"canonical_sha256":"86146cfcad1858ac381d1d26e1043ddffa858cd2a96279472797b2f77942959a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86146cfcad1858ac381d1d26e1043ddffa858cd2a96279472797b2f77942959a","first_computed_at":"2026-05-18T00:04:43.083148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:43.083148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zlPMU3OBfALP70Z2B9EPL7bd8zN/rkopR4e4MXucbXs+mRchqdlc1GYkeUXpFDnd0vpiRY+0qZdmoXiWFX7EAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:43.083836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12b14a6f544ee602c48e53e45214b390758fff0ad7bd22e34d3c9f16ede60156","sha256:8a3e18e2184812cd305a046756f9af0cc99a421a127a45c6d202fb352487f102"],"state_sha256":"08985cf3cb2658d4c169c43c11d32662890bb266fd3fda54ff4a0cb6d625c77c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"glrtQyFrecy5UGvFvc6xp+6Yy5pi6mRgDU0ye/Y+0te6nXGmV2FudcfpU9qIiuE7hXHn2gPjG+fQhP1NSQ47Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:38:24.109653Z","bundle_sha256":"ddaf04616c8fc9e9161f9840e86ebd4cf58ee34abc79140f3434fad060cdba91"}}