{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UQKDEYQYNHIZMK3QACK3EEGVVO","short_pith_number":"pith:UQKDEYQY","schema_version":"1.0","canonical_sha256":"a41432621869d1962b700095b210d5abad68d00abc4e2f01450cf01567332d66","source":{"kind":"arxiv","id":"1808.02356","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.02356","created_at":"2026-05-18T00:08:46.772064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02356v1","created_at":"2026-05-18T00:08:46.772064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02356","created_at":"2026-05-18T00:08:46.772064+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQKDEYQYNHIZ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQKDEYQYNHIZMK3Q","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQKDEYQY","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO","json":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO.json","graph_json":"https://pith.science/api/pith-number/UQKDEYQYNHIZMK3QACK3EEGVVO/graph.json","events_json":"https://pith.science/api/pith-number/UQKDEYQYNHIZMK3QACK3EEGVVO/events.json","paper":"https://pith.science/paper/UQKDEYQY"},"agent_actions":{"view_html":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO","download_json":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO.json","view_paper":"https://pith.science/paper/UQKDEYQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02356&json=true","fetch_graph":"https://pith.science/api/pith-number/UQKDEYQYNHIZMK3QACK3EEGVVO/graph.json","fetch_events":"https://pith.science/api/pith-number/UQKDEYQYNHIZMK3QACK3EEGVVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/action/storage_attestation","attest_author":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/action/author_attestation","sign_citation":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/action/citation_signature","submit_replication":"https://pith.science/pith/UQKDEYQYNHIZMK3QACK3EEGVVO/action/replication_record"}},"created_at":"2026-05-18T00:08:46.772064+00:00","updated_at":"2026-05-18T00:08:46.772064+00:00"}