{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L4W44NJKJWWVETUEHZEN3S6UM5","short_pith_number":"pith:L4W44NJK","schema_version":"1.0","canonical_sha256":"5f2dce352a4dad524e843e48ddcbd46764adfef8cb6ff915b104ebac8009a778","source":{"kind":"arxiv","id":"1402.4102","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Gradient Hamiltonian Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Carlos Guestrin, Emily B. Fox, Tianqi Chen","submitted_at":"2014-02-17T19:57:59Z","abstract_excerpt":"Hamiltonian Monte Carlo (HMC) sampling methods provide a mechanism for defining distant proposals with high acceptance probabilities in a Metropolis-Hastings framework, enabling more efficient exploration of the state space than standard random-walk proposals. The popularity of such methods has grown significantly in recent years. However, a limitation of HMC methods is the required gradient computation for simulation of the Hamiltonian dynamical system-such computation is infeasible in problems involving a large sample size or streaming data. Instead, we must rely on a noisy gradient estimate"},"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":"1402.4102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-02-17T19:57:59Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"599ee557481147590b404969160743fe194e226d1a852c63382459722471283b","abstract_canon_sha256":"ce70793014c7ae93c887d40e293022c2ff5d4b8a8235a22935234d6d2c600f98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:06.078504Z","signature_b64":"mM9vzAfiXnhuXUDuVjHb/Q0CaKBZ7T8fnEYZtov2RUmE9RCx6ZaN9sOyufuAY4F8aynRkoVqhfFNBHAL8x7wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f2dce352a4dad524e843e48ddcbd46764adfef8cb6ff915b104ebac8009a778","last_reissued_at":"2026-05-18T02:52:06.078033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:06.078033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Gradient Hamiltonian Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Carlos Guestrin, Emily B. Fox, Tianqi Chen","submitted_at":"2014-02-17T19:57:59Z","abstract_excerpt":"Hamiltonian Monte Carlo (HMC) sampling methods provide a mechanism for defining distant proposals with high acceptance probabilities in a Metropolis-Hastings framework, enabling more efficient exploration of the state space than standard random-walk proposals. The popularity of such methods has grown significantly in recent years. However, a limitation of HMC methods is the required gradient computation for simulation of the Hamiltonian dynamical system-such computation is infeasible in problems involving a large sample size or streaming data. Instead, we must rely on a noisy gradient estimate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4102","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.4102","created_at":"2026-05-18T02:52:06.078105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4102v2","created_at":"2026-05-18T02:52:06.078105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4102","created_at":"2026-05-18T02:52:06.078105+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4W44NJKJWWV","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4W44NJKJWWVETUE","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4W44NJK","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.25824","citing_title":"The Ray Tracing Sampler: Bayesian Sampling of Neural Networks for Everyone","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5","json":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5.json","graph_json":"https://pith.science/api/pith-number/L4W44NJKJWWVETUEHZEN3S6UM5/graph.json","events_json":"https://pith.science/api/pith-number/L4W44NJKJWWVETUEHZEN3S6UM5/events.json","paper":"https://pith.science/paper/L4W44NJK"},"agent_actions":{"view_html":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5","download_json":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5.json","view_paper":"https://pith.science/paper/L4W44NJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4102&json=true","fetch_graph":"https://pith.science/api/pith-number/L4W44NJKJWWVETUEHZEN3S6UM5/graph.json","fetch_events":"https://pith.science/api/pith-number/L4W44NJKJWWVETUEHZEN3S6UM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5/action/storage_attestation","attest_author":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5/action/author_attestation","sign_citation":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5/action/citation_signature","submit_replication":"https://pith.science/pith/L4W44NJKJWWVETUEHZEN3S6UM5/action/replication_record"}},"created_at":"2026-05-18T02:52:06.078105+00:00","updated_at":"2026-05-18T02:52:06.078105+00:00"}