{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5KODTHHEHORQDBGEANZKKQOXGZ","short_pith_number":"pith:5KODTHHE","canonical_record":{"source":{"id":"1809.01481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T13:20:43Z","cross_cats_sorted":[],"title_canon_sha256":"052c32da81ae09b5e8d1c4f6baea9230f5055bc4eba44a07da1783d2359b42da","abstract_canon_sha256":"b0d5220ecbaa183e2f89729e98ff5646b98034c1e2a01ff9fd696a2118ed560f"},"schema_version":"1.0"},"canonical_sha256":"ea9c399ce43ba30184c40372a541d7364365254e3c024e32c662897a19d520b8","source":{"kind":"arxiv","id":"1809.01481","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5KODTHHEHORQDBGEANZKKQOXGZ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T13:20:43Z","cross_cats_sorted":[],"title_canon_sha256":"052c32da81ae09b5e8d1c4f6baea9230f5055bc4eba44a07da1783d2359b42da","abstract_canon_sha256":"b0d5220ecbaa183e2f89729e98ff5646b98034c1e2a01ff9fd696a2118ed560f"},"schema_version":"1.0"},"canonical_sha256":"ea9c399ce43ba30184c40372a541d7364365254e3c024e32c662897a19d520b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:17.921286Z","signature_b64":"ilnO5xof6krkFm/gb9xvJ+SHYOwntAugsas6xkBw8A5UEci0kozwpvj+DWd7aZJng8iF5siwUd0N8Psz2GBZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea9c399ce43ba30184c40372a541d7364365254e3c024e32c662897a19d520b8","last_reissued_at":"2026-05-18T00:06:17.920817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:17.920817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01481","source_version":2,"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:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0eQEFwoZGYeLZsZl3cGwP1Xz+z9V8cPJjwnXQ12R0wgA5YegDJ+QCfXfgni2TmwWa4KaDbAbeOWSf5sLy60AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:04:39.366348Z"},"content_sha256":"7a86756ed13003ca9855da1c2d23a4c1d548f998a7028c7b42cc815bea8f46ae","schema_version":"1.0","event_id":"sha256:7a86756ed13003ca9855da1c2d23a4c1d548f998a7028c7b42cc815bea8f46ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5KODTHHEHORQDBGEANZKKQOXGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geodesic farthest-point Voronoi diagram in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Luis Barba","submitted_at":"2018-09-05T13:20:43Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01481","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"},"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:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXKAG9/SX2wnABmzkcHEUPzA1CtU2zrKbq9Bw7a0pnba+TptlIZTkKnex63GzaLC6TrXRx6bkT1+s62h0Te5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:04:39.366921Z"},"content_sha256":"76bd3c0c70b34055cbe4c64edfaaaa70971826791e3b5e1a26c8af2d9e88e195","schema_version":"1.0","event_id":"sha256:76bd3c0c70b34055cbe4c64edfaaaa70971826791e3b5e1a26c8af2d9e88e195"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KODTHHEHORQDBGEANZKKQOXGZ/bundle.json","state_url":"https://pith.science/pith/5KODTHHEHORQDBGEANZKKQOXGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KODTHHEHORQDBGEANZKKQOXGZ/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-05-27T07:04:39Z","links":{"resolver":"https://pith.science/pith/5KODTHHEHORQDBGEANZKKQOXGZ","bundle":"https://pith.science/pith/5KODTHHEHORQDBGEANZKKQOXGZ/bundle.json","state":"https://pith.science/pith/5KODTHHEHORQDBGEANZKKQOXGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KODTHHEHORQDBGEANZKKQOXGZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWYz9nLoBuhOmmgVLS/7Ol8y7p7kj5HaiZZgTMPrzSrgitMyiQrRo45yBG7PJ3OEV51zQaDFZ0f0h5CglpyyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:04:39.369490Z","bundle_sha256":"43c504024b6028212dc4df9e287f42c26b4f6b21a448c1979a3a9a27f522db6e"}}