{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OXTD7STJZBNVMKLGTKOL5FZSD7","short_pith_number":"pith:OXTD7STJ","canonical_record":{"source":{"id":"1606.02275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-07T19:39:02Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"916a6383a89bc411aa2b27bc5411bc66ec0c0275187e3372c9cc55b0ec3c872a","abstract_canon_sha256":"1b6676524bb5fb4cc02293fe1aaaa6360d5a59859ef602d5f78722e36335330b"},"schema_version":"1.0"},"canonical_sha256":"75e63fca69c85b5629669a9cbe97321fd4b963e5b705f13c59c40e6f6a8f2e74","source":{"kind":"arxiv","id":"1606.02275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02275","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02275v1","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02275","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"OXTD7STJZBNV","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OXTD7STJZBNVMKLG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OXTD7STJ","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OXTD7STJZBNVMKLGTKOL5FZSD7","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-07T19:39:02Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"916a6383a89bc411aa2b27bc5411bc66ec0c0275187e3372c9cc55b0ec3c872a","abstract_canon_sha256":"1b6676524bb5fb4cc02293fe1aaaa6360d5a59859ef602d5f78722e36335330b"},"schema_version":"1.0"},"canonical_sha256":"75e63fca69c85b5629669a9cbe97321fd4b963e5b705f13c59c40e6f6a8f2e74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:44.343568Z","signature_b64":"VnK6FowZSFV97oyo9TJHOQkUpMtv6OMCUwkt5CiUogtVpoB/KzBMILGz8ppJCgbd9e1rKtaqnToK6IxwLvZEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e63fca69c85b5629669a9cbe97321fd4b963e5b705f13c59c40e6f6a8f2e74","last_reissued_at":"2026-05-18T01:12:44.343208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:44.343208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02275","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-18T01:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlgdziQ6m2w0Uqv88WLwK6NeyWsmd4eavcg2hlyyVO59G1kFZiCj3Tqpt8MgcJwHmCTMVxSkbzONHzSP1HjHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:49:09.950905Z"},"content_sha256":"1a06bd05bb61e187794f1cb29bdbdbbe74ee1a67cf3a42288f40ae6208cb516e","schema_version":"1.0","event_id":"sha256:1a06bd05bb61e187794f1cb29bdbdbbe74ee1a67cf3a42288f40ae6208cb516e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OXTD7STJZBNVMKLGTKOL5FZSD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Measuring the reliability of MCMC inference with bidirectional Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel M. Roy, Roger B. Grosse, Siddharth Ancha","submitted_at":"2016-06-07T19:39:02Z","abstract_excerpt":"Markov chain Monte Carlo (MCMC) is one of the main workhorses of probabilistic inference, but it is notoriously hard to measure the quality of approximate posterior samples. This challenge is particularly salient in black box inference methods, which can hide details and obscure inference failures. In this work, we extend the recently introduced bidirectional Monte Carlo technique to evaluate MCMC-based posterior inference algorithms. By running annealed importance sampling (AIS) chains both from prior to posterior and vice versa on simulated data, we upper bound in expectation the symmetrized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02275","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-18T01:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTjng27IcibLCS+nsvi1yQPlUqL6rRc0aN8QgdYngRCGIMayg5a6Uku+P8iaCTPiWwlPh3RvBwZBp8wZQ6+AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:49:09.951261Z"},"content_sha256":"b7da04eb48a21228c0632fe21f0eb69748c44a0478358b3a1a8d4751fb48c727","schema_version":"1.0","event_id":"sha256:b7da04eb48a21228c0632fe21f0eb69748c44a0478358b3a1a8d4751fb48c727"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXTD7STJZBNVMKLGTKOL5FZSD7/bundle.json","state_url":"https://pith.science/pith/OXTD7STJZBNVMKLGTKOL5FZSD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXTD7STJZBNVMKLGTKOL5FZSD7/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-07T22:49:09Z","links":{"resolver":"https://pith.science/pith/OXTD7STJZBNVMKLGTKOL5FZSD7","bundle":"https://pith.science/pith/OXTD7STJZBNVMKLGTKOL5FZSD7/bundle.json","state":"https://pith.science/pith/OXTD7STJZBNVMKLGTKOL5FZSD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXTD7STJZBNVMKLGTKOL5FZSD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OXTD7STJZBNVMKLGTKOL5FZSD7","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":"1b6676524bb5fb4cc02293fe1aaaa6360d5a59859ef602d5f78722e36335330b","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-07T19:39:02Z","title_canon_sha256":"916a6383a89bc411aa2b27bc5411bc66ec0c0275187e3372c9cc55b0ec3c872a"},"schema_version":"1.0","source":{"id":"1606.02275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02275","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02275v1","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02275","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"OXTD7STJZBNV","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OXTD7STJZBNVMKLG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OXTD7STJ","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:b7da04eb48a21228c0632fe21f0eb69748c44a0478358b3a1a8d4751fb48c727","target":"graph","created_at":"2026-05-18T01:12:44Z","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":"Markov chain Monte Carlo (MCMC) is one of the main workhorses of probabilistic inference, but it is notoriously hard to measure the quality of approximate posterior samples. This challenge is particularly salient in black box inference methods, which can hide details and obscure inference failures. In this work, we extend the recently introduced bidirectional Monte Carlo technique to evaluate MCMC-based posterior inference algorithms. By running annealed importance sampling (AIS) chains both from prior to posterior and vice versa on simulated data, we upper bound in expectation the symmetrized","authors_text":"Daniel M. Roy, Roger B. Grosse, Siddharth Ancha","cross_cats":["stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-07T19:39:02Z","title":"Measuring the reliability of MCMC inference with bidirectional Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02275","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:1a06bd05bb61e187794f1cb29bdbdbbe74ee1a67cf3a42288f40ae6208cb516e","target":"record","created_at":"2026-05-18T01:12:44Z","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":"1b6676524bb5fb4cc02293fe1aaaa6360d5a59859ef602d5f78722e36335330b","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-07T19:39:02Z","title_canon_sha256":"916a6383a89bc411aa2b27bc5411bc66ec0c0275187e3372c9cc55b0ec3c872a"},"schema_version":"1.0","source":{"id":"1606.02275","kind":"arxiv","version":1}},"canonical_sha256":"75e63fca69c85b5629669a9cbe97321fd4b963e5b705f13c59c40e6f6a8f2e74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e63fca69c85b5629669a9cbe97321fd4b963e5b705f13c59c40e6f6a8f2e74","first_computed_at":"2026-05-18T01:12:44.343208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:44.343208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VnK6FowZSFV97oyo9TJHOQkUpMtv6OMCUwkt5CiUogtVpoB/KzBMILGz8ppJCgbd9e1rKtaqnToK6IxwLvZEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:44.343568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a06bd05bb61e187794f1cb29bdbdbbe74ee1a67cf3a42288f40ae6208cb516e","sha256:b7da04eb48a21228c0632fe21f0eb69748c44a0478358b3a1a8d4751fb48c727"],"state_sha256":"a67bf8e23b87b401a7122c1b98c349c7e400feb81cdc0dbe9b9fc7ae5a590f20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKL+z87JgxdPRefs7eGlhX8zTBfMsEp9PxbBZO9seCYuXpHlNMk0zJfG8P1os21xLn42K7s1ecOL3n5AQbuhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:49:09.953399Z","bundle_sha256":"7417f67de9182c1f31de191db763d009d2ee648c921a8e016197e3104868c3ff"}}