{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NFEKEBBIGFVRBUWLXRLFF2UNU4","short_pith_number":"pith:NFEKEBBI","schema_version":"1.0","canonical_sha256":"6948a20428316b10d2cbbc5652ea8da732e18a07b38804a5fb0cce30dc8dddaa","source":{"kind":"arxiv","id":"1706.06938","version":2},"attestation_state":"computed","paper":{"title":"Art Gallery Localization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alina Shaikhet, Jean-Lou De Carufel, Michiel Smid, Prosenjit Bose","submitted_at":"2017-06-21T14:46:53Z","abstract_excerpt":"We study the problem of placing a set $T$ of broadcast towers in a simple polygon $P$ in order for any point to locate itself in the interior of $P$. Let $V(p)$ denote the visibility polygon of a point $p$, as the set of all points $q \\in P$ that are visible to $p$. For any point $p \\in P$: for each tower $t \\in T \\cap V(p)$ the point $p$ receives the coordinates of $t$ and the Euclidean distance between $t$ and $p$. From this information $p$ can determine its coordinates. We show a tower-positioning algorithm that computes such a set $T$ of size at most $\\lfloor 2n/3\\rfloor$, where $n$ is the"},"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":"1706.06938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-21T14:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"f212c485e1b6484a474133118680ccceef11c85da4de58e66e6db650f378badc","abstract_canon_sha256":"71e4ccba7db9cad9c6455a980552b5d316e99e79c25c9a0c9d187f1391ec3908"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:39.676134Z","signature_b64":"VQqb9aNsSeVjwcD1sFXj8l9I3QZckDNqOPlOCo+eFCbknttWK1vtNr4C9oR2DdqqINWIY8+kYxmMseNrMzhxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6948a20428316b10d2cbbc5652ea8da732e18a07b38804a5fb0cce30dc8dddaa","last_reissued_at":"2026-05-17T23:59:39.675446Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:39.675446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Art Gallery Localization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alina Shaikhet, Jean-Lou De Carufel, Michiel Smid, Prosenjit Bose","submitted_at":"2017-06-21T14:46:53Z","abstract_excerpt":"We study the problem of placing a set $T$ of broadcast towers in a simple polygon $P$ in order for any point to locate itself in the interior of $P$. Let $V(p)$ denote the visibility polygon of a point $p$, as the set of all points $q \\in P$ that are visible to $p$. For any point $p \\in P$: for each tower $t \\in T \\cap V(p)$ the point $p$ receives the coordinates of $t$ and the Euclidean distance between $t$ and $p$. From this information $p$ can determine its coordinates. We show a tower-positioning algorithm that computes such a set $T$ of size at most $\\lfloor 2n/3\\rfloor$, where $n$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06938","kind":"arxiv","version":2},"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":"1706.06938","created_at":"2026-05-17T23:59:39.675562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06938v2","created_at":"2026-05-17T23:59:39.675562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06938","created_at":"2026-05-17T23:59:39.675562+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFEKEBBIGFVR","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFEKEBBIGFVRBUWL","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFEKEBBI","created_at":"2026-05-18T12:31:31.346846+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/NFEKEBBIGFVRBUWLXRLFF2UNU4","json":"https://pith.science/pith/NFEKEBBIGFVRBUWLXRLFF2UNU4.json","graph_json":"https://pith.science/api/pith-number/NFEKEBBIGFVRBUWLXRLFF2UNU4/graph.json","events_json":"https://pith.science/api/pith-number/NFEKEBBIGFVRBUWLXRLFF2UNU4/events.json","paper":"https://pith.science/paper/NFEKEBBI"},"agent_actions":{"view_html":"https://pith.science/pith/NFEKEBBIGFVRBUWLXRLFF2UNU4","download_json":"https://pith.science/pith/NFEKEBBIGFVRBUWLXRLFF2UNU4.json","view_paper":"https://pith.science/paper/NFEKEBBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06938&json=true","fetch_graph":"https://pith.science/api/pith-number/NFEKEBBIGFVRBUWLXRLFF2UNU4/graph.json","fetch_events":"https://pith.science/api/pith-number/NFEKEBBIGFVRBUWLXRLFF2UNU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFEKEBBIGFVRBUWLXRLFF2UNU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFEKEBBIGFVRBUWLXRLFF2UNU4/action/storage_attestation","attest_author":"https://pith.science/pith/NFEKEBBIGFVRBUWLXRLFF2UNU4/action/author_attestation","sign_citation":"https://pith.science/pith/NFEKEBBIGFVRBUWLXRLFF2UNU4/action/citation_signature","submit_replication":"https://pith.science/pith/NFEKEBBIGFVRBUWLXRLFF2UNU4/action/replication_record"}},"created_at":"2026-05-17T23:59:39.675562+00:00","updated_at":"2026-05-17T23:59:39.675562+00:00"}