{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5KODTHHEHORQDBGEANZKKQOXGZ","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":"b0d5220ecbaa183e2f89729e98ff5646b98034c1e2a01ff9fd696a2118ed560f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T13:20:43Z","title_canon_sha256":"052c32da81ae09b5e8d1c4f6baea9230f5055bc4eba44a07da1783d2359b42da"},"schema_version":"1.0","source":{"id":"1809.01481","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01481","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01481v2","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01481","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"5KODTHHEHORQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5KODTHHEHORQDBGE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5KODTHHE","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:76bd3c0c70b34055cbe4c64edfaaaa70971826791e3b5e1a26c8af2d9e88e195","target":"graph","created_at":"2026-05-18T00:06:17Z","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":"Let $P$ be a simple polygon with $n$ vertices. For any two points in $P$, the geodesic distance between them is the length of the shortest path that connects them among all paths contained in $P$. Given a set $S$ of $m$ sites being a subset of the vertices of $P$, we present a randomized algorithm to compute the geodesic farthest-point Voronoi diagram of $S$ in $P$ running in expected $O(n + m)$ time. That is, a partition of $P$ into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic distance. In particular, this algorithm ","authors_text":"Luis Barba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T13:20:43Z","title":"Geodesic farthest-point Voronoi diagram in linear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01481","kind":"arxiv","version":2},"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:7a86756ed13003ca9855da1c2d23a4c1d548f998a7028c7b42cc815bea8f46ae","target":"record","created_at":"2026-05-18T00:06:17Z","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":"b0d5220ecbaa183e2f89729e98ff5646b98034c1e2a01ff9fd696a2118ed560f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T13:20:43Z","title_canon_sha256":"052c32da81ae09b5e8d1c4f6baea9230f5055bc4eba44a07da1783d2359b42da"},"schema_version":"1.0","source":{"id":"1809.01481","kind":"arxiv","version":2}},"canonical_sha256":"ea9c399ce43ba30184c40372a541d7364365254e3c024e32c662897a19d520b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea9c399ce43ba30184c40372a541d7364365254e3c024e32c662897a19d520b8","first_computed_at":"2026-05-18T00:06:17.920817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:17.920817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ilnO5xof6krkFm/gb9xvJ+SHYOwntAugsas6xkBw8A5UEci0kozwpvj+DWd7aZJng8iF5siwUd0N8Psz2GBZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:17.921286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01481","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a86756ed13003ca9855da1c2d23a4c1d548f998a7028c7b42cc815bea8f46ae","sha256:76bd3c0c70b34055cbe4c64edfaaaa70971826791e3b5e1a26c8af2d9e88e195"],"state_sha256":"2e5a328302b131cd5944f725ca9f2f9077fa926517dc7c952eb718d4c92c852d"}