{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4W7GHFBUX5M2BYTSCAHWHIAJ43","short_pith_number":"pith:4W7GHFBU","schema_version":"1.0","canonical_sha256":"e5be639434bf59a0e272100f63a009e6c3ca422d423665a3c0f00fb153cdd541","source":{"kind":"arxiv","id":"2302.10249","version":1},"attestation_state":"computed","paper":{"title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.AP","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jason M. Altschuler, Sinho Chewi","submitted_at":"2023-02-20T19:27:21Z","abstract_excerpt":"Understanding the complexity of sampling from a strongly log-concave and log-smooth distribution $\\pi$ on $\\mathbb{R}^d$ to high accuracy is a fundamental problem, both from a practical and theoretical standpoint. In practice, high-accuracy samplers such as the classical Metropolis-adjusted Langevin algorithm (MALA) remain the de facto gold standard; and in theory, via the proximal sampler reduction, it is understood that such samplers are key for sampling even beyond log-concavity (in particular, for distributions satisfying isoperimetric assumptions).\n  In this work, we improve the dimension"},"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":"2302.10249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2023-02-20T19:27:21Z","cross_cats_sorted":["cs.DS","cs.LG","math.AP","stat.ML","stat.TH"],"title_canon_sha256":"5509b20f4b5d0b4eb44b7e33bcf37e868968063a8a54c430fbcc9f9908baa195","abstract_canon_sha256":"80061e0ce75a3eb0c56babf87cef550ba2d9caa590657607461b17c372d8a86f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:36.847350Z","signature_b64":"II16262zzuhbb5Qe+d4G+SJb16VdtrkiQqkI9fqEEAEy2wJPFLXCBky4Iyd/W3YfPW+qwGHwcNbfbuCXkBoWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5be639434bf59a0e272100f63a009e6c3ca422d423665a3c0f00fb153cdd541","last_reissued_at":"2026-07-05T05:43:36.846903Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:36.846903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.AP","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jason M. Altschuler, Sinho Chewi","submitted_at":"2023-02-20T19:27:21Z","abstract_excerpt":"Understanding the complexity of sampling from a strongly log-concave and log-smooth distribution $\\pi$ on $\\mathbb{R}^d$ to high accuracy is a fundamental problem, both from a practical and theoretical standpoint. In practice, high-accuracy samplers such as the classical Metropolis-adjusted Langevin algorithm (MALA) remain the de facto gold standard; and in theory, via the proximal sampler reduction, it is understood that such samplers are key for sampling even beyond log-concavity (in particular, for distributions satisfying isoperimetric assumptions).\n  In this work, we improve the dimension"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10249","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.10249/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":"2302.10249","created_at":"2026-07-05T05:43:36.846969+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.10249v1","created_at":"2026-07-05T05:43:36.846969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10249","created_at":"2026-07-05T05:43:36.846969+00:00"},{"alias_kind":"pith_short_12","alias_value":"4W7GHFBUX5M2","created_at":"2026-07-05T05:43:36.846969+00:00"},{"alias_kind":"pith_short_16","alias_value":"4W7GHFBUX5M2BYTS","created_at":"2026-07-05T05:43:36.846969+00:00"},{"alias_kind":"pith_short_8","alias_value":"4W7GHFBU","created_at":"2026-07-05T05:43:36.846969+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01693","citing_title":"A Mathematical Introduction to Diffusion Models","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43","json":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43.json","graph_json":"https://pith.science/api/pith-number/4W7GHFBUX5M2BYTSCAHWHIAJ43/graph.json","events_json":"https://pith.science/api/pith-number/4W7GHFBUX5M2BYTSCAHWHIAJ43/events.json","paper":"https://pith.science/paper/4W7GHFBU"},"agent_actions":{"view_html":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43","download_json":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43.json","view_paper":"https://pith.science/paper/4W7GHFBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.10249&json=true","fetch_graph":"https://pith.science/api/pith-number/4W7GHFBUX5M2BYTSCAHWHIAJ43/graph.json","fetch_events":"https://pith.science/api/pith-number/4W7GHFBUX5M2BYTSCAHWHIAJ43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43/action/storage_attestation","attest_author":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43/action/author_attestation","sign_citation":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43/action/citation_signature","submit_replication":"https://pith.science/pith/4W7GHFBUX5M2BYTSCAHWHIAJ43/action/replication_record"}},"created_at":"2026-07-05T05:43:36.846969+00:00","updated_at":"2026-07-05T05:43:36.846969+00:00"}