{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TPXXESUANBMEMQTIE6VND2B6NQ","short_pith_number":"pith:TPXXESUA","canonical_record":{"source":{"id":"1506.05555","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-18T06:25:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5b53769c21d8350d0187b0fb3c6b3a74f94b9e8bb62979f708260ff7e4d8c88f","abstract_canon_sha256":"4088ac3775c70e6095e2b029e01bc4f9379944a470e6f2fb91ff8bc547e3a313"},"schema_version":"1.0"},"canonical_sha256":"9bef724a80685846426827aad1e83e6c0baf337ddc0e5f792598dac33ef21c08","source":{"kind":"arxiv","id":"1506.05555","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05555","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05555v5","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05555","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"TPXXESUANBME","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TPXXESUANBMEMQTI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TPXXESUA","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TPXXESUANBMEMQTIE6VND2B6NQ","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05555","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-18T06:25:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5b53769c21d8350d0187b0fb3c6b3a74f94b9e8bb62979f708260ff7e4d8c88f","abstract_canon_sha256":"4088ac3775c70e6095e2b029e01bc4f9379944a470e6f2fb91ff8bc547e3a313"},"schema_version":"1.0"},"canonical_sha256":"9bef724a80685846426827aad1e83e6c0baf337ddc0e5f792598dac33ef21c08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:16.947191Z","signature_b64":"rIIRJzTA3eDXWka7papUcMc32d7xB2IbbKbUJcM8nwAS9O8nX402BqA2ZKMytLvZM0ybByCbioQ7bcoJ4fv2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bef724a80685846426827aad1e83e6c0baf337ddc0e5f792598dac33ef21c08","last_reissued_at":"2026-05-18T00:46:16.946709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:16.946709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05555","source_version":5,"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-18T00:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+aG5twaJdz/8BLs+ekUBs4mQDsbf4HkqKKvh+cvHfHDLwBKsiBECtdilVnre27Ypjs6638GDIOEyfbmeo164AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:03:26.875229Z"},"content_sha256":"c6555c6b95ec407bc52c53943cd356bdf7dc09a6d276fabd66d012165c6a5cb1","schema_version":"1.0","event_id":"sha256:c6555c6b95ec407bc52c53943cd356bdf7dc09a6d276fabd66d012165c6a5cb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TPXXESUANBMEMQTIE6VND2B6NQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonian Monte Carlo Acceleration Using Surrogate Functions with Random Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Babak Shahbaba, Cheng Zhang, Hongkai Zhao","submitted_at":"2015-06-18T06:25:59Z","abstract_excerpt":"For big data analysis, high computational cost for Bayesian methods often limits their applications in practice. In recent years, there have been many attempts to improve computational efficiency of Bayesian inference. Here we propose an efficient and scalable computational technique for a state-of-the-art Markov Chain Monte Carlo (MCMC) methods, namely, Hamiltonian Monte Carlo (HMC). The key idea is to explore and exploit the structure and regularity in parameter space for the underlying probabilistic model to construct an effective approximation of its geometric properties. To this end, we b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05555","kind":"arxiv","version":5},"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-18T00:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHhODgvEhbMSGvzlVqU3BeS8Zfb0MrxnmFJb1uFJc6eytXWx1CuSkfvNkRiA7w3YbEdRAoO/1Cqto7qUQM6mBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:03:26.875897Z"},"content_sha256":"b49bf7b32178f24ce7917a851a759faa2a18b074274f14b90ff3be083cf67c33","schema_version":"1.0","event_id":"sha256:b49bf7b32178f24ce7917a851a759faa2a18b074274f14b90ff3be083cf67c33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPXXESUANBMEMQTIE6VND2B6NQ/bundle.json","state_url":"https://pith.science/pith/TPXXESUANBMEMQTIE6VND2B6NQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPXXESUANBMEMQTIE6VND2B6NQ/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-27T03:03:26Z","links":{"resolver":"https://pith.science/pith/TPXXESUANBMEMQTIE6VND2B6NQ","bundle":"https://pith.science/pith/TPXXESUANBMEMQTIE6VND2B6NQ/bundle.json","state":"https://pith.science/pith/TPXXESUANBMEMQTIE6VND2B6NQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPXXESUANBMEMQTIE6VND2B6NQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TPXXESUANBMEMQTIE6VND2B6NQ","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":"4088ac3775c70e6095e2b029e01bc4f9379944a470e6f2fb91ff8bc547e3a313","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-18T06:25:59Z","title_canon_sha256":"5b53769c21d8350d0187b0fb3c6b3a74f94b9e8bb62979f708260ff7e4d8c88f"},"schema_version":"1.0","source":{"id":"1506.05555","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05555","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05555v5","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05555","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"TPXXESUANBME","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TPXXESUANBMEMQTI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TPXXESUA","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:b49bf7b32178f24ce7917a851a759faa2a18b074274f14b90ff3be083cf67c33","target":"graph","created_at":"2026-05-18T00:46:16Z","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":"For big data analysis, high computational cost for Bayesian methods often limits their applications in practice. In recent years, there have been many attempts to improve computational efficiency of Bayesian inference. Here we propose an efficient and scalable computational technique for a state-of-the-art Markov Chain Monte Carlo (MCMC) methods, namely, Hamiltonian Monte Carlo (HMC). The key idea is to explore and exploit the structure and regularity in parameter space for the underlying probabilistic model to construct an effective approximation of its geometric properties. To this end, we b","authors_text":"Babak Shahbaba, Cheng Zhang, Hongkai Zhao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-18T06:25:59Z","title":"Hamiltonian Monte Carlo Acceleration Using Surrogate Functions with Random Bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05555","kind":"arxiv","version":5},"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:c6555c6b95ec407bc52c53943cd356bdf7dc09a6d276fabd66d012165c6a5cb1","target":"record","created_at":"2026-05-18T00:46:16Z","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":"4088ac3775c70e6095e2b029e01bc4f9379944a470e6f2fb91ff8bc547e3a313","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-18T06:25:59Z","title_canon_sha256":"5b53769c21d8350d0187b0fb3c6b3a74f94b9e8bb62979f708260ff7e4d8c88f"},"schema_version":"1.0","source":{"id":"1506.05555","kind":"arxiv","version":5}},"canonical_sha256":"9bef724a80685846426827aad1e83e6c0baf337ddc0e5f792598dac33ef21c08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bef724a80685846426827aad1e83e6c0baf337ddc0e5f792598dac33ef21c08","first_computed_at":"2026-05-18T00:46:16.946709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:16.946709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rIIRJzTA3eDXWka7papUcMc32d7xB2IbbKbUJcM8nwAS9O8nX402BqA2ZKMytLvZM0ybByCbioQ7bcoJ4fv2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:16.947191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05555","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6555c6b95ec407bc52c53943cd356bdf7dc09a6d276fabd66d012165c6a5cb1","sha256:b49bf7b32178f24ce7917a851a759faa2a18b074274f14b90ff3be083cf67c33"],"state_sha256":"dece74db22be5915628efcbfe33e268d64a3ef6be6b6614d3dad56950c150969"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcm+1lCbdDqVtG+DOka1TkQd852pF1iXu4DuYe8/IuQUP3LUot399sBFEKWNRDLjnY8WtLEt/bfpA65G7/PgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:03:26.879077Z","bundle_sha256":"00b62c6bf6ebb028f762e3b886b07ca8b26512fae31699c2106fed560c24d08b"}}