{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:55DSH52EHJ7SYBZZU56JEAPHA4","short_pith_number":"pith:55DSH52E","canonical_record":{"source":{"id":"1111.4246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-11-18T00:39:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"54ce7256559598ee4758c6968c7b4599913359845ebe278a49973b810b62924d","abstract_canon_sha256":"5b74159435ae7763ee6453253b4bc589d48d3439c9ac8d5788cbaddccd416ef3"},"schema_version":"1.0"},"canonical_sha256":"ef4723f7443a7f2c0739a77c9201e70716ac7e14ab426329b98ab70bad360803","source":{"kind":"arxiv","id":"1111.4246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4246","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4246v1","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4246","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"55DSH52EHJ7S","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"55DSH52EHJ7SYBZZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"55DSH52E","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:55DSH52EHJ7SYBZZU56JEAPHA4","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-11-18T00:39:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"54ce7256559598ee4758c6968c7b4599913359845ebe278a49973b810b62924d","abstract_canon_sha256":"5b74159435ae7763ee6453253b4bc589d48d3439c9ac8d5788cbaddccd416ef3"},"schema_version":"1.0"},"canonical_sha256":"ef4723f7443a7f2c0739a77c9201e70716ac7e14ab426329b98ab70bad360803","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:28.987785Z","signature_b64":"SET6T3IcEIIAJFGgHkFipv1cnJzKRsz6GcEzMNuYduh+93ftiALRUooOzbk/d7RniMpnWzIrBvkRMDDiT/hvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef4723f7443a7f2c0739a77c9201e70716ac7e14ab426329b98ab70bad360803","last_reissued_at":"2026-05-18T02:21:28.987062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:28.987062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4246","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-05-18T02:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+dF4TDUW6eVGMvwAe7mIfe/Z5UtehcjFU41H+9hUtI8ksuyTm4i+LCo9Qcg/PwQ21cpUmQN8f3JjzGQrEz4BAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:50:04.855447Z"},"content_sha256":"1a930c1f33d4ae834e4e0cd059f84c692241f2d3b992b9e1af265a930f522f08","schema_version":"1.0","event_id":"sha256:1a930c1f33d4ae834e4e0cd059f84c692241f2d3b992b9e1af265a930f522f08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:55DSH52EHJ7SYBZZU56JEAPHA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.CO","authors_text":"Andrew Gelman, Matthew D. Hoffman","submitted_at":"2011-11-18T00:39:32Z","abstract_excerpt":"Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) algorithm that avoids the random walk behavior and sensitivity to correlated parameters that plague many MCMC methods by taking a series of steps informed by first-order gradient information. These features allow it to converge to high-dimensional target distributions much more quickly than simpler methods such as random walk Metropolis or Gibbs sampling. However, HMC's performance is highly sensitive to two user-specified parameters: a step size {\\epsilon} and a desired number of steps L. In particular, if L is too small then "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4246","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":""},"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-18T02:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKUp0evq+OWc9yUDq+6MQehTEYW5CNLpiBUWlRU6VHqpR/j9ITgkZHZ/RW2zsuVQq9AncLMdUhRrPCsPjRrLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:50:04.855811Z"},"content_sha256":"d196d4317aeac4be8ea63843454656a35b8cd1feeb868a72f202c8615eb9a60d","schema_version":"1.0","event_id":"sha256:d196d4317aeac4be8ea63843454656a35b8cd1feeb868a72f202c8615eb9a60d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55DSH52EHJ7SYBZZU56JEAPHA4/bundle.json","state_url":"https://pith.science/pith/55DSH52EHJ7SYBZZU56JEAPHA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55DSH52EHJ7SYBZZU56JEAPHA4/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-06-02T17:50:04Z","links":{"resolver":"https://pith.science/pith/55DSH52EHJ7SYBZZU56JEAPHA4","bundle":"https://pith.science/pith/55DSH52EHJ7SYBZZU56JEAPHA4/bundle.json","state":"https://pith.science/pith/55DSH52EHJ7SYBZZU56JEAPHA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55DSH52EHJ7SYBZZU56JEAPHA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:55DSH52EHJ7SYBZZU56JEAPHA4","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":"5b74159435ae7763ee6453253b4bc589d48d3439c9ac8d5788cbaddccd416ef3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-11-18T00:39:32Z","title_canon_sha256":"54ce7256559598ee4758c6968c7b4599913359845ebe278a49973b810b62924d"},"schema_version":"1.0","source":{"id":"1111.4246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4246","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4246v1","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4246","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"55DSH52EHJ7S","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"55DSH52EHJ7SYBZZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"55DSH52E","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:d196d4317aeac4be8ea63843454656a35b8cd1feeb868a72f202c8615eb9a60d","target":"graph","created_at":"2026-05-18T02:21:28Z","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":"Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) algorithm that avoids the random walk behavior and sensitivity to correlated parameters that plague many MCMC methods by taking a series of steps informed by first-order gradient information. These features allow it to converge to high-dimensional target distributions much more quickly than simpler methods such as random walk Metropolis or Gibbs sampling. However, HMC's performance is highly sensitive to two user-specified parameters: a step size {\\epsilon} and a desired number of steps L. In particular, if L is too small then ","authors_text":"Andrew Gelman, Matthew D. Hoffman","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-11-18T00:39:32Z","title":"The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4246","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:1a930c1f33d4ae834e4e0cd059f84c692241f2d3b992b9e1af265a930f522f08","target":"record","created_at":"2026-05-18T02:21:28Z","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":"5b74159435ae7763ee6453253b4bc589d48d3439c9ac8d5788cbaddccd416ef3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-11-18T00:39:32Z","title_canon_sha256":"54ce7256559598ee4758c6968c7b4599913359845ebe278a49973b810b62924d"},"schema_version":"1.0","source":{"id":"1111.4246","kind":"arxiv","version":1}},"canonical_sha256":"ef4723f7443a7f2c0739a77c9201e70716ac7e14ab426329b98ab70bad360803","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef4723f7443a7f2c0739a77c9201e70716ac7e14ab426329b98ab70bad360803","first_computed_at":"2026-05-18T02:21:28.987062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:28.987062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SET6T3IcEIIAJFGgHkFipv1cnJzKRsz6GcEzMNuYduh+93ftiALRUooOzbk/d7RniMpnWzIrBvkRMDDiT/hvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:28.987785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a930c1f33d4ae834e4e0cd059f84c692241f2d3b992b9e1af265a930f522f08","sha256:d196d4317aeac4be8ea63843454656a35b8cd1feeb868a72f202c8615eb9a60d"],"state_sha256":"eef13bfd8ea9cfc9a6fb3e093fb5d128304195c7bacd004810e66b793d564907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UbeZ6ylKtbSdo84sY1i0oPz2DV57clq3JqSELU45cpsRAMABiB0EgUovVZYQJlu5uTKNtPJt6MTwM7wi+2QBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:50:04.857939Z","bundle_sha256":"f5962054aca27aa1709ff829b36e66500caa4b89a1d19e09f24a1163845d2c5a"}}