{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PT3M4ET4HA27P7TV5OSAUPHOJB","short_pith_number":"pith:PT3M4ET4","canonical_record":{"source":{"id":"1501.00438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-01-02T17:18:56Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"1651cb3bfd01b97dfa6b1270c749541fac89485d4f454c7fbb8ab8a091d91d9a","abstract_canon_sha256":"b7fac6e570e7c9b0d97cf883b43beebbdaaf3b8627827638ebeaff999fec1156"},"schema_version":"1.0"},"canonical_sha256":"7cf6ce127c3835f7fe75eba40a3cee4841cfa3503201d8a458ebedf8a39ca119","source":{"kind":"arxiv","id":"1501.00438","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00438","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00438v2","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00438","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"PT3M4ET4HA27","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PT3M4ET4HA27P7TV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PT3M4ET4","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PT3M4ET4HA27P7TV5OSAUPHOJB","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-01-02T17:18:56Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"1651cb3bfd01b97dfa6b1270c749541fac89485d4f454c7fbb8ab8a091d91d9a","abstract_canon_sha256":"b7fac6e570e7c9b0d97cf883b43beebbdaaf3b8627827638ebeaff999fec1156"},"schema_version":"1.0"},"canonical_sha256":"7cf6ce127c3835f7fe75eba40a3cee4841cfa3503201d8a458ebedf8a39ca119","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:37.445337Z","signature_b64":"VnZxjex5gvQBJftOybTC8nkEhOtjQt8YbqGK+8WEyn/VRMLFNKy2vuEtun8s5wDCU5BZIngnXnrp/3Z6P0aUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf6ce127c3835f7fe75eba40a3cee4841cfa3503201d8a458ebedf8a39ca119","last_reissued_at":"2026-05-18T01:32:37.444555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:37.444555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00438","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-18T01:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcJvdlYdWSE3O6xBmEmy0KEUiEolljBAFil5KxIpfU9vX2XU6hhPWxDwJ3gAEHSlPZJu5T0vJcVt1XtZag0oAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:02.726023Z"},"content_sha256":"a7e579cdd1f67579f0d3b2d4f911a2fda492c78aa228ca2ab3f977a76e6f2e32","schema_version":"1.0","event_id":"sha256:a7e579cdd1f67579f0d3b2d4f911a2fda492c78aa228ca2ab3f977a76e6f2e32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PT3M4ET4HA27P7TV5OSAUPHOJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"(Non-) asymptotic properties of Stochastic Gradient Langevin Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"and Yee Whye Teh, Konstantinos C. Zygalakis, Sebastian J. Vollmer","submitted_at":"2015-01-02T17:18:56Z","abstract_excerpt":"Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally infeasible. The recently proposed stochastic gradient Langevin dynamics (SGLD) method circumvents this problem in three ways: it generates proposed moves using only a subset of the data, it skips the Metropolis-Hastings accept-reject step, and it uses sequences of decreasing step sizes. In \\cite{TehThierryVollmerSGLD2014}, we provided the mathematical foundations for the decreasing step size SGLD, including consistency and a central limit theorem. However, in practice the SGLD is run for a relati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00438","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-18T01:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+U3LQmcTzNEtDXCNCLUfEQ8cJpPc2UpXlEZH4eNFOAOqFQq6UweYfRLnkR2A+9JKTROSiORk/zjqOU5cOZxJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:02.726401Z"},"content_sha256":"b674946e44a7f7707c01b798508d42cd547a1218095039cb3dd42d0940504396","schema_version":"1.0","event_id":"sha256:b674946e44a7f7707c01b798508d42cd547a1218095039cb3dd42d0940504396"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PT3M4ET4HA27P7TV5OSAUPHOJB/bundle.json","state_url":"https://pith.science/pith/PT3M4ET4HA27P7TV5OSAUPHOJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PT3M4ET4HA27P7TV5OSAUPHOJB/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-05-27T22:17:02Z","links":{"resolver":"https://pith.science/pith/PT3M4ET4HA27P7TV5OSAUPHOJB","bundle":"https://pith.science/pith/PT3M4ET4HA27P7TV5OSAUPHOJB/bundle.json","state":"https://pith.science/pith/PT3M4ET4HA27P7TV5OSAUPHOJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PT3M4ET4HA27P7TV5OSAUPHOJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PT3M4ET4HA27P7TV5OSAUPHOJB","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":"b7fac6e570e7c9b0d97cf883b43beebbdaaf3b8627827638ebeaff999fec1156","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-01-02T17:18:56Z","title_canon_sha256":"1651cb3bfd01b97dfa6b1270c749541fac89485d4f454c7fbb8ab8a091d91d9a"},"schema_version":"1.0","source":{"id":"1501.00438","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00438","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00438v2","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00438","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"PT3M4ET4HA27","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PT3M4ET4HA27P7TV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PT3M4ET4","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:b674946e44a7f7707c01b798508d42cd547a1218095039cb3dd42d0940504396","target":"graph","created_at":"2026-05-18T01:32:37Z","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":"Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally infeasible. The recently proposed stochastic gradient Langevin dynamics (SGLD) method circumvents this problem in three ways: it generates proposed moves using only a subset of the data, it skips the Metropolis-Hastings accept-reject step, and it uses sequences of decreasing step sizes. In \\cite{TehThierryVollmerSGLD2014}, we provided the mathematical foundations for the decreasing step size SGLD, including consistency and a central limit theorem. However, in practice the SGLD is run for a relati","authors_text":"and Yee Whye Teh, Konstantinos C. Zygalakis, Sebastian J. Vollmer","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-01-02T17:18:56Z","title":"(Non-) asymptotic properties of Stochastic Gradient Langevin Dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00438","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:a7e579cdd1f67579f0d3b2d4f911a2fda492c78aa228ca2ab3f977a76e6f2e32","target":"record","created_at":"2026-05-18T01:32:37Z","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":"b7fac6e570e7c9b0d97cf883b43beebbdaaf3b8627827638ebeaff999fec1156","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-01-02T17:18:56Z","title_canon_sha256":"1651cb3bfd01b97dfa6b1270c749541fac89485d4f454c7fbb8ab8a091d91d9a"},"schema_version":"1.0","source":{"id":"1501.00438","kind":"arxiv","version":2}},"canonical_sha256":"7cf6ce127c3835f7fe75eba40a3cee4841cfa3503201d8a458ebedf8a39ca119","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cf6ce127c3835f7fe75eba40a3cee4841cfa3503201d8a458ebedf8a39ca119","first_computed_at":"2026-05-18T01:32:37.444555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:37.444555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VnZxjex5gvQBJftOybTC8nkEhOtjQt8YbqGK+8WEyn/VRMLFNKy2vuEtun8s5wDCU5BZIngnXnrp/3Z6P0aUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:37.445337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00438","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7e579cdd1f67579f0d3b2d4f911a2fda492c78aa228ca2ab3f977a76e6f2e32","sha256:b674946e44a7f7707c01b798508d42cd547a1218095039cb3dd42d0940504396"],"state_sha256":"a0b067831b61e16772919a9ffc5884c27b4dbdd7318a9ac1a23f4f18e7a13327"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvR53ccRtizH6RZVR2N4lZ6sDrTzf70/Re07jpLeKAGT8tTXgRTwVcgq2YBF00bTPIZu7FoKmYLG+KqhuSyCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:17:02.728361Z","bundle_sha256":"2f8aeebc5bed714f7c73ccf1b07292701192cac16fc55a4bacaff1197c3db948"}}