{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5O3PGKW65Z4NN5WKW4FD6NNVYO","short_pith_number":"pith:5O3PGKW6","canonical_record":{"source":{"id":"1112.0695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-03T21:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"dc4933f81023220d2cec3a52f43b62fab04a2b0209baffd68a80c1bfac2d58df","abstract_canon_sha256":"3cc6e1df0b655cf5a58eeec11f02067e67f5b41a1321af68a22b2074dbe43f03"},"schema_version":"1.0"},"canonical_sha256":"ebb6f32adeee78d6f6cab70a3f35b5c3b9ea03876e0a22f4da9ea402a1e78203","source":{"kind":"arxiv","id":"1112.0695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0695","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0695v1","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0695","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"5O3PGKW65Z4N","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5O3PGKW65Z4NN5WK","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5O3PGKW6","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5O3PGKW65Z4NN5WKW4FD6NNVYO","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-03T21:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"dc4933f81023220d2cec3a52f43b62fab04a2b0209baffd68a80c1bfac2d58df","abstract_canon_sha256":"3cc6e1df0b655cf5a58eeec11f02067e67f5b41a1321af68a22b2074dbe43f03"},"schema_version":"1.0"},"canonical_sha256":"ebb6f32adeee78d6f6cab70a3f35b5c3b9ea03876e0a22f4da9ea402a1e78203","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:05.897891Z","signature_b64":"WqVNppS9XbHXxGQ0W7rsTiHYed2mvpeERC1l86EvfDd7EXEs1JYcJb7+tOpC6HEIgHEo8u44E0jXRLSeMUf+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb6f32adeee78d6f6cab70a3f35b5c3b9ea03876e0a22f4da9ea402a1e78203","last_reissued_at":"2026-05-18T04:07:05.897211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:05.897211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0695","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-18T04:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOKnPFxmh4jJoh8MkyGPDVmSkzg3M1yJiz/fZcpS0G7DZzvZByUa9GkNbbmP5iMhoXivPqK0zTbxZJT8XxcUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:20:10.501841Z"},"content_sha256":"edd9d6bc0c26ce94396cf282d609a8c00eded753699b1316f3c7f371da11f231","schema_version":"1.0","event_id":"sha256:edd9d6bc0c26ce94396cf282d609a8c00eded753699b1316f3c7f371da11f231"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5O3PGKW65Z4NN5WKW4FD6NNVYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Expected Complexity of Voronoi Diagrams on Terrains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Benjamin Raichel, Sariel Har-Peled","submitted_at":"2011-12-03T21:52:44Z","abstract_excerpt":"We investigate the combinatorial complexity of geodesic Voronoi diagrams on polyhedral terrains using a probabilistic analysis. Aronov etal [ABT08] prove that, if one makes certain realistic input assumptions on the terrain, this complexity is \\Theta(n + m \\sqrt n) in the worst case, where n denotes the number of triangles that define the terrain and m denotes the number of Voronoi sites. We prove that under a relaxed set of assumptions the Voronoi diagram has expected complexity O(n+m), given that the sites have a uniform distribution on the domain of the terrain(or the surface of the terrain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0695","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-18T04:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"comR+zYgHsDbsZf5HdQ1JGCS6RWobHbQ5P9GEDUsfVm8erJq0AiVRQhA6F+iN7lhdnvuD+5rFdi+aVQFQn4ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:20:10.502485Z"},"content_sha256":"57ff5676da202a5ce70d562ea176e793b938094abee00dddcd3662e9bfa94c17","schema_version":"1.0","event_id":"sha256:57ff5676da202a5ce70d562ea176e793b938094abee00dddcd3662e9bfa94c17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5O3PGKW65Z4NN5WKW4FD6NNVYO/bundle.json","state_url":"https://pith.science/pith/5O3PGKW65Z4NN5WKW4FD6NNVYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5O3PGKW65Z4NN5WKW4FD6NNVYO/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-08T14:20:10Z","links":{"resolver":"https://pith.science/pith/5O3PGKW65Z4NN5WKW4FD6NNVYO","bundle":"https://pith.science/pith/5O3PGKW65Z4NN5WKW4FD6NNVYO/bundle.json","state":"https://pith.science/pith/5O3PGKW65Z4NN5WKW4FD6NNVYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5O3PGKW65Z4NN5WKW4FD6NNVYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5O3PGKW65Z4NN5WKW4FD6NNVYO","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":"3cc6e1df0b655cf5a58eeec11f02067e67f5b41a1321af68a22b2074dbe43f03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-03T21:52:44Z","title_canon_sha256":"dc4933f81023220d2cec3a52f43b62fab04a2b0209baffd68a80c1bfac2d58df"},"schema_version":"1.0","source":{"id":"1112.0695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0695","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0695v1","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0695","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"5O3PGKW65Z4N","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5O3PGKW65Z4NN5WK","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5O3PGKW6","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:57ff5676da202a5ce70d562ea176e793b938094abee00dddcd3662e9bfa94c17","target":"graph","created_at":"2026-05-18T04:07:05Z","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":"We investigate the combinatorial complexity of geodesic Voronoi diagrams on polyhedral terrains using a probabilistic analysis. Aronov etal [ABT08] prove that, if one makes certain realistic input assumptions on the terrain, this complexity is \\Theta(n + m \\sqrt n) in the worst case, where n denotes the number of triangles that define the terrain and m denotes the number of Voronoi sites. We prove that under a relaxed set of assumptions the Voronoi diagram has expected complexity O(n+m), given that the sites have a uniform distribution on the domain of the terrain(or the surface of the terrain","authors_text":"Anne Driemel, Benjamin Raichel, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-03T21:52:44Z","title":"On the Expected Complexity of Voronoi Diagrams on Terrains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0695","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:edd9d6bc0c26ce94396cf282d609a8c00eded753699b1316f3c7f371da11f231","target":"record","created_at":"2026-05-18T04:07:05Z","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":"3cc6e1df0b655cf5a58eeec11f02067e67f5b41a1321af68a22b2074dbe43f03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-03T21:52:44Z","title_canon_sha256":"dc4933f81023220d2cec3a52f43b62fab04a2b0209baffd68a80c1bfac2d58df"},"schema_version":"1.0","source":{"id":"1112.0695","kind":"arxiv","version":1}},"canonical_sha256":"ebb6f32adeee78d6f6cab70a3f35b5c3b9ea03876e0a22f4da9ea402a1e78203","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebb6f32adeee78d6f6cab70a3f35b5c3b9ea03876e0a22f4da9ea402a1e78203","first_computed_at":"2026-05-18T04:07:05.897211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:05.897211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WqVNppS9XbHXxGQ0W7rsTiHYed2mvpeERC1l86EvfDd7EXEs1JYcJb7+tOpC6HEIgHEo8u44E0jXRLSeMUf+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:05.897891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edd9d6bc0c26ce94396cf282d609a8c00eded753699b1316f3c7f371da11f231","sha256:57ff5676da202a5ce70d562ea176e793b938094abee00dddcd3662e9bfa94c17"],"state_sha256":"64c05bdb116b3750e9e7b00f225d0b45131215b614278f1b44e55b88e6827e1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/O0aQjFaOyphKdtzsH7+XqbLDp09NfhxJwy+8HDfswNfl/xAtVmO0+lT7uRvX9vXhiv8OF0B+DENwUAtEOwDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:20:10.505722Z","bundle_sha256":"6f3f01239fb24b25710d8ecc10f5db529cce39a867193897ba30feea093db150"}}