{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NQG53LCO5L6KEURGEVIWH4OGLL","short_pith_number":"pith:NQG53LCO","schema_version":"1.0","canonical_sha256":"6c0dddac4eeafca25226255163f1c65af4d4e688f3cae011f5eb0fdb9be6915d","source":{"kind":"arxiv","id":"1210.8139","version":1},"attestation_state":"computed","paper":{"title":"Minimum Opaque Covers for Polygonal Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Doreen Thomas, Jia F. Weng, J. Scott Provan, Marcus Brazil","submitted_at":"2012-10-30T19:52:37Z","abstract_excerpt":"The Opaque Cover Problem (OCP), also known as the Beam Detector Problem, is the problem of finding, for a set S in Euclidean space, the minimum-length set F which intersects every straight line passing through S. In spite of its simplicity, the problem remains remarkably intractable. The aim of this paper is to establish a framework and fundamental results for minimum opaque covers where S is a polygonal region in two-dimensional space. We begin by giving some general results about opaque covers, and describe the close connection that the OCP has with the Point Goalie Problem. We then consider"},"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":"1210.8139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-10-30T19:52:37Z","cross_cats_sorted":[],"title_canon_sha256":"970db8ebd176e67968c86a3c9b27a7903ba5d131476f26ed4c45adc7df22ea03","abstract_canon_sha256":"0651216f98060845778d9af4d6c3d48c4ad3d3aec38fe3e3c52edf331f721e8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:56.924645Z","signature_b64":"lG2Tx+Abve85RU5LEe/geG7INpoZOR5zAHAOWhOR704uTX+Uu8pUAI78pl0NFJEnC+HhPdh9LhbwWL5S7MlaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c0dddac4eeafca25226255163f1c65af4d4e688f3cae011f5eb0fdb9be6915d","last_reissued_at":"2026-05-18T03:41:56.923914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:56.923914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Opaque Covers for Polygonal Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Doreen Thomas, Jia F. Weng, J. Scott Provan, Marcus Brazil","submitted_at":"2012-10-30T19:52:37Z","abstract_excerpt":"The Opaque Cover Problem (OCP), also known as the Beam Detector Problem, is the problem of finding, for a set S in Euclidean space, the minimum-length set F which intersects every straight line passing through S. In spite of its simplicity, the problem remains remarkably intractable. The aim of this paper is to establish a framework and fundamental results for minimum opaque covers where S is a polygonal region in two-dimensional space. We begin by giving some general results about opaque covers, and describe the close connection that the OCP has with the Point Goalie Problem. We then consider"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8139","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":"1210.8139","created_at":"2026-05-18T03:41:56.924034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8139v1","created_at":"2026-05-18T03:41:56.924034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8139","created_at":"2026-05-18T03:41:56.924034+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQG53LCO5L6K","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQG53LCO5L6KEURG","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQG53LCO","created_at":"2026-05-18T12:27:16.716162+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/NQG53LCO5L6KEURGEVIWH4OGLL","json":"https://pith.science/pith/NQG53LCO5L6KEURGEVIWH4OGLL.json","graph_json":"https://pith.science/api/pith-number/NQG53LCO5L6KEURGEVIWH4OGLL/graph.json","events_json":"https://pith.science/api/pith-number/NQG53LCO5L6KEURGEVIWH4OGLL/events.json","paper":"https://pith.science/paper/NQG53LCO"},"agent_actions":{"view_html":"https://pith.science/pith/NQG53LCO5L6KEURGEVIWH4OGLL","download_json":"https://pith.science/pith/NQG53LCO5L6KEURGEVIWH4OGLL.json","view_paper":"https://pith.science/paper/NQG53LCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8139&json=true","fetch_graph":"https://pith.science/api/pith-number/NQG53LCO5L6KEURGEVIWH4OGLL/graph.json","fetch_events":"https://pith.science/api/pith-number/NQG53LCO5L6KEURGEVIWH4OGLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQG53LCO5L6KEURGEVIWH4OGLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQG53LCO5L6KEURGEVIWH4OGLL/action/storage_attestation","attest_author":"https://pith.science/pith/NQG53LCO5L6KEURGEVIWH4OGLL/action/author_attestation","sign_citation":"https://pith.science/pith/NQG53LCO5L6KEURGEVIWH4OGLL/action/citation_signature","submit_replication":"https://pith.science/pith/NQG53LCO5L6KEURGEVIWH4OGLL/action/replication_record"}},"created_at":"2026-05-18T03:41:56.924034+00:00","updated_at":"2026-05-18T03:41:56.924034+00:00"}