{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IA3T2LQE7TM36H453E77R7FEU2","short_pith_number":"pith:IA3T2LQE","schema_version":"1.0","canonical_sha256":"40373d2e04fcd9bf1f9dd93ff8fca4a68b7f6169d502dc79c9ed455c157c7bc8","source":{"kind":"arxiv","id":"1412.7392","version":6},"attestation_state":"computed","paper":{"title":"Theoretical guarantees for approximate sampling from smooth and log-concave densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.CO","authors_text":"Arnak S. Dalalyan","submitted_at":"2014-12-23T15:00:57Z","abstract_excerpt":"Sampling from various kinds of distributions is an issue of paramount importance in statistics since it is often the key ingredient for constructing estimators, test procedures or confidence intervals. In many situations, the exact sampling from a given distribution is impossible or computationally expensive and, therefore, one needs to resort to approximate sampling strategies. However, there is no well-developed theory providing meaningful nonasymptotic guarantees for the approximate sampling procedures, especially in the high-dimensional problems. This paper makes some progress in this dire"},"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":"1412.7392","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-23T15:00:57Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"e3a62b976121c727dbc162542e74f232863a06b763ec1ff01a0ec8abbb4a3e51","abstract_canon_sha256":"084ad57d41937dddf2a775507765f7f1666ebde4cfc07410d3a2845a3f785fcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.646871Z","signature_b64":"tRy/Zvg9VYxHEOTSd/ZgP2qzHCndJEX2p+McDHWdmRHcqH6eO+EQwn6a64kFWsugFuF1qDu7fvIx/4TcCEqWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40373d2e04fcd9bf1f9dd93ff8fca4a68b7f6169d502dc79c9ed455c157c7bc8","last_reissued_at":"2026-05-18T00:55:58.646212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.646212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Theoretical guarantees for approximate sampling from smooth and log-concave densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.CO","authors_text":"Arnak S. Dalalyan","submitted_at":"2014-12-23T15:00:57Z","abstract_excerpt":"Sampling from various kinds of distributions is an issue of paramount importance in statistics since it is often the key ingredient for constructing estimators, test procedures or confidence intervals. In many situations, the exact sampling from a given distribution is impossible or computationally expensive and, therefore, one needs to resort to approximate sampling strategies. However, there is no well-developed theory providing meaningful nonasymptotic guarantees for the approximate sampling procedures, especially in the high-dimensional problems. This paper makes some progress in this dire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7392","kind":"arxiv","version":6},"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":"1412.7392","created_at":"2026-05-18T00:55:58.646303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7392v6","created_at":"2026-05-18T00:55:58.646303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7392","created_at":"2026-05-18T00:55:58.646303+00:00"},{"alias_kind":"pith_short_12","alias_value":"IA3T2LQE7TM3","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IA3T2LQE7TM36H45","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IA3T2LQE","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19809","citing_title":"Deterministic Volume Estimation of Truncated Hypercubes","ref_index":144,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2","json":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2.json","graph_json":"https://pith.science/api/pith-number/IA3T2LQE7TM36H453E77R7FEU2/graph.json","events_json":"https://pith.science/api/pith-number/IA3T2LQE7TM36H453E77R7FEU2/events.json","paper":"https://pith.science/paper/IA3T2LQE"},"agent_actions":{"view_html":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2","download_json":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2.json","view_paper":"https://pith.science/paper/IA3T2LQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7392&json=true","fetch_graph":"https://pith.science/api/pith-number/IA3T2LQE7TM36H453E77R7FEU2/graph.json","fetch_events":"https://pith.science/api/pith-number/IA3T2LQE7TM36H453E77R7FEU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2/action/storage_attestation","attest_author":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2/action/author_attestation","sign_citation":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2/action/citation_signature","submit_replication":"https://pith.science/pith/IA3T2LQE7TM36H453E77R7FEU2/action/replication_record"}},"created_at":"2026-05-18T00:55:58.646303+00:00","updated_at":"2026-05-18T00:55:58.646303+00:00"}