{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PESNSCRYZ4E3E2WV6VIQQMYXNE","short_pith_number":"pith:PESNSCRY","schema_version":"1.0","canonical_sha256":"7924d90a38cf09b26ad5f5510833176901d12a6c6ebc5272f2a4ae2fb930d3ae","source":{"kind":"arxiv","id":"1507.03509","version":1},"attestation_state":"computed","paper":{"title":"A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Thomas C. Shermer","submitted_at":"2015-07-13T16:20:32Z","abstract_excerpt":"Beacon attraction is a movement system whereby a robot (modeled as a point in 2D) moves in a free space so as to always locally minimize its Euclidean distance to an activated beacon (which is also a point). This results in the robot moving directly towards the beacon when it can, and otherwise sliding along the edge of an obstacle. When a robot can reach the activated beacon by this method, we say that the beacon attracts the robot. A beacon routing from $p$ to $q$ is a sequence $b_1, b_2,$ ..., $b_{k}$ of beacons such that activating the beacons in order will attract a robot from $p$ to $b_1"},"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":"1507.03509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-13T16:20:32Z","cross_cats_sorted":[],"title_canon_sha256":"10f36dbc6eb8fa9377b47384ebe121d8411c8944ec7acd045ba575f3ceb78e93","abstract_canon_sha256":"e275a917f9ad1d2955473d0403a9bde2b6a48aa2ac43e5d6d6403f1c3daf429a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:58.633249Z","signature_b64":"g5P//pTrGwQkEOkoL86l+xBlhTrklzq2TQnmjp3G24mENLdc1z1I1y7hwrZLRivNRdi4orjXTsTCT9RL04n7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7924d90a38cf09b26ad5f5510833176901d12a6c6ebc5272f2a4ae2fb930d3ae","last_reissued_at":"2026-05-18T01:36:58.632693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:58.632693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Thomas C. Shermer","submitted_at":"2015-07-13T16:20:32Z","abstract_excerpt":"Beacon attraction is a movement system whereby a robot (modeled as a point in 2D) moves in a free space so as to always locally minimize its Euclidean distance to an activated beacon (which is also a point). This results in the robot moving directly towards the beacon when it can, and otherwise sliding along the edge of an obstacle. When a robot can reach the activated beacon by this method, we say that the beacon attracts the robot. A beacon routing from $p$ to $q$ is a sequence $b_1, b_2,$ ..., $b_{k}$ of beacons such that activating the beacons in order will attract a robot from $p$ to $b_1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03509","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":"1507.03509","created_at":"2026-05-18T01:36:58.632768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03509v1","created_at":"2026-05-18T01:36:58.632768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03509","created_at":"2026-05-18T01:36:58.632768+00:00"},{"alias_kind":"pith_short_12","alias_value":"PESNSCRYZ4E3","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PESNSCRYZ4E3E2WV","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PESNSCRY","created_at":"2026-05-18T12:29:37.295048+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/PESNSCRYZ4E3E2WV6VIQQMYXNE","json":"https://pith.science/pith/PESNSCRYZ4E3E2WV6VIQQMYXNE.json","graph_json":"https://pith.science/api/pith-number/PESNSCRYZ4E3E2WV6VIQQMYXNE/graph.json","events_json":"https://pith.science/api/pith-number/PESNSCRYZ4E3E2WV6VIQQMYXNE/events.json","paper":"https://pith.science/paper/PESNSCRY"},"agent_actions":{"view_html":"https://pith.science/pith/PESNSCRYZ4E3E2WV6VIQQMYXNE","download_json":"https://pith.science/pith/PESNSCRYZ4E3E2WV6VIQQMYXNE.json","view_paper":"https://pith.science/paper/PESNSCRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03509&json=true","fetch_graph":"https://pith.science/api/pith-number/PESNSCRYZ4E3E2WV6VIQQMYXNE/graph.json","fetch_events":"https://pith.science/api/pith-number/PESNSCRYZ4E3E2WV6VIQQMYXNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PESNSCRYZ4E3E2WV6VIQQMYXNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PESNSCRYZ4E3E2WV6VIQQMYXNE/action/storage_attestation","attest_author":"https://pith.science/pith/PESNSCRYZ4E3E2WV6VIQQMYXNE/action/author_attestation","sign_citation":"https://pith.science/pith/PESNSCRYZ4E3E2WV6VIQQMYXNE/action/citation_signature","submit_replication":"https://pith.science/pith/PESNSCRYZ4E3E2WV6VIQQMYXNE/action/replication_record"}},"created_at":"2026-05-18T01:36:58.632768+00:00","updated_at":"2026-05-18T01:36:58.632768+00:00"}