{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:6QTO73Q5RQTDI2XGYGKXP7AWQN","short_pith_number":"pith:6QTO73Q5","schema_version":"1.0","canonical_sha256":"f426efee1d8c26346ae6c19577fc16836687aab8920e42118eb2a2e8b06a2680","source":{"kind":"arxiv","id":"cs/0608054","version":2},"attestation_state":"computed","paper":{"title":"Dispersion of Mass and the Complexity of Randomized Geometric Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS","math.FA"],"primary_cat":"cs.CC","authors_text":"Luis Rademacher, Santosh Vempala","submitted_at":"2006-08-12T23:31:07Z","abstract_excerpt":"How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in R^n (the current best algorithm has complexity roughly n^4, conjectured to be n^3). Our main tools, dispersion of random determinants and dispersion of the length of a random point from a convex body, are of independent interest and applicable mo"},"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":"cs/0608054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2006-08-12T23:31:07Z","cross_cats_sorted":["cs.CG","cs.DS","math.FA"],"title_canon_sha256":"07526509ddc540435d9918bd6a39323f53cdf093d02bd67e0b9871216d69d2b9","abstract_canon_sha256":"63cc8d4c702b3aedda36cd7ae28abb4172cda101cac3c6003a81a4a369c91b48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:12:14.942046Z","signature_b64":"kxli5LGcGJXJTFyhx/CJ+QESl4QZJ2lIhD0j8Svu3mIoNovoSSNpeYcPBLcBMnw+rx/d5vhzrViaFqzGQ132Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f426efee1d8c26346ae6c19577fc16836687aab8920e42118eb2a2e8b06a2680","last_reissued_at":"2026-07-04T15:12:14.941629Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:12:14.941629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dispersion of Mass and the Complexity of Randomized Geometric Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS","math.FA"],"primary_cat":"cs.CC","authors_text":"Luis Rademacher, Santosh Vempala","submitted_at":"2006-08-12T23:31:07Z","abstract_excerpt":"How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in R^n (the current best algorithm has complexity roughly n^4, conjectured to be n^3). Our main tools, dispersion of random determinants and dispersion of the length of a random point from a convex body, are of independent interest and applicable mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0608054","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0608054/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0608054","created_at":"2026-07-04T15:12:14.941685+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0608054v2","created_at":"2026-07-04T15:12:14.941685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0608054","created_at":"2026-07-04T15:12:14.941685+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QTO73Q5RQTD","created_at":"2026-07-04T15:12:14.941685+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QTO73Q5RQTDI2XG","created_at":"2026-07-04T15:12:14.941685+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QTO73Q5","created_at":"2026-07-04T15:12:14.941685+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03903","citing_title":"Quantum algorithm for estimating volumes of convex bodies","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN","json":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN.json","graph_json":"https://pith.science/api/pith-number/6QTO73Q5RQTDI2XGYGKXP7AWQN/graph.json","events_json":"https://pith.science/api/pith-number/6QTO73Q5RQTDI2XGYGKXP7AWQN/events.json","paper":"https://pith.science/paper/6QTO73Q5"},"agent_actions":{"view_html":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN","download_json":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN.json","view_paper":"https://pith.science/paper/6QTO73Q5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0608054&json=true","fetch_graph":"https://pith.science/api/pith-number/6QTO73Q5RQTDI2XGYGKXP7AWQN/graph.json","fetch_events":"https://pith.science/api/pith-number/6QTO73Q5RQTDI2XGYGKXP7AWQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN/action/storage_attestation","attest_author":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN/action/author_attestation","sign_citation":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN/action/citation_signature","submit_replication":"https://pith.science/pith/6QTO73Q5RQTDI2XGYGKXP7AWQN/action/replication_record"}},"created_at":"2026-07-04T15:12:14.941685+00:00","updated_at":"2026-07-04T15:12:14.941685+00:00"}