{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7KD7SB6YHHAAPT77OZ5L6MB6JN","short_pith_number":"pith:7KD7SB6Y","schema_version":"1.0","canonical_sha256":"fa87f907d839c007cfff767abf303e4b7313884ae72a98fa3b47e0cc87faa14a","source":{"kind":"arxiv","id":"1409.6011","version":3},"attestation_state":"computed","paper":{"title":"Gaussian Cooling and O*(n^3) Algorithms for Volume and Gaussian Volume","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.FA"],"primary_cat":"cs.DS","authors_text":"Ben Cousins, Santosh Vempala","submitted_at":"2014-09-21T16:33:53Z","abstract_excerpt":"We present an $O^*(n^3)$ randomized algorithm for estimating the volume of a well-rounded convex body given by a membership oracle, improving on the previous best complexity of $O^*(n^4)$. The new algorithmic ingredient is an accelerated cooling schedule where the rate of cooling increases with the temperature. Previously, the known approach for potentially achieving this asymptotic complexity relied on a positive resolution of the KLS hyperplane conjecture, a central open problem in convex geometry.\n  We also obtain an $O^*(n^3)$ randomized algorithm for integrating a standard Gaussian distri"},"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":"1409.6011","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-21T16:33:53Z","cross_cats_sorted":["cs.CC","math.FA"],"title_canon_sha256":"39fc3ef0b78cf7a9ec780effa5b402195bbbb3ca10998b8c57295954053a89a7","abstract_canon_sha256":"03d4baaa54a882eaabe381c77a8c060c154f297e841eee250b1501fb3a5ac48a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.697124Z","signature_b64":"PSo3vS5tqQLJkhMIxf18Ue020fU79/No5g6XFutlOtR7oeUd1AyXrWVxsLMPmwjVQUq5S4QBaj6gSfu52MlaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa87f907d839c007cfff767abf303e4b7313884ae72a98fa3b47e0cc87faa14a","last_reissued_at":"2026-05-18T00:55:58.696575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.696575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian Cooling and O*(n^3) Algorithms for Volume and Gaussian Volume","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.FA"],"primary_cat":"cs.DS","authors_text":"Ben Cousins, Santosh Vempala","submitted_at":"2014-09-21T16:33:53Z","abstract_excerpt":"We present an $O^*(n^3)$ randomized algorithm for estimating the volume of a well-rounded convex body given by a membership oracle, improving on the previous best complexity of $O^*(n^4)$. The new algorithmic ingredient is an accelerated cooling schedule where the rate of cooling increases with the temperature. Previously, the known approach for potentially achieving this asymptotic complexity relied on a positive resolution of the KLS hyperplane conjecture, a central open problem in convex geometry.\n  We also obtain an $O^*(n^3)$ randomized algorithm for integrating a standard Gaussian distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6011","kind":"arxiv","version":3},"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":"1409.6011","created_at":"2026-05-18T00:55:58.696669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6011v3","created_at":"2026-05-18T00:55:58.696669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6011","created_at":"2026-05-18T00:55:58.696669+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KD7SB6YHHAA","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KD7SB6YHHAAPT77","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KD7SB6Y","created_at":"2026-05-18T12:28:19.803747+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":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN","json":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN.json","graph_json":"https://pith.science/api/pith-number/7KD7SB6YHHAAPT77OZ5L6MB6JN/graph.json","events_json":"https://pith.science/api/pith-number/7KD7SB6YHHAAPT77OZ5L6MB6JN/events.json","paper":"https://pith.science/paper/7KD7SB6Y"},"agent_actions":{"view_html":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN","download_json":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN.json","view_paper":"https://pith.science/paper/7KD7SB6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6011&json=true","fetch_graph":"https://pith.science/api/pith-number/7KD7SB6YHHAAPT77OZ5L6MB6JN/graph.json","fetch_events":"https://pith.science/api/pith-number/7KD7SB6YHHAAPT77OZ5L6MB6JN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN/action/storage_attestation","attest_author":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN/action/author_attestation","sign_citation":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN/action/citation_signature","submit_replication":"https://pith.science/pith/7KD7SB6YHHAAPT77OZ5L6MB6JN/action/replication_record"}},"created_at":"2026-05-18T00:55:58.696669+00:00","updated_at":"2026-05-18T00:55:58.696669+00:00"}