{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ES6UTLFLOYNRYIYVWUEYAH27WR","short_pith_number":"pith:ES6UTLFL","canonical_record":{"source":{"id":"1306.5829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-25T02:04:58Z","cross_cats_sorted":["math.FA","math.PR"],"title_canon_sha256":"aada8e83c09350b63ddace5bf0abd31f6e0f4ca98e11ab13f3ff6c283549457b","abstract_canon_sha256":"0f51c015634ca847478a21158816f087261c6b722c8a0e9235ff0198dd3f79fc"},"schema_version":"1.0"},"canonical_sha256":"24bd49acab761b1c2315b509801f5fb44870374161687dea93c45b9925489a06","source":{"kind":"arxiv","id":"1306.5829","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5829","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5829v2","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5829","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"ES6UTLFLOYNR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ES6UTLFLOYNRYIYV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ES6UTLFL","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ES6UTLFLOYNRYIYVWUEYAH27WR","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-25T02:04:58Z","cross_cats_sorted":["math.FA","math.PR"],"title_canon_sha256":"aada8e83c09350b63ddace5bf0abd31f6e0f4ca98e11ab13f3ff6c283549457b","abstract_canon_sha256":"0f51c015634ca847478a21158816f087261c6b722c8a0e9235ff0198dd3f79fc"},"schema_version":"1.0"},"canonical_sha256":"24bd49acab761b1c2315b509801f5fb44870374161687dea93c45b9925489a06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:42.015800Z","signature_b64":"CSdZG8s6pwtxw91kes6swTkkYm96rzeUNDtSo915ykxN8FWaOjmx1j2BgUkxfTqrs4se2Z60aZV2VSJig1sqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24bd49acab761b1c2315b509801f5fb44870374161687dea93c45b9925489a06","last_reissued_at":"2026-05-18T03:18:42.014952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:42.014952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5829","source_version":2,"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-18T03:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8OR2ujm2wtniiKFFlO98107LzG3k++FzDzOoS2LCL0VcgthpBdqgsirI08GmZfnX5F6ZBIuWMbgXaLZK1dmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:10:39.145846Z"},"content_sha256":"289c5c0024b812f10f525a7440d9d8ba7a611443c2a1547a6bfa287c7826cccb","schema_version":"1.0","event_id":"sha256:289c5c0024b812f10f525a7440d9d8ba7a611443c2a1547a6bfa287c7826cccb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ES6UTLFLOYNRYIYVWUEYAH27WR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Cubic Algorithm for Computing Gaussian Volume","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.PR"],"primary_cat":"cs.DS","authors_text":"Ben Cousins, Santosh Vempala","submitted_at":"2013-06-25T02:04:58Z","abstract_excerpt":"We present randomized algorithms for sampling the standard Gaussian distribution restricted to a convex set and for estimating the Gaussian measure of a convex set, in the general membership oracle model. The complexity of integration is $O^*(n^3)$ while the complexity of sampling is $O^*(n^3)$ for the first sample and $O^*(n^2)$ for every subsequent sample. These bounds improve on the corresponding state-of-the-art by a factor of $n$. Our improvement comes from several aspects: better isoperimetry, smoother annealing, avoiding transformation to isotropic position and the use of the \"speedy wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5829","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":""},"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-18T03:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQigy6h2IZy+nfyzacpXOTFD5vSxJwU702z8odsvKVv5QOySGdbqmpPRYjKIB7hAYS7e91x3/PjW4sWqUtG9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:10:39.146396Z"},"content_sha256":"cbcd73cad7708e14e687b61930f848b241a008e852e16a30133f9a62417772de","schema_version":"1.0","event_id":"sha256:cbcd73cad7708e14e687b61930f848b241a008e852e16a30133f9a62417772de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ES6UTLFLOYNRYIYVWUEYAH27WR/bundle.json","state_url":"https://pith.science/pith/ES6UTLFLOYNRYIYVWUEYAH27WR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ES6UTLFLOYNRYIYVWUEYAH27WR/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-08-19T00:10:39Z","links":{"resolver":"https://pith.science/pith/ES6UTLFLOYNRYIYVWUEYAH27WR","bundle":"https://pith.science/pith/ES6UTLFLOYNRYIYVWUEYAH27WR/bundle.json","state":"https://pith.science/pith/ES6UTLFLOYNRYIYVWUEYAH27WR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ES6UTLFLOYNRYIYVWUEYAH27WR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ES6UTLFLOYNRYIYVWUEYAH27WR","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":"0f51c015634ca847478a21158816f087261c6b722c8a0e9235ff0198dd3f79fc","cross_cats_sorted":["math.FA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-25T02:04:58Z","title_canon_sha256":"aada8e83c09350b63ddace5bf0abd31f6e0f4ca98e11ab13f3ff6c283549457b"},"schema_version":"1.0","source":{"id":"1306.5829","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5829","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5829v2","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5829","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"ES6UTLFLOYNR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ES6UTLFLOYNRYIYV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ES6UTLFL","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:cbcd73cad7708e14e687b61930f848b241a008e852e16a30133f9a62417772de","target":"graph","created_at":"2026-05-18T03:18:42Z","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":"We present randomized algorithms for sampling the standard Gaussian distribution restricted to a convex set and for estimating the Gaussian measure of a convex set, in the general membership oracle model. The complexity of integration is $O^*(n^3)$ while the complexity of sampling is $O^*(n^3)$ for the first sample and $O^*(n^2)$ for every subsequent sample. These bounds improve on the corresponding state-of-the-art by a factor of $n$. Our improvement comes from several aspects: better isoperimetry, smoother annealing, avoiding transformation to isotropic position and the use of the \"speedy wa","authors_text":"Ben Cousins, Santosh Vempala","cross_cats":["math.FA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-25T02:04:58Z","title":"A Cubic Algorithm for Computing Gaussian Volume"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5829","kind":"arxiv","version":2},"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:289c5c0024b812f10f525a7440d9d8ba7a611443c2a1547a6bfa287c7826cccb","target":"record","created_at":"2026-05-18T03:18:42Z","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":"0f51c015634ca847478a21158816f087261c6b722c8a0e9235ff0198dd3f79fc","cross_cats_sorted":["math.FA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-25T02:04:58Z","title_canon_sha256":"aada8e83c09350b63ddace5bf0abd31f6e0f4ca98e11ab13f3ff6c283549457b"},"schema_version":"1.0","source":{"id":"1306.5829","kind":"arxiv","version":2}},"canonical_sha256":"24bd49acab761b1c2315b509801f5fb44870374161687dea93c45b9925489a06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24bd49acab761b1c2315b509801f5fb44870374161687dea93c45b9925489a06","first_computed_at":"2026-05-18T03:18:42.014952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:42.014952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSdZG8s6pwtxw91kes6swTkkYm96rzeUNDtSo915ykxN8FWaOjmx1j2BgUkxfTqrs4se2Z60aZV2VSJig1sqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:42.015800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5829","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:289c5c0024b812f10f525a7440d9d8ba7a611443c2a1547a6bfa287c7826cccb","sha256:cbcd73cad7708e14e687b61930f848b241a008e852e16a30133f9a62417772de"],"state_sha256":"fba05ea705cbb9a19f16b48bc7d5797f877e35f9d26f130c3f707cf930acb420"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMO4jeszk480ch+nX1mHlG4WGneiyvw3xFIh7BJ2gAPNt4jCdNv6czhRMvizyn0SWJ3oCLMr5ifceLSXJWQUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T00:10:39.151603Z","bundle_sha256":"01b775215efced26816da1c002ed1d47408a0c28cd34735761d0948ba0c610bd"}}