{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LO732KVQRBMUBQXRP6EXODKTGC","short_pith_number":"pith:LO732KVQ","canonical_record":{"source":{"id":"1212.5098","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-20T15:49:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2d18261e1f8c9de225b9f5063311be5df2d4f34c9493b4f392bd82850a9dab50","abstract_canon_sha256":"fd569c908772e9d56d5aed004458a22e4ba4d0070f8eb42b7e93d57c9d47939a"},"schema_version":"1.0"},"canonical_sha256":"5bbfbd2ab0885940c2f17f89770d5330b32c274c30771f6c5fa85d5e5ddd675d","source":{"kind":"arxiv","id":"1212.5098","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5098","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5098v2","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5098","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"LO732KVQRBMU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LO732KVQRBMUBQXR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LO732KVQ","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LO732KVQRBMUBQXRP6EXODKTGC","target":"record","payload":{"canonical_record":{"source":{"id":"1212.5098","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-20T15:49:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2d18261e1f8c9de225b9f5063311be5df2d4f34c9493b4f392bd82850a9dab50","abstract_canon_sha256":"fd569c908772e9d56d5aed004458a22e4ba4d0070f8eb42b7e93d57c9d47939a"},"schema_version":"1.0"},"canonical_sha256":"5bbfbd2ab0885940c2f17f89770d5330b32c274c30771f6c5fa85d5e5ddd675d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.814948Z","signature_b64":"rRifk2XDEWaaA2DFSr8WSK2v4JrYlipBVr5O1H+CKdb13Gd4yQ+x4bQVmQnHgMnB8M3k0ClzmjH8ucIOZeQTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bbfbd2ab0885940c2f17f89770d5330b32c274c30771f6c5fa85d5e5ddd675d","last_reissued_at":"2026-05-18T03:29:15.814205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.814205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.5098","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-18T03:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uczsk+RGxgiv1bK8RLBNXxkj7m9GV7irQsOraqeu9UynRaStP8HKBXUSPL6TX67y6AvsSZNd6iIYxESPQ7oqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:03:52.977065Z"},"content_sha256":"5ab37723ac7688380cda65d06cabefb9c65d8dbf430c78cf8dc76e4002cc21c0","schema_version":"1.0","event_id":"sha256:5ab37723ac7688380cda65d06cabefb9c65d8dbf430c78cf8dc76e4002cc21c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LO732KVQRBMUBQXRP6EXODKTGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Donald R. Sheehy, Gary L. Miller","submitted_at":"2012-12-20T15:49:36Z","abstract_excerpt":"We describe a new algorithm for computing the Voronoi diagram of a set of $n$ points in constant-dimensional Euclidean space.\n  The running time of our algorithm is $O(f \\log n \\log \\Delta)$ where $f$ is the output complexity of the Voronoi diagram and $\\Delta$ is the spread of the input, the ratio of largest to smallest pairwise distances.\n  Despite the simplicity of the algorithm and its analysis, it improves on the state of the art for all inputs with polynomial spread and near-linear output size.\n  The key idea is to first build the Voronoi diagram of a superset of the input points using i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5098","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-18T03:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5c17NgThvuhqshYDgMGpyYyE4S2/lf11AUF+JZxfzV7mvpelMA2bI/VN/loIgCUAXkPKC1W8iE+et1BmiBIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:03:52.977695Z"},"content_sha256":"8ec4bcc6ab0479aee9edf2f01aa74a4b806da7ecb6e4600f5d74bd4a87b36f06","schema_version":"1.0","event_id":"sha256:8ec4bcc6ab0479aee9edf2f01aa74a4b806da7ecb6e4600f5d74bd4a87b36f06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LO732KVQRBMUBQXRP6EXODKTGC/bundle.json","state_url":"https://pith.science/pith/LO732KVQRBMUBQXRP6EXODKTGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LO732KVQRBMUBQXRP6EXODKTGC/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-26T16:03:52Z","links":{"resolver":"https://pith.science/pith/LO732KVQRBMUBQXRP6EXODKTGC","bundle":"https://pith.science/pith/LO732KVQRBMUBQXRP6EXODKTGC/bundle.json","state":"https://pith.science/pith/LO732KVQRBMUBQXRP6EXODKTGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LO732KVQRBMUBQXRP6EXODKTGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LO732KVQRBMUBQXRP6EXODKTGC","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":"fd569c908772e9d56d5aed004458a22e4ba4d0070f8eb42b7e93d57c9d47939a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-20T15:49:36Z","title_canon_sha256":"2d18261e1f8c9de225b9f5063311be5df2d4f34c9493b4f392bd82850a9dab50"},"schema_version":"1.0","source":{"id":"1212.5098","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5098","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5098v2","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5098","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"LO732KVQRBMU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LO732KVQRBMUBQXR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LO732KVQ","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:8ec4bcc6ab0479aee9edf2f01aa74a4b806da7ecb6e4600f5d74bd4a87b36f06","target":"graph","created_at":"2026-05-18T03:29:15Z","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 describe a new algorithm for computing the Voronoi diagram of a set of $n$ points in constant-dimensional Euclidean space.\n  The running time of our algorithm is $O(f \\log n \\log \\Delta)$ where $f$ is the output complexity of the Voronoi diagram and $\\Delta$ is the spread of the input, the ratio of largest to smallest pairwise distances.\n  Despite the simplicity of the algorithm and its analysis, it improves on the state of the art for all inputs with polynomial spread and near-linear output size.\n  The key idea is to first build the Voronoi diagram of a superset of the input points using i","authors_text":"Donald R. Sheehy, Gary L. Miller","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-20T15:49:36Z","title":"A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5098","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:5ab37723ac7688380cda65d06cabefb9c65d8dbf430c78cf8dc76e4002cc21c0","target":"record","created_at":"2026-05-18T03:29:15Z","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":"fd569c908772e9d56d5aed004458a22e4ba4d0070f8eb42b7e93d57c9d47939a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-20T15:49:36Z","title_canon_sha256":"2d18261e1f8c9de225b9f5063311be5df2d4f34c9493b4f392bd82850a9dab50"},"schema_version":"1.0","source":{"id":"1212.5098","kind":"arxiv","version":2}},"canonical_sha256":"5bbfbd2ab0885940c2f17f89770d5330b32c274c30771f6c5fa85d5e5ddd675d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bbfbd2ab0885940c2f17f89770d5330b32c274c30771f6c5fa85d5e5ddd675d","first_computed_at":"2026-05-18T03:29:15.814205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:15.814205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rRifk2XDEWaaA2DFSr8WSK2v4JrYlipBVr5O1H+CKdb13Gd4yQ+x4bQVmQnHgMnB8M3k0ClzmjH8ucIOZeQTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:15.814948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5098","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ab37723ac7688380cda65d06cabefb9c65d8dbf430c78cf8dc76e4002cc21c0","sha256:8ec4bcc6ab0479aee9edf2f01aa74a4b806da7ecb6e4600f5d74bd4a87b36f06"],"state_sha256":"d8b026a5a40db430e55f6051a20e09d0f5449bd5618e9a5113940b49f1aec379"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8seXtKdAg8rE6dJj7TRPJu6qvHcx+2Fge0VXXVj/Z3chmE/2ZDx7DNlax46lrKxXIViItwjWwvtar8wxdd4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:03:52.980627Z","bundle_sha256":"f0632a70bda12620700b626ec27ebd8ac3b5bc7b42557081123bd1aad71d623c"}}