{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UQKDEYQYNHIZMK3QACK3EEGVVO","short_pith_number":"pith:UQKDEYQY","canonical_record":{"source":{"id":"1808.02356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-07T13:31:30Z","cross_cats_sorted":[],"title_canon_sha256":"1500b5f9fc2b6989d85b69e8607065e9e9f038609cdbe6a6e14006819a6d1f99","abstract_canon_sha256":"38adc41bd1e751ce1422240307a7154a8c5b119ba7b4c1b81d7b48e705cfa054"},"schema_version":"1.0"},"canonical_sha256":"a41432621869d1962b700095b210d5abad68d00abc4e2f01450cf01567332d66","source":{"kind":"arxiv","id":"1808.02356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02356","created_at":"2026-05-18T00:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02356v1","created_at":"2026-05-18T00:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02356","created_at":"2026-05-18T00:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"UQKDEYQYNHIZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQKDEYQYNHIZMK3Q","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQKDEYQY","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UQKDEYQYNHIZMK3QACK3EEGVVO","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-07T13:31:30Z","cross_cats_sorted":[],"title_canon_sha256":"1500b5f9fc2b6989d85b69e8607065e9e9f038609cdbe6a6e14006819a6d1f99","abstract_canon_sha256":"38adc41bd1e751ce1422240307a7154a8c5b119ba7b4c1b81d7b48e705cfa054"},"schema_version":"1.0"},"canonical_sha256":"a41432621869d1962b700095b210d5abad68d00abc4e2f01450cf01567332d66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:46.772651Z","signature_b64":"VqGC3Mklv9t0D9wYSivYLFy9HlnlfROHStWu4chyUlQqcvKYxzmu47jl88WCSQITm1nK20c0lagT1iKYCwwcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a41432621869d1962b700095b210d5abad68d00abc4e2f01450cf01567332d66","last_reissued_at":"2026-05-18T00:08:46.771973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:46.771973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02356","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:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mKwPzug1jCuYYWK8bbMQoTr7aREMZhJbHa0gxg5Y7Cdtnh9a3+qWssb7PHFzvNXUxDBPu5jbDesgVoJvSfPhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:35:16.975058Z"},"content_sha256":"9261b9755acf9573c2ef5675d3fa704ed1262b7c8fe22a4ead4c0a747119ef8f","schema_version":"1.0","event_id":"sha256:9261b9755acf9573c2ef5675d3fa704ed1262b7c8fe22a4ead4c0a747119ef8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UQKDEYQYNHIZMK3QACK3EEGVVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On tail estimates for Randomized Incremental Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sandeep Sen","submitted_at":"2018-08-07T13:31:30Z","abstract_excerpt":"By combining several interesting applications of random sampling in geometric algorithms like point location, linear programming, segment intersections, binary space partitioning, Clarkson and Shor \\cite{CS89} developed a general framework of randomized incremental construction (RIC ). The basic idea is to add objects in a random order and show that this approach yields efficient/optimal bounds on {\\bf expected} running time. Even quicksort can be viewed as a special case of this paradigm. However, unlike quicksort, for most of these problems, attempts to obtain sharper tail estimates on the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02356","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:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pqJFouQpFRVygv/M7i/Mml41OsFE3jtKza+K7soVVUT/Wb4Vj49VxWhEBl3Xl+qM9PQ3dGzvhv3Q7n1HXSk/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:35:16.975408Z"},"content_sha256":"f10175a83347f0bd9ef1ef207214b6c4025b61365bec5808c4456c63ed12b2ee","schema_version":"1.0","event_id":"sha256:f10175a83347f0bd9ef1ef207214b6c4025b61365bec5808c4456c63ed12b2ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/bundle.json","state_url":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/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-03T00:35:16Z","links":{"resolver":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO","bundle":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/bundle.json","state":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UQKDEYQYNHIZMK3QACK3EEGVVO","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":"38adc41bd1e751ce1422240307a7154a8c5b119ba7b4c1b81d7b48e705cfa054","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-07T13:31:30Z","title_canon_sha256":"1500b5f9fc2b6989d85b69e8607065e9e9f038609cdbe6a6e14006819a6d1f99"},"schema_version":"1.0","source":{"id":"1808.02356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02356","created_at":"2026-05-18T00:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02356v1","created_at":"2026-05-18T00:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02356","created_at":"2026-05-18T00:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"UQKDEYQYNHIZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQKDEYQYNHIZMK3Q","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQKDEYQY","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:f10175a83347f0bd9ef1ef207214b6c4025b61365bec5808c4456c63ed12b2ee","target":"graph","created_at":"2026-05-18T00:08:46Z","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":"By combining several interesting applications of random sampling in geometric algorithms like point location, linear programming, segment intersections, binary space partitioning, Clarkson and Shor \\cite{CS89} developed a general framework of randomized incremental construction (RIC ). The basic idea is to add objects in a random order and show that this approach yields efficient/optimal bounds on {\\bf expected} running time. Even quicksort can be viewed as a special case of this paradigm. However, unlike quicksort, for most of these problems, attempts to obtain sharper tail estimates on the r","authors_text":"Sandeep Sen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-07T13:31:30Z","title":"On tail estimates for Randomized Incremental Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02356","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:9261b9755acf9573c2ef5675d3fa704ed1262b7c8fe22a4ead4c0a747119ef8f","target":"record","created_at":"2026-05-18T00:08:46Z","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":"38adc41bd1e751ce1422240307a7154a8c5b119ba7b4c1b81d7b48e705cfa054","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-07T13:31:30Z","title_canon_sha256":"1500b5f9fc2b6989d85b69e8607065e9e9f038609cdbe6a6e14006819a6d1f99"},"schema_version":"1.0","source":{"id":"1808.02356","kind":"arxiv","version":1}},"canonical_sha256":"a41432621869d1962b700095b210d5abad68d00abc4e2f01450cf01567332d66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a41432621869d1962b700095b210d5abad68d00abc4e2f01450cf01567332d66","first_computed_at":"2026-05-18T00:08:46.771973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:46.771973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VqGC3Mklv9t0D9wYSivYLFy9HlnlfROHStWu4chyUlQqcvKYxzmu47jl88WCSQITm1nK20c0lagT1iKYCwwcBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:46.772651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9261b9755acf9573c2ef5675d3fa704ed1262b7c8fe22a4ead4c0a747119ef8f","sha256:f10175a83347f0bd9ef1ef207214b6c4025b61365bec5808c4456c63ed12b2ee"],"state_sha256":"b303172d17d33f8b2635f2d1683bc7a57af4fbbd685a330ec06ac5a12fe32926"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmtRjbqM5LT1skmp7XS0d6EP7uQMC2Rh9ih8fFHLE2VR7hEh2/+urK1M0KS1GWrlEUdUtN3u7kqjD50rBaipAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:35:16.977277Z","bundle_sha256":"256317258c701e83dc767f765d70b31181b81da07eb010a8745a133da3d98a96"}}