{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OREIQ76QBRMDNYM4DUDY7D4P4V","short_pith_number":"pith:OREIQ76Q","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"},"canonical_sha256":"7448887fd00c5836e19c1d078f8f8fe55938b5e9df7ae9366595f5741c453920","source":{"kind":"arxiv","id":"1803.05946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05946","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05946v1","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05946","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"OREIQ76QBRMD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OREIQ76QBRMDNYM4","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OREIQ76Q","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OREIQ76QBRMDNYM4DUDY7D4P4V","target":"record","payload":{"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"},"canonical_sha256":"7448887fd00c5836e19c1d078f8f8fe55938b5e9df7ae9366595f5741c453920","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"},"source_kind":"arxiv","source_id":"1803.05946","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:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gz3rHerlzT2j4UoHzdJC4b6rEspCQGuicnLIZIynvWyr3K5SJxarvhLNm8sFA3JwYaaIlSW8Vf9duwf6TZz8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:43:00.562169Z"},"content_sha256":"d7a5ef25110cff70d276cada29b79e2ab02b24efaafee37134bb69a3e606cb01","schema_version":"1.0","event_id":"sha256:d7a5ef25110cff70d276cada29b79e2ab02b24efaafee37134bb69a3e606cb01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OREIQ76QBRMDNYM4DUDY7D4P4V","target":"graph","payload":{"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"},"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:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/4NN7LfCnu1HoPax+Y/tfmy5o0ibQaPkQmHgEUxBE5O5okX5aDKfG4cndFz/s4iA2lExAX9OnqRDHbGBqB9BBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:43:00.562865Z"},"content_sha256":"f82f5ab00736a3e37142a60318f85a79551d0f84187375dcc378a1c18dafb57d","schema_version":"1.0","event_id":"sha256:f82f5ab00736a3e37142a60318f85a79551d0f84187375dcc378a1c18dafb57d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/bundle.json","state_url":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/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-09T07:43:00Z","links":{"resolver":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V","bundle":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/bundle.json","state":"https://pith.science/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OREIQ76QBRMDNYM4DUDY7D4P4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OREIQ76QBRMDNYM4DUDY7D4P4V","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":"72fb4fdef66625fb5a3be145249c1ad01af157ca094c4a6aca1a362ba1c64de0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T18:56:31Z","title_canon_sha256":"f566ea843c703e51e8a8c6821e66ae914f2cd3f6360f35f74653404d764d5fd0"},"schema_version":"1.0","source":{"id":"1803.05946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05946","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05946v1","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05946","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"OREIQ76QBRMD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OREIQ76QBRMDNYM4","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OREIQ76Q","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:f82f5ab00736a3e37142a60318f85a79551d0f84187375dcc378a1c18dafb57d","target":"graph","created_at":"2026-05-18T00:20:51Z","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":"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","authors_text":"Bahram Kouhestani, David Rappaport, Irina Kostitsyna, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T18:56:31Z","title":"An Optimal Algorithm to Compute the Inverse Beacon Attraction Region"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05946","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:d7a5ef25110cff70d276cada29b79e2ab02b24efaafee37134bb69a3e606cb01","target":"record","created_at":"2026-05-18T00:20:51Z","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":"72fb4fdef66625fb5a3be145249c1ad01af157ca094c4a6aca1a362ba1c64de0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T18:56:31Z","title_canon_sha256":"f566ea843c703e51e8a8c6821e66ae914f2cd3f6360f35f74653404d764d5fd0"},"schema_version":"1.0","source":{"id":"1803.05946","kind":"arxiv","version":1}},"canonical_sha256":"7448887fd00c5836e19c1d078f8f8fe55938b5e9df7ae9366595f5741c453920","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7448887fd00c5836e19c1d078f8f8fe55938b5e9df7ae9366595f5741c453920","first_computed_at":"2026-05-18T00:20:51.306200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:51.306200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4hiNXv6j1uAtIJbgWKqYWnJv5kxVhB/GL//w+5GzjIfLhRfQ940JkD7udkSDqXVAP2dzwHqn/oYT89m8J7lpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:51.307056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7a5ef25110cff70d276cada29b79e2ab02b24efaafee37134bb69a3e606cb01","sha256:f82f5ab00736a3e37142a60318f85a79551d0f84187375dcc378a1c18dafb57d"],"state_sha256":"4738407714f6bd1f070512fe3bcde5e2344120afb37ae5bc1d1024049186485a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIy7aHrSrAmy6FclZ+539LKbuuZ22XrsiJCxX0SQd3OBASh/H8DoZsJgyKzfcsdPJKQS6z+rsLZbTRqunUg8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:43:00.566403Z","bundle_sha256":"a105f0da2d721b822e60a1d69b2328e166987b2f1cb5da80ff3fb62e667a8266"}}