{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NUJNKZVTFAUPCOQUTNRISXVEQJ","short_pith_number":"pith:NUJNKZVT","canonical_record":{"source":{"id":"1801.02292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-01-08T02:47:09Z","cross_cats_sorted":[],"title_canon_sha256":"3e7eae419635556e8bcca3ce3682e218b65b5d55587aabeed3f58e2f7ff3a4ee","abstract_canon_sha256":"9b9ac5f317c833681063d56ded691579c4de5ae688e5d9d2ffc3858314d58ceb"},"schema_version":"1.0"},"canonical_sha256":"6d12d566b32828f13a149b62895ea48246091d29f7527fdb5143e209270df54b","source":{"kind":"arxiv","id":"1801.02292","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02292","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02292v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02292","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"NUJNKZVTFAUP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NUJNKZVTFAUPCOQU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NUJNKZVT","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NUJNKZVTFAUPCOQUTNRISXVEQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-01-08T02:47:09Z","cross_cats_sorted":[],"title_canon_sha256":"3e7eae419635556e8bcca3ce3682e218b65b5d55587aabeed3f58e2f7ff3a4ee","abstract_canon_sha256":"9b9ac5f317c833681063d56ded691579c4de5ae688e5d9d2ffc3858314d58ceb"},"schema_version":"1.0"},"canonical_sha256":"6d12d566b32828f13a149b62895ea48246091d29f7527fdb5143e209270df54b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:32.146139Z","signature_b64":"TiNNdX9G26M/8y2SgZZzjoTa5CMtB83tOT/wz/R7w1rJVVc3PAiYWXVwxBVj4J9mYh6wFPa1Mjtxp0SkPzjjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d12d566b32828f13a149b62895ea48246091d29f7527fdb5143e209270df54b","last_reissued_at":"2026-05-18T00:26:32.145505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:32.145505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02292","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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zF7Odv7q/kJVcGvnv25/XEXwVN7ue9d9J82fhg+Ccm62QRsB+vj2GVMUZT/IaQG0e/jTOVECtZYIjNveXrOACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:04:07.999981Z"},"content_sha256":"a92e8f0371eee384341a022911ca3fef1e2182ff9041996ea0ef342f6b918a0a","schema_version":"1.0","event_id":"sha256:a92e8f0371eee384341a022911ca3fef1e2182ff9041996ea0ef342f6b918a0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NUJNKZVTFAUPCOQUTNRISXVEQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Hee-Kap Ahn","submitted_at":"2018-01-08T02:47:09Z","abstract_excerpt":"Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones for m <= n/ polylog n. Moreover, the algorithms for the geodesic nearest-point and farthest-point Voronoi diagrams are optimal for m <= n/ polylog n. This partially answers a question posed by Mitchell in the Handbook of Computational Geometry."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02292","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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbSamLEtjcBoGPYUQWUZf1ImigT6gKaU7p02gI9P9qAxRxK4Jqp2TyLFp/dJ/wWdF9JdvM/c1Ed71Ls5f6vGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:04:08.000680Z"},"content_sha256":"74ee7c87813c078c189b2ce23ab0e2f599e3e80dbe80faee504aa0172dac6e8c","schema_version":"1.0","event_id":"sha256:74ee7c87813c078c189b2ce23ab0e2f599e3e80dbe80faee504aa0172dac6e8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/bundle.json","state_url":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/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-07T20:04:08Z","links":{"resolver":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ","bundle":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/bundle.json","state":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NUJNKZVTFAUPCOQUTNRISXVEQJ","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":"9b9ac5f317c833681063d56ded691579c4de5ae688e5d9d2ffc3858314d58ceb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-01-08T02:47:09Z","title_canon_sha256":"3e7eae419635556e8bcca3ce3682e218b65b5d55587aabeed3f58e2f7ff3a4ee"},"schema_version":"1.0","source":{"id":"1801.02292","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02292","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02292v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02292","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"NUJNKZVTFAUP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NUJNKZVTFAUPCOQU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NUJNKZVT","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:74ee7c87813c078c189b2ce23ab0e2f599e3e80dbe80faee504aa0172dac6e8c","target":"graph","created_at":"2026-05-18T00:26:32Z","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":"Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones for m <= n/ polylog n. Moreover, the algorithms for the geodesic nearest-point and farthest-point Voronoi diagrams are optimal for m <= n/ polylog n. This partially answers a question posed by Mitchell in the Handbook of Computational Geometry.","authors_text":"Eunjin Oh, Hee-Kap Ahn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-01-08T02:47:09Z","title":"Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02292","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:a92e8f0371eee384341a022911ca3fef1e2182ff9041996ea0ef342f6b918a0a","target":"record","created_at":"2026-05-18T00:26:32Z","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":"9b9ac5f317c833681063d56ded691579c4de5ae688e5d9d2ffc3858314d58ceb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-01-08T02:47:09Z","title_canon_sha256":"3e7eae419635556e8bcca3ce3682e218b65b5d55587aabeed3f58e2f7ff3a4ee"},"schema_version":"1.0","source":{"id":"1801.02292","kind":"arxiv","version":1}},"canonical_sha256":"6d12d566b32828f13a149b62895ea48246091d29f7527fdb5143e209270df54b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d12d566b32828f13a149b62895ea48246091d29f7527fdb5143e209270df54b","first_computed_at":"2026-05-18T00:26:32.145505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:32.145505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TiNNdX9G26M/8y2SgZZzjoTa5CMtB83tOT/wz/R7w1rJVVc3PAiYWXVwxBVj4J9mYh6wFPa1Mjtxp0SkPzjjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:32.146139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02292","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a92e8f0371eee384341a022911ca3fef1e2182ff9041996ea0ef342f6b918a0a","sha256:74ee7c87813c078c189b2ce23ab0e2f599e3e80dbe80faee504aa0172dac6e8c"],"state_sha256":"a5d1b59044cf9cc6a954f38f66eb4c2edca4ea1fd31f58eae661d29fb6cb3b61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8VgXjoiHU9AV6y+X1NnMZvaqIRbwXYaua4Ye1mtxMXvnzkpwE4Fv0Lzz9LvgjjPte/P7m9mMqWaCwRTiyS+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:04:08.004684Z","bundle_sha256":"0bd9ac93ed3e86401d148810d7759ccdb19d661ecec148d4b6b7383bfdbfbef8"}}