{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:66MOSLIVGFBLIS4E3WC7IYXBYN","short_pith_number":"pith:66MOSLIV","canonical_record":{"source":{"id":"1401.1477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-07T19:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"cd291b85e9ad0ebda6b45ab0fd4631593a5c2d124ac04c823631ddd1b8be8836","abstract_canon_sha256":"3ed82c9649c51282c93f905292f1c935d5f7be011d35f063f57bb9effae2a79d"},"schema_version":"1.0"},"canonical_sha256":"f798e92d153142b44b84dd85f462e1c374633a75d243a60ca4cf124bdc76d6fe","source":{"kind":"arxiv","id":"1401.1477","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1477","created_at":"2026-05-18T02:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1477v2","created_at":"2026-05-18T02:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1477","created_at":"2026-05-18T02:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"66MOSLIVGFBL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"66MOSLIVGFBLIS4E","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"66MOSLIV","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:66MOSLIVGFBLIS4E3WC7IYXBYN","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-07T19:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"cd291b85e9ad0ebda6b45ab0fd4631593a5c2d124ac04c823631ddd1b8be8836","abstract_canon_sha256":"3ed82c9649c51282c93f905292f1c935d5f7be011d35f063f57bb9effae2a79d"},"schema_version":"1.0"},"canonical_sha256":"f798e92d153142b44b84dd85f462e1c374633a75d243a60ca4cf124bdc76d6fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:49.892428Z","signature_b64":"y/X4leHGQawlRgTjhyVqnCwq4Rn/b8o8nHLfHaXZJyNcv1ROHcI5focNpN7Oc7siRba2IMsMhtUASmhkMuU1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f798e92d153142b44b84dd85f462e1c374633a75d243a60ca4cf124bdc76d6fe","last_reissued_at":"2026-05-18T02:20:49.891693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:49.891693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1477","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-18T02:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vyM4cQiBgm3AOauICDBNkeMZAKIom+rz257D+0uyZIj+FqzlKchrrc0YuY99wMoxFw+JHiSEM5TF0PJN7ZQ1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:16:57.526089Z"},"content_sha256":"c0d117bb37eb939c2c5f016668e4145e1c8d6bd42c84ce3b5c0161378c27f469","schema_version":"1.0","event_id":"sha256:c0d117bb37eb939c2c5f016668e4145e1c8d6bd42c84ce3b5c0161378c27f469"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:66MOSLIVGFBLIS4E3WC7IYXBYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Randomly Weighted Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Benjamin Raichel, Sariel Har-Peled","submitted_at":"2014-01-07T19:00:02Z","abstract_excerpt":"In this paper, we provide an $O(n \\mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or other more general objects. Here the randomness is on the weight of the sites, not their location. This compares favorably with the worst case complexity of these diagrams, which is quadratic. As a consequence we get an alternative proof to that of Agarwal etal [AHKS13] of the near linear complexity of the union of randomly expanded disjoint segments or convex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1477","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-18T02:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Dhivzxj2EXO7+u3Mlft86OQsoZVS3Wsr2z2cwn+rFEDi2el9uGcwp3XbXA+b4PGDf9BOEtGBQn2DlTaj5+MCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:16:57.526846Z"},"content_sha256":"39b23a4b1f43528f24f109cbc3fbd03ddd542b90699ca1fe54e5f1b6d02b7c20","schema_version":"1.0","event_id":"sha256:39b23a4b1f43528f24f109cbc3fbd03ddd542b90699ca1fe54e5f1b6d02b7c20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66MOSLIVGFBLIS4E3WC7IYXBYN/bundle.json","state_url":"https://pith.science/pith/66MOSLIVGFBLIS4E3WC7IYXBYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66MOSLIVGFBLIS4E3WC7IYXBYN/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-09T06:16:57Z","links":{"resolver":"https://pith.science/pith/66MOSLIVGFBLIS4E3WC7IYXBYN","bundle":"https://pith.science/pith/66MOSLIVGFBLIS4E3WC7IYXBYN/bundle.json","state":"https://pith.science/pith/66MOSLIVGFBLIS4E3WC7IYXBYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66MOSLIVGFBLIS4E3WC7IYXBYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:66MOSLIVGFBLIS4E3WC7IYXBYN","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":"3ed82c9649c51282c93f905292f1c935d5f7be011d35f063f57bb9effae2a79d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-07T19:00:02Z","title_canon_sha256":"cd291b85e9ad0ebda6b45ab0fd4631593a5c2d124ac04c823631ddd1b8be8836"},"schema_version":"1.0","source":{"id":"1401.1477","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1477","created_at":"2026-05-18T02:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1477v2","created_at":"2026-05-18T02:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1477","created_at":"2026-05-18T02:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"66MOSLIVGFBL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"66MOSLIVGFBLIS4E","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"66MOSLIV","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:39b23a4b1f43528f24f109cbc3fbd03ddd542b90699ca1fe54e5f1b6d02b7c20","target":"graph","created_at":"2026-05-18T02:20:49Z","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":"In this paper, we provide an $O(n \\mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or other more general objects. Here the randomness is on the weight of the sites, not their location. This compares favorably with the worst case complexity of these diagrams, which is quadratic. As a consequence we get an alternative proof to that of Agarwal etal [AHKS13] of the near linear complexity of the union of randomly expanded disjoint segments or convex ","authors_text":"Benjamin Raichel, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-07T19:00:02Z","title":"On the Complexity of Randomly Weighted Voronoi Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1477","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:c0d117bb37eb939c2c5f016668e4145e1c8d6bd42c84ce3b5c0161378c27f469","target":"record","created_at":"2026-05-18T02:20:49Z","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":"3ed82c9649c51282c93f905292f1c935d5f7be011d35f063f57bb9effae2a79d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-07T19:00:02Z","title_canon_sha256":"cd291b85e9ad0ebda6b45ab0fd4631593a5c2d124ac04c823631ddd1b8be8836"},"schema_version":"1.0","source":{"id":"1401.1477","kind":"arxiv","version":2}},"canonical_sha256":"f798e92d153142b44b84dd85f462e1c374633a75d243a60ca4cf124bdc76d6fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f798e92d153142b44b84dd85f462e1c374633a75d243a60ca4cf124bdc76d6fe","first_computed_at":"2026-05-18T02:20:49.891693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:49.891693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y/X4leHGQawlRgTjhyVqnCwq4Rn/b8o8nHLfHaXZJyNcv1ROHcI5focNpN7Oc7siRba2IMsMhtUASmhkMuU1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:49.892428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1477","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0d117bb37eb939c2c5f016668e4145e1c8d6bd42c84ce3b5c0161378c27f469","sha256:39b23a4b1f43528f24f109cbc3fbd03ddd542b90699ca1fe54e5f1b6d02b7c20"],"state_sha256":"029eac335224365a239d79743b9b4182f2f3c423d7bcea698a2221866d4dfe45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BAyh/te2iNd3S1ys7v7YpBOwvu0NvHDzuBwy37iLaHzcCT0bYd/DkrtVzqgZva8VLb0lc1T4dwaWsgWnUQZ0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:16:57.530875Z","bundle_sha256":"2fb5e7dfb35e883efa179fcdb934fb456d567fb0ed68054ec08a376f18da9efe"}}