{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OREIQ76QBRMDNYM4DUDY7D4P4V","short_pith_number":"pith:OREIQ76Q","schema_version":"1.0","canonical_sha256":"7448887fd00c5836e19c1d078f8f8fe55938b5e9df7ae9366595f5741c453920","source":{"kind":"arxiv","id":"1803.05946","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Algorithm to Compute the Inverse Beacon Attraction Region","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bahram Kouhestani, David Rappaport, Irina Kostitsyna, Stefan Langerman","submitted_at":"2018-03-15T18:56:31Z","abstract_excerpt":"The beacon model is a recent paradigm for guiding the trajectory of messages or small robotic agents in complex environments. A beacon is a fixed point with an attraction pull that can move points within a given polygon. Points move greedily towards a beacon: if unobstructed, they move along a straight line to the beacon, and otherwise they slide on the edges of the polygon. The Euclidean distance from a moving point to a beacon is monotonically decreasing. A given beacon attracts a point if the point eventually reaches the beacon.\n  The problem of attracting all points within a polygon with a"},"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":"1803.05946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T18:56:31Z","cross_cats_sorted":[],"title_canon_sha256":"f566ea843c703e51e8a8c6821e66ae914f2cd3f6360f35f74653404d764d5fd0","abstract_canon_sha256":"72fb4fdef66625fb5a3be145249c1ad01af157ca094c4a6aca1a362ba1c64de0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:51.307056Z","signature_b64":"4hiNXv6j1uAtIJbgWKqYWnJv5kxVhB/GL//w+5GzjIfLhRfQ940JkD7udkSDqXVAP2dzwHqn/oYT89m8J7lpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7448887fd00c5836e19c1d078f8f8fe55938b5e9df7ae9366595f5741c453920","last_reissued_at":"2026-05-18T00:20:51.306200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:51.306200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Algorithm to Compute the Inverse Beacon Attraction Region","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bahram Kouhestani, David Rappaport, Irina Kostitsyna, Stefan Langerman","submitted_at":"2018-03-15T18:56:31Z","abstract_excerpt":"The beacon model is a recent paradigm for guiding the trajectory of messages or small robotic agents in complex environments. A beacon is a fixed point with an attraction pull that can move points within a given polygon. Points move greedily towards a beacon: if unobstructed, they move along a straight line to the beacon, and otherwise they slide on the edges of the polygon. The Euclidean distance from a moving point to a beacon is monotonically decreasing. A given beacon attracts a point if the point eventually reaches the beacon.\n  The problem of attracting all points within a polygon with a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05946","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":"1803.05946","created_at":"2026-05-18T00:20:51.306346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05946v1","created_at":"2026-05-18T00:20:51.306346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05946","created_at":"2026-05-18T00:20:51.306346+00:00"},{"alias_kind":"pith_short_12","alias_value":"OREIQ76QBRMD","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OREIQ76QBRMDNYM4","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OREIQ76Q","created_at":"2026-05-18T12:32:43.782077+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/OREIQ76QBRMDNYM4DUDY7D4P4V","json":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V.json","graph_json":"https://pith.science/api/pith-number/OREIQ76QBRMDNYM4DUDY7D4P4V/graph.json","events_json":"https://pith.science/api/pith-number/OREIQ76QBRMDNYM4DUDY7D4P4V/events.json","paper":"https://pith.science/paper/OREIQ76Q"},"agent_actions":{"view_html":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V","download_json":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V.json","view_paper":"https://pith.science/paper/OREIQ76Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05946&json=true","fetch_graph":"https://pith.science/api/pith-number/OREIQ76QBRMDNYM4DUDY7D4P4V/graph.json","fetch_events":"https://pith.science/api/pith-number/OREIQ76QBRMDNYM4DUDY7D4P4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/action/storage_attestation","attest_author":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/action/author_attestation","sign_citation":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/action/citation_signature","submit_replication":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/action/replication_record"}},"created_at":"2026-05-18T00:20:51.306346+00:00","updated_at":"2026-05-18T00:20:51.306346+00:00"}