{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZF6LJEGY3ZNINBMIZMIJRUWMR3","short_pith_number":"pith:ZF6LJEGY","canonical_record":{"source":{"id":"1802.06223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-17T11:36:42Z","cross_cats_sorted":[],"title_canon_sha256":"a8c70dd00f5697ce7efc2eb4aeb5058a50e720603ff7c0abb5503f9cc7765fe3","abstract_canon_sha256":"b1d438cd09a709e13b6597413ed4e851dad6f9bb3383c3173969417271a142e1"},"schema_version":"1.0"},"canonical_sha256":"c97cb490d8de5a868588cb1098d2cc8efac6cc3ac0d94b8ceb7bc7df694dac94","source":{"kind":"arxiv","id":"1802.06223","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06223","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06223v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06223","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZF6LJEGY3ZNI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZF6LJEGY3ZNINBMI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZF6LJEGY","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZF6LJEGY3ZNINBMIZMIJRUWMR3","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-17T11:36:42Z","cross_cats_sorted":[],"title_canon_sha256":"a8c70dd00f5697ce7efc2eb4aeb5058a50e720603ff7c0abb5503f9cc7765fe3","abstract_canon_sha256":"b1d438cd09a709e13b6597413ed4e851dad6f9bb3383c3173969417271a142e1"},"schema_version":"1.0"},"canonical_sha256":"c97cb490d8de5a868588cb1098d2cc8efac6cc3ac0d94b8ceb7bc7df694dac94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.965757Z","signature_b64":"AupG2wEeXFPUDk/1KGwpb4CKcNpwSeUVMNj7xM+9hph7Kjr3zUqCdnOcQqqPs53jssG1mjNw2AH0f3UmdhafAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c97cb490d8de5a868588cb1098d2cc8efac6cc3ac0d94b8ceb7bc7df694dac94","last_reissued_at":"2026-05-18T00:23:03.965070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.965070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06223","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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUlQgGIgb+eX3tK05G6z4V+VWByyf/dt6lPFkvSjXjYqYdcH+FDp3kW7h86LCPNjzux+PHPXK+x0qEiPJQjPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:54:21.499229Z"},"content_sha256":"e98e50f8a6da3f730382bc9a420734db5a95903e5d8d77d19b8fcc48138c0167","schema_version":"1.0","event_id":"sha256:e98e50f8a6da3f730382bc9a420734db5a95903e5d8d77d19b8fcc48138c0167"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZF6LJEGY3ZNINBMIZMIJRUWMR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Geodesic Farthest-point Voronoi Diagram 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, Luis Barba","submitted_at":"2018-02-17T11:36:42Z","abstract_excerpt":"Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon 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 metric. We present an $O(n\\log\\log n+m\\log m)$- time algorithm to compute the geodesic farthest-point Voronoi diagram of $m$ point sites in a simple $n$-gon. This improves the previously best known algorithm by Aronov et al. [Discrete Comput. Geom. 9(3):217-255, 1993]. In the case that all point sites are on the boundary of the simple polygon, we can compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06223","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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oddtU0Gi7M0i/8YZ/r6jNTFIBrH0LOGSkQsZkIRYf+fVtPFsh5C7wD4XmdECPBhLr8E27mr3M7YpjTnJ98ADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:54:21.499988Z"},"content_sha256":"16281789ef3b13d92470b2861cfafeb94bb53ce01eee5a0a428b87bf566a7f47","schema_version":"1.0","event_id":"sha256:16281789ef3b13d92470b2861cfafeb94bb53ce01eee5a0a428b87bf566a7f47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZF6LJEGY3ZNINBMIZMIJRUWMR3/bundle.json","state_url":"https://pith.science/pith/ZF6LJEGY3ZNINBMIZMIJRUWMR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZF6LJEGY3ZNINBMIZMIJRUWMR3/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-10T14:54:21Z","links":{"resolver":"https://pith.science/pith/ZF6LJEGY3ZNINBMIZMIJRUWMR3","bundle":"https://pith.science/pith/ZF6LJEGY3ZNINBMIZMIJRUWMR3/bundle.json","state":"https://pith.science/pith/ZF6LJEGY3ZNINBMIZMIJRUWMR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZF6LJEGY3ZNINBMIZMIJRUWMR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZF6LJEGY3ZNINBMIZMIJRUWMR3","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":"b1d438cd09a709e13b6597413ed4e851dad6f9bb3383c3173969417271a142e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-17T11:36:42Z","title_canon_sha256":"a8c70dd00f5697ce7efc2eb4aeb5058a50e720603ff7c0abb5503f9cc7765fe3"},"schema_version":"1.0","source":{"id":"1802.06223","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06223","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06223v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06223","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZF6LJEGY3ZNI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZF6LJEGY3ZNINBMI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZF6LJEGY","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:16281789ef3b13d92470b2861cfafeb94bb53ce01eee5a0a428b87bf566a7f47","target":"graph","created_at":"2026-05-18T00:23:03Z","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 point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon 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 metric. We present an $O(n\\log\\log n+m\\log m)$- time algorithm to compute the geodesic farthest-point Voronoi diagram of $m$ point sites in a simple $n$-gon. This improves the previously best known algorithm by Aronov et al. [Discrete Comput. Geom. 9(3):217-255, 1993]. In the case that all point sites are on the boundary of the simple polygon, we can compu","authors_text":"Eunjin Oh, Hee-Kap Ahn, Luis Barba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-17T11:36:42Z","title":"The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06223","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:e98e50f8a6da3f730382bc9a420734db5a95903e5d8d77d19b8fcc48138c0167","target":"record","created_at":"2026-05-18T00:23:03Z","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":"b1d438cd09a709e13b6597413ed4e851dad6f9bb3383c3173969417271a142e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-17T11:36:42Z","title_canon_sha256":"a8c70dd00f5697ce7efc2eb4aeb5058a50e720603ff7c0abb5503f9cc7765fe3"},"schema_version":"1.0","source":{"id":"1802.06223","kind":"arxiv","version":1}},"canonical_sha256":"c97cb490d8de5a868588cb1098d2cc8efac6cc3ac0d94b8ceb7bc7df694dac94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c97cb490d8de5a868588cb1098d2cc8efac6cc3ac0d94b8ceb7bc7df694dac94","first_computed_at":"2026-05-18T00:23:03.965070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.965070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AupG2wEeXFPUDk/1KGwpb4CKcNpwSeUVMNj7xM+9hph7Kjr3zUqCdnOcQqqPs53jssG1mjNw2AH0f3UmdhafAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.965757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06223","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e98e50f8a6da3f730382bc9a420734db5a95903e5d8d77d19b8fcc48138c0167","sha256:16281789ef3b13d92470b2861cfafeb94bb53ce01eee5a0a428b87bf566a7f47"],"state_sha256":"30af184295bddab4a2b6f404f8ad60e1cc9d53a2933c0d0c99934c8b438670c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMkUBrfUC9dbsD49FuizeTcBnk59wZYbp0WMsKAoT8oYMrCiF62PArVD3skjBFuiQuctlBmZxyY9gRJPzif5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:54:21.504102Z","bundle_sha256":"35995b160a570989b082b29557a5171b8b042e50c3718eba3844f11dbbc1273f"}}