{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KO7PEVCN4MZO6KP5OETLDXFRKE","short_pith_number":"pith:KO7PEVCN","canonical_record":{"source":{"id":"1001.3593","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-01-20T14:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"400189ab3e6c518c320758d22b557a8fcf4defa0b5c19e9c87f9ce10b3800fe7","abstract_canon_sha256":"20c1d8e617aafd01bb8d470304292efca7c012d391064094bccf168853179205"},"schema_version":"1.0"},"canonical_sha256":"53bef2544de332ef29fd7126b1dcb1512f8a504b27a8179af07c3455000d7780","source":{"kind":"arxiv","id":"1001.3593","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3593","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3593v2","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3593","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"KO7PEVCN4MZO","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KO7PEVCN4MZO6KP5","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KO7PEVCN","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KO7PEVCN4MZO6KP5OETLDXFRKE","target":"record","payload":{"canonical_record":{"source":{"id":"1001.3593","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-01-20T14:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"400189ab3e6c518c320758d22b557a8fcf4defa0b5c19e9c87f9ce10b3800fe7","abstract_canon_sha256":"20c1d8e617aafd01bb8d470304292efca7c012d391064094bccf168853179205"},"schema_version":"1.0"},"canonical_sha256":"53bef2544de332ef29fd7126b1dcb1512f8a504b27a8179af07c3455000d7780","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:19.586064Z","signature_b64":"NyzvGGXSKJSVd71Y/nYXtX/bLdK+TMZwxPVUx1ETUwGboa81DzTS9/IFlH8ucmGBgfn2MJOhHDk9jHXHsJMcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53bef2544de332ef29fd7126b1dcb1512f8a504b27a8179af07c3455000d7780","last_reissued_at":"2026-05-18T04:34:19.585616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:19.585616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.3593","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-18T04:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUrred/aGoZr2oY2ghMZOpMOQAS3mAEzuFaJLfQT5SMS6wqryk7Lu5NvUWiogW7cI2OQnoN9vjZv7SmFayVHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:49:08.845605Z"},"content_sha256":"c0a547abb9bb0ae0deee0c4d7dbcc01134e5543298f13dc1a40326cef9c0b90b","schema_version":"1.0","event_id":"sha256:c0a547abb9bb0ae0deee0c4d7dbcc01134e5543298f13dc1a40326cef9c0b90b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KO7PEVCN4MZO6KP5OETLDXFRKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Farthest-Polygon Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hazel Everett (INRIA Lorraine - LORIA), Hyeon-Suk Na, Joachim Gudmundsson (NICTA), Marc Glisse (INRIA Sophia Antipolis / INRIA Saclay - Ile de France), Mira Lee (KAIST CS), Otfried Cheong (KAIST CS), Samuel Hornus (INRIA Lorraine - LORIA), Sylvain Lazard (INRIA Lorraine - LORIA)","submitted_at":"2010-01-20T14:09:41Z","abstract_excerpt":"Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log^3 n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k-1 connected components, but if one component is bounded, then it is equal to the entire region."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3593","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-18T04:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTnrS+Ve8IJrBzLynN36txzPc5K8EIgcmsSUMOHhtgyrjMslexoy0D639C1WTFGuY0u5XzNbt4Nrn1Ce1khBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:49:08.845997Z"},"content_sha256":"066f7202a5a3c4d51b68f5d048da5df11ec826a216c2ff66bb8cb22842d1221a","schema_version":"1.0","event_id":"sha256:066f7202a5a3c4d51b68f5d048da5df11ec826a216c2ff66bb8cb22842d1221a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/bundle.json","state_url":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/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-24T07:49:08Z","links":{"resolver":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE","bundle":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/bundle.json","state":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KO7PEVCN4MZO6KP5OETLDXFRKE","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":"20c1d8e617aafd01bb8d470304292efca7c012d391064094bccf168853179205","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-01-20T14:09:41Z","title_canon_sha256":"400189ab3e6c518c320758d22b557a8fcf4defa0b5c19e9c87f9ce10b3800fe7"},"schema_version":"1.0","source":{"id":"1001.3593","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3593","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3593v2","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3593","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"KO7PEVCN4MZO","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KO7PEVCN4MZO6KP5","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KO7PEVCN","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:066f7202a5a3c4d51b68f5d048da5df11ec826a216c2ff66bb8cb22842d1221a","target":"graph","created_at":"2026-05-18T04:34:19Z","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 family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log^3 n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k-1 connected components, but if one component is bounded, then it is equal to the entire region.","authors_text":"Hazel Everett (INRIA Lorraine - LORIA), Hyeon-Suk Na, Joachim Gudmundsson (NICTA), Marc Glisse (INRIA Sophia Antipolis / INRIA Saclay - Ile de France), Mira Lee (KAIST CS), Otfried Cheong (KAIST CS), Samuel Hornus (INRIA Lorraine - LORIA), Sylvain Lazard (INRIA Lorraine - LORIA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-01-20T14:09:41Z","title":"Farthest-Polygon Voronoi Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3593","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:c0a547abb9bb0ae0deee0c4d7dbcc01134e5543298f13dc1a40326cef9c0b90b","target":"record","created_at":"2026-05-18T04:34:19Z","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":"20c1d8e617aafd01bb8d470304292efca7c012d391064094bccf168853179205","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-01-20T14:09:41Z","title_canon_sha256":"400189ab3e6c518c320758d22b557a8fcf4defa0b5c19e9c87f9ce10b3800fe7"},"schema_version":"1.0","source":{"id":"1001.3593","kind":"arxiv","version":2}},"canonical_sha256":"53bef2544de332ef29fd7126b1dcb1512f8a504b27a8179af07c3455000d7780","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53bef2544de332ef29fd7126b1dcb1512f8a504b27a8179af07c3455000d7780","first_computed_at":"2026-05-18T04:34:19.585616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:19.585616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NyzvGGXSKJSVd71Y/nYXtX/bLdK+TMZwxPVUx1ETUwGboa81DzTS9/IFlH8ucmGBgfn2MJOhHDk9jHXHsJMcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:19.586064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3593","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0a547abb9bb0ae0deee0c4d7dbcc01134e5543298f13dc1a40326cef9c0b90b","sha256:066f7202a5a3c4d51b68f5d048da5df11ec826a216c2ff66bb8cb22842d1221a"],"state_sha256":"0136ae38981ed082976d664e644649d9314c33023af8f281db5e2c69e90f20ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYKPlgJUqFwFD5NLYVsuWf+7SlE214EtwQnm/S34B0wd80y48Ce0W2RGy0mdVOG0mKL6TcfOl2VuXdQoVsQMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:49:08.848165Z","bundle_sha256":"c5ba170a6d2ed1a990ffb0479c8b9ea4c03e31e794582c5e0b8f7562bb304cd4"}}