{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:754HICQRWHOE7SMHXS4TB5SMA3","short_pith_number":"pith:754HICQR","canonical_record":{"source":{"id":"1911.01469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-11-04T19:57:38Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"5aaba9ab7b52d467862c1ca069383c2ea03f2622337b38402a17b663f37353c4","abstract_canon_sha256":"81523abdd85c64fef1d85bebff11cec077040aafc8421beb68143acf61814d1f"},"schema_version":"1.0"},"canonical_sha256":"ff78740a11b1dc4fc987bcb930f64c06ce58a048a5578fa85b6e0fe8bc8df192","source":{"kind":"arxiv","id":"1911.01469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.01469","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1911.01469v1","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01469","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"754HICQRWHOE","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"pith_short_16","alias_value":"754HICQRWHOE7SMH","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"pith_short_8","alias_value":"754HICQR","created_at":"2026-07-05T00:16:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:754HICQRWHOE7SMHXS4TB5SMA3","target":"record","payload":{"canonical_record":{"source":{"id":"1911.01469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-11-04T19:57:38Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"5aaba9ab7b52d467862c1ca069383c2ea03f2622337b38402a17b663f37353c4","abstract_canon_sha256":"81523abdd85c64fef1d85bebff11cec077040aafc8421beb68143acf61814d1f"},"schema_version":"1.0"},"canonical_sha256":"ff78740a11b1dc4fc987bcb930f64c06ce58a048a5578fa85b6e0fe8bc8df192","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:51.087435Z","signature_b64":"kwd6uReED760cXmm2VLUzzvjDOHIBI35fRI3uy9DQgf0nN1ahZ92nWdPzAHNAdUVgFl9Fpifnqn3PUUDp7UODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff78740a11b1dc4fc987bcb930f64c06ce58a048a5578fa85b6e0fe8bc8df192","last_reissued_at":"2026-07-05T00:16:51.086978Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:51.086978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.01469","source_version":1,"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-07-05T00:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEJGr626Msh3rmwden4Y3VKOc6q8CBJ0iSAD9/JEy7JsmzCMrCjI4tOcrogkH3+LZpSfymdN8OmQzivI7eMyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T21:19:42.828138Z"},"content_sha256":"18f28c295b14d37c0c7919f7539ba997595140400fbd7764690a594dae3c726b","schema_version":"1.0","event_id":"sha256:18f28c295b14d37c0c7919f7539ba997595140400fbd7764690a594dae3c726b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:754HICQRWHOE7SMHXS4TB5SMA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Andre Wibisono","submitted_at":"2019-11-04T19:57:38Z","abstract_excerpt":"We study the Proximal Langevin Algorithm (PLA) for sampling from a probability distribution $\\nu = e^{-f}$ on $\\mathbb{R}^n$ under isoperimetry. We prove a convergence guarantee for PLA in Kullback-Leibler (KL) divergence when $\\nu$ satisfies log-Sobolev inequality (LSI) and $f$ has bounded second and third derivatives. This improves on the result for the Unadjusted Langevin Algorithm (ULA), and matches the fastest known rate for sampling under LSI (without Metropolis filter) with a better dependence on the LSI constant. We also prove convergence guarantees for PLA in R\\'enyi divergence of ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01469","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/1911.01469/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"},"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-07-05T00:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjQsQN2zTZEKfC69SXLHT/J90Fi3wCCR7vkOUD2HDs3SHcZTqz7nvxVeUvh9fFrsslm2DMPrkKph5ZhtgkYSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T21:19:42.828699Z"},"content_sha256":"fa76d33f1623134539c2c484e6395a8dfb6e83fd96d54153db14af058d21686c","schema_version":"1.0","event_id":"sha256:fa76d33f1623134539c2c484e6395a8dfb6e83fd96d54153db14af058d21686c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/754HICQRWHOE7SMHXS4TB5SMA3/bundle.json","state_url":"https://pith.science/pith/754HICQRWHOE7SMHXS4TB5SMA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/754HICQRWHOE7SMHXS4TB5SMA3/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-09T21:19:42Z","links":{"resolver":"https://pith.science/pith/754HICQRWHOE7SMHXS4TB5SMA3","bundle":"https://pith.science/pith/754HICQRWHOE7SMHXS4TB5SMA3/bundle.json","state":"https://pith.science/pith/754HICQRWHOE7SMHXS4TB5SMA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/754HICQRWHOE7SMHXS4TB5SMA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:754HICQRWHOE7SMHXS4TB5SMA3","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":"81523abdd85c64fef1d85bebff11cec077040aafc8421beb68143acf61814d1f","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-11-04T19:57:38Z","title_canon_sha256":"5aaba9ab7b52d467862c1ca069383c2ea03f2622337b38402a17b663f37353c4"},"schema_version":"1.0","source":{"id":"1911.01469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.01469","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1911.01469v1","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01469","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"754HICQRWHOE","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"pith_short_16","alias_value":"754HICQRWHOE7SMH","created_at":"2026-07-05T00:16:51Z"},{"alias_kind":"pith_short_8","alias_value":"754HICQR","created_at":"2026-07-05T00:16:51Z"}],"graph_snapshots":[{"event_id":"sha256:fa76d33f1623134539c2c484e6395a8dfb6e83fd96d54153db14af058d21686c","target":"graph","created_at":"2026-07-05T00:16:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.01469/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the Proximal Langevin Algorithm (PLA) for sampling from a probability distribution $\\nu = e^{-f}$ on $\\mathbb{R}^n$ under isoperimetry. We prove a convergence guarantee for PLA in Kullback-Leibler (KL) divergence when $\\nu$ satisfies log-Sobolev inequality (LSI) and $f$ has bounded second and third derivatives. This improves on the result for the Unadjusted Langevin Algorithm (ULA), and matches the fastest known rate for sampling under LSI (without Metropolis filter) with a better dependence on the LSI constant. We also prove convergence guarantees for PLA in R\\'enyi divergence of ord","authors_text":"Andre Wibisono","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-11-04T19:57:38Z","title":"Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01469","kind":"arxiv","version":1},"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:18f28c295b14d37c0c7919f7539ba997595140400fbd7764690a594dae3c726b","target":"record","created_at":"2026-07-05T00:16:51Z","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":"81523abdd85c64fef1d85bebff11cec077040aafc8421beb68143acf61814d1f","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-11-04T19:57:38Z","title_canon_sha256":"5aaba9ab7b52d467862c1ca069383c2ea03f2622337b38402a17b663f37353c4"},"schema_version":"1.0","source":{"id":"1911.01469","kind":"arxiv","version":1}},"canonical_sha256":"ff78740a11b1dc4fc987bcb930f64c06ce58a048a5578fa85b6e0fe8bc8df192","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff78740a11b1dc4fc987bcb930f64c06ce58a048a5578fa85b6e0fe8bc8df192","first_computed_at":"2026-07-05T00:16:51.086978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:51.086978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kwd6uReED760cXmm2VLUzzvjDOHIBI35fRI3uy9DQgf0nN1ahZ92nWdPzAHNAdUVgFl9Fpifnqn3PUUDp7UODg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:51.087435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.01469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18f28c295b14d37c0c7919f7539ba997595140400fbd7764690a594dae3c726b","sha256:fa76d33f1623134539c2c484e6395a8dfb6e83fd96d54153db14af058d21686c"],"state_sha256":"3651414f1e5d52017455fe9cd4a4868937a39707870d24cf83747a141a7beccb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lr7nownnBZ8Zf6vyECHkDkZIJfYwZF/pmPreK5Fk5wAqhE9W94EeJLgdLYdwy3bpNbBYZ9bGgnP574ZMtI5FAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T21:19:42.834831Z","bundle_sha256":"f6292818a1e9d65768e47f51172d0898b019b65739be263c928e82ef6bd59ab3"}}