{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:JH6LJSFEEMJFWJ5YYLQVXS5GGN","short_pith_number":"pith:JH6LJSFE","canonical_record":{"source":{"id":"0704.2167","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2007-04-17T14:48:08Z","cross_cats_sorted":["math.PR","stat.CO","stat.TH"],"title_canon_sha256":"be3abff1d6de49d7d807ec0f840a155edc6a44c66e4cf61bace346ad896dbb83","abstract_canon_sha256":"99c85780d5984250149b0fc0f12693e9d79f664f19eaa43e961734dc4e92660d"},"schema_version":"1.0"},"canonical_sha256":"49fcb4c8a423125b27b8c2e15bcba6336962c5953d44a75027f860cfe895aea4","source":{"kind":"arxiv","id":"0704.2167","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.2167","created_at":"2026-05-18T04:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"0704.2167v3","created_at":"2026-05-18T04:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.2167","created_at":"2026-05-18T04:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"JH6LJSFEEMJF","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"JH6LJSFEEMJFWJ5Y","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"JH6LJSFE","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:JH6LJSFEEMJFWJ5YYLQVXS5GGN","target":"record","payload":{"canonical_record":{"source":{"id":"0704.2167","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2007-04-17T14:48:08Z","cross_cats_sorted":["math.PR","stat.CO","stat.TH"],"title_canon_sha256":"be3abff1d6de49d7d807ec0f840a155edc6a44c66e4cf61bace346ad896dbb83","abstract_canon_sha256":"99c85780d5984250149b0fc0f12693e9d79f664f19eaa43e961734dc4e92660d"},"schema_version":"1.0"},"canonical_sha256":"49fcb4c8a423125b27b8c2e15bcba6336962c5953d44a75027f860cfe895aea4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:56.052457Z","signature_b64":"4/129tzQGWXu2Xm2UNjLOUza9KGn3ynkJSpZj7BrmiZJIgqqEBfzK//e+6xIN/xQhYedxOCaN9pLSR/DS4nLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49fcb4c8a423125b27b8c2e15bcba6336962c5953d44a75027f860cfe895aea4","last_reissued_at":"2026-05-18T04:03:56.051804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:56.051804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0704.2167","source_version":3,"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-18T04:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spc+qGQGzfvuzXzE5Qv0xAhrrG7QWgA5nASON/NNY/WDitizpCLod5lbpz2T+aSuvhtGb8lH9aHT5XyXlCq/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:42:15.094748Z"},"content_sha256":"c354980f348b4f38a6f47200ebc6802714628c7b59ba75f3ec6adbdfadf479fc","schema_version":"1.0","event_id":"sha256:c354980f348b4f38a6f47200ebc6802714628c7b59ba75f3ec6adbdfadf479fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:JH6LJSFEEMJFWJ5YYLQVXS5GGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Computational Complexity of MCMC-based Estimators in Large Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre Belloni, Victor Chernozhukov","submitted_at":"2007-04-17T14:48:08Z","abstract_excerpt":"In this paper we examine the implications of the statistical large sample theory for the computational complexity of Bayesian and quasi-Bayesian estimation carried out using Metropolis random walks. Our analysis is motivated by the Laplace-Bernstein-Von Mises central limit theorem, which states that in large samples the posterior or quasi-posterior approaches a normal density. Using the conditions required for the central limit theorem to hold, we establish polynomial bounds on the computational complexity of general Metropolis random walks methods in large samples. Our analysis covers cases w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.2167","kind":"arxiv","version":3},"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-18T04:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w96zaJuYAVoBawhzieDgM9fN48X1ITjGA2kHbPJjSWnILJwuJcOu0d5G7bakZJfKwPzBQoW4MpNyq8tk56pSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:42:15.095114Z"},"content_sha256":"5d8ee694fd01e753b21c03ad1e5b4b944ecf2c1030355fc1d777e8b032e5e809","schema_version":"1.0","event_id":"sha256:5d8ee694fd01e753b21c03ad1e5b4b944ecf2c1030355fc1d777e8b032e5e809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JH6LJSFEEMJFWJ5YYLQVXS5GGN/bundle.json","state_url":"https://pith.science/pith/JH6LJSFEEMJFWJ5YYLQVXS5GGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JH6LJSFEEMJFWJ5YYLQVXS5GGN/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-30T08:42:15Z","links":{"resolver":"https://pith.science/pith/JH6LJSFEEMJFWJ5YYLQVXS5GGN","bundle":"https://pith.science/pith/JH6LJSFEEMJFWJ5YYLQVXS5GGN/bundle.json","state":"https://pith.science/pith/JH6LJSFEEMJFWJ5YYLQVXS5GGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JH6LJSFEEMJFWJ5YYLQVXS5GGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:JH6LJSFEEMJFWJ5YYLQVXS5GGN","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":"99c85780d5984250149b0fc0f12693e9d79f664f19eaa43e961734dc4e92660d","cross_cats_sorted":["math.PR","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2007-04-17T14:48:08Z","title_canon_sha256":"be3abff1d6de49d7d807ec0f840a155edc6a44c66e4cf61bace346ad896dbb83"},"schema_version":"1.0","source":{"id":"0704.2167","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.2167","created_at":"2026-05-18T04:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"0704.2167v3","created_at":"2026-05-18T04:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.2167","created_at":"2026-05-18T04:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"JH6LJSFEEMJF","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"JH6LJSFEEMJFWJ5Y","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"JH6LJSFE","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:5d8ee694fd01e753b21c03ad1e5b4b944ecf2c1030355fc1d777e8b032e5e809","target":"graph","created_at":"2026-05-18T04:03:56Z","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":"In this paper we examine the implications of the statistical large sample theory for the computational complexity of Bayesian and quasi-Bayesian estimation carried out using Metropolis random walks. Our analysis is motivated by the Laplace-Bernstein-Von Mises central limit theorem, which states that in large samples the posterior or quasi-posterior approaches a normal density. Using the conditions required for the central limit theorem to hold, we establish polynomial bounds on the computational complexity of general Metropolis random walks methods in large samples. Our analysis covers cases w","authors_text":"Alexandre Belloni, Victor Chernozhukov","cross_cats":["math.PR","stat.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2007-04-17T14:48:08Z","title":"On the Computational Complexity of MCMC-based Estimators in Large Samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.2167","kind":"arxiv","version":3},"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:c354980f348b4f38a6f47200ebc6802714628c7b59ba75f3ec6adbdfadf479fc","target":"record","created_at":"2026-05-18T04:03:56Z","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":"99c85780d5984250149b0fc0f12693e9d79f664f19eaa43e961734dc4e92660d","cross_cats_sorted":["math.PR","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2007-04-17T14:48:08Z","title_canon_sha256":"be3abff1d6de49d7d807ec0f840a155edc6a44c66e4cf61bace346ad896dbb83"},"schema_version":"1.0","source":{"id":"0704.2167","kind":"arxiv","version":3}},"canonical_sha256":"49fcb4c8a423125b27b8c2e15bcba6336962c5953d44a75027f860cfe895aea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49fcb4c8a423125b27b8c2e15bcba6336962c5953d44a75027f860cfe895aea4","first_computed_at":"2026-05-18T04:03:56.051804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:56.051804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4/129tzQGWXu2Xm2UNjLOUza9KGn3ynkJSpZj7BrmiZJIgqqEBfzK//e+6xIN/xQhYedxOCaN9pLSR/DS4nLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:56.052457Z","signed_message":"canonical_sha256_bytes"},"source_id":"0704.2167","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c354980f348b4f38a6f47200ebc6802714628c7b59ba75f3ec6adbdfadf479fc","sha256:5d8ee694fd01e753b21c03ad1e5b4b944ecf2c1030355fc1d777e8b032e5e809"],"state_sha256":"fef3332b71fd538782c14c075e305cf63c3cbb1e0a18bb60ad531a31b7b8c1dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHI3LLNraBs4hQWRQMPbJTWIcLXvgJrfbMrFyimkyplrBDrEP9V8Q+a3Zo3IIGSwnyFwS93aZjb480geKfR/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:42:15.097263Z","bundle_sha256":"71f42e6d0929c2688ba4c314337d5ac3264297dd22f7a8d7f496ef41421108c0"}}