{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3JZB2E3E7ENO3BODCVBDD5YBZ6","short_pith_number":"pith:3JZB2E3E","schema_version":"1.0","canonical_sha256":"da721d1364f91aed85c3154231f701cf98420402a5e7244df8b78428c8586f13","source":{"kind":"arxiv","id":"1111.5340","version":1},"attestation_state":"computed","paper":{"title":"On the Expected Complexity of Random Convex Hulls","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled","submitted_at":"2011-11-22T21:17:34Z","abstract_excerpt":"In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape.\n  (i) We show that the expected number of vertices of the convex hull of $n$ points, chosen uniformly and independently from a disk is $O(n^{1/3})$, and $O(k \\log{n})$ for the case a convex polygon with $k$ sides. Those results are well known (see \\cite{rs-udkhv-63,r-slcdn-70,ps-cgi-85}), but we believe that the elementary proof given here are simpler and more intuitive.\n  (ii) Let $\\D$ be a set of directions in the plane, we define a genera"},"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":"1111.5340","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2011-11-22T21:17:34Z","cross_cats_sorted":[],"title_canon_sha256":"fc6d3bcb3624e507e8922a027a99a68f945171c93b81bbdb98dc55c765e49930","abstract_canon_sha256":"c10ac947c9351fdb5f573ce6320465582d22a9027a465829fed9e43addf2c174"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:52.228999Z","signature_b64":"OXMHbdQ1pKF+iETK1bA0pLgrl29lGKjDLuVfTkV9idsnSplHF3vEZ47Cbw8v9/E/mtC2Cro2nCAuhiYUlujpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da721d1364f91aed85c3154231f701cf98420402a5e7244df8b78428c8586f13","last_reissued_at":"2026-05-18T04:07:52.228377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:52.228377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Expected Complexity of Random Convex Hulls","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled","submitted_at":"2011-11-22T21:17:34Z","abstract_excerpt":"In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape.\n  (i) We show that the expected number of vertices of the convex hull of $n$ points, chosen uniformly and independently from a disk is $O(n^{1/3})$, and $O(k \\log{n})$ for the case a convex polygon with $k$ sides. Those results are well known (see \\cite{rs-udkhv-63,r-slcdn-70,ps-cgi-85}), but we believe that the elementary proof given here are simpler and more intuitive.\n  (ii) Let $\\D$ be a set of directions in the plane, we define a genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5340","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":"1111.5340","created_at":"2026-05-18T04:07:52.228471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5340v1","created_at":"2026-05-18T04:07:52.228471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5340","created_at":"2026-05-18T04:07:52.228471+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JZB2E3E7ENO","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JZB2E3E7ENO3BOD","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JZB2E3E","created_at":"2026-05-18T12:26:18.847500+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/3JZB2E3E7ENO3BODCVBDD5YBZ6","json":"https://pith.science/pith/3JZB2E3E7ENO3BODCVBDD5YBZ6.json","graph_json":"https://pith.science/api/pith-number/3JZB2E3E7ENO3BODCVBDD5YBZ6/graph.json","events_json":"https://pith.science/api/pith-number/3JZB2E3E7ENO3BODCVBDD5YBZ6/events.json","paper":"https://pith.science/paper/3JZB2E3E"},"agent_actions":{"view_html":"https://pith.science/pith/3JZB2E3E7ENO3BODCVBDD5YBZ6","download_json":"https://pith.science/pith/3JZB2E3E7ENO3BODCVBDD5YBZ6.json","view_paper":"https://pith.science/paper/3JZB2E3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5340&json=true","fetch_graph":"https://pith.science/api/pith-number/3JZB2E3E7ENO3BODCVBDD5YBZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/3JZB2E3E7ENO3BODCVBDD5YBZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JZB2E3E7ENO3BODCVBDD5YBZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JZB2E3E7ENO3BODCVBDD5YBZ6/action/storage_attestation","attest_author":"https://pith.science/pith/3JZB2E3E7ENO3BODCVBDD5YBZ6/action/author_attestation","sign_citation":"https://pith.science/pith/3JZB2E3E7ENO3BODCVBDD5YBZ6/action/citation_signature","submit_replication":"https://pith.science/pith/3JZB2E3E7ENO3BODCVBDD5YBZ6/action/replication_record"}},"created_at":"2026-05-18T04:07:52.228471+00:00","updated_at":"2026-05-18T04:07:52.228471+00:00"}