{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:V7F2GOIFWBAI3UO2JYKKFHM4KJ","short_pith_number":"pith:V7F2GOIF","canonical_record":{"source":{"id":"1101.5837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-31T00:27:45Z","cross_cats_sorted":[],"title_canon_sha256":"918f66a207b13c71bf4e4543e2c8f655f7366885744fa3fbb26e9deb3d7ba4fc","abstract_canon_sha256":"12b391394a005a349a4d4b35fc885bcc3058310fb9f21425007b7a3a2489a58a"},"schema_version":"1.0"},"canonical_sha256":"afcba33905b0408dd1da4e14a29d9c5260fd73dac0a5b2405be01d1be1aef403","source":{"kind":"arxiv","id":"1101.5837","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5837","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5837v2","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5837","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"V7F2GOIFWBAI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V7F2GOIFWBAI3UO2","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V7F2GOIF","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:V7F2GOIFWBAI3UO2JYKKFHM4KJ","target":"record","payload":{"canonical_record":{"source":{"id":"1101.5837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-31T00:27:45Z","cross_cats_sorted":[],"title_canon_sha256":"918f66a207b13c71bf4e4543e2c8f655f7366885744fa3fbb26e9deb3d7ba4fc","abstract_canon_sha256":"12b391394a005a349a4d4b35fc885bcc3058310fb9f21425007b7a3a2489a58a"},"schema_version":"1.0"},"canonical_sha256":"afcba33905b0408dd1da4e14a29d9c5260fd73dac0a5b2405be01d1be1aef403","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:41.891950Z","signature_b64":"w8gtl8rF0lOgQkp1XNB/EsfCR7hq/70rvAEzwF0D7N9mgg7DMYECPLdNiBTm9Mr6tzheFgqHHjqlfIbH+HvMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afcba33905b0408dd1da4e14a29d9c5260fd73dac0a5b2405be01d1be1aef403","last_reissued_at":"2026-05-18T02:22:41.891308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:41.891308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.5837","source_version":2,"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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7qwIRuvov0FGlHcmL0cQeR743DQcgA8UOjRwsoSEnkNw98tO5ZV81ksLWCjUV10cSnLlBksrofm5G9wkSulCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:00:03.440198Z"},"content_sha256":"89670ec959d513e7b7fadc36abe3cecbf81cce1e957556e211c14e541f941732","schema_version":"1.0","event_id":"sha256:89670ec959d513e7b7fadc36abe3cecbf81cce1e957556e211c14e541f941732"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:V7F2GOIFWBAI3UO2JYKKFHM4KJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonasymptotic bounds on the mean square error for MCMC estimates via renewal techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Blazej Miasojedow, Krzysztof Latuszynski, Wojciech Niemiro","submitted_at":"2011-01-31T00:27:45Z","abstract_excerpt":"The Nummellin's split chain construction allows to decompose a Markov chain Monte Carlo (MCMC) trajectory into i.i.d. \"excursions\". RegenerativeMCMC algorithms based on this technique use a random number of samples. They have been proposed as a promising alternative to usual fixed length simulation [25, 33, 14]. In this note we derive nonasymptotic bounds on the mean square error (MSE) of regenerative MCMC estimates via techniques of renewal theory and sequential statistics. These results are applied to costruct confidence intervals. We then focus on two cases of particular interest: chains sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5837","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"},"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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPKv9H1Cmt+2aSSBTVHdCAwjeAL6uh54DRU0q5vOJEpGROr6KlYnLncL4idZWhATDVDcmAGWx0Pmdta/kLn8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:00:03.440919Z"},"content_sha256":"966bef11b25855e613903af36b20078af99d5f74fe26b116f023c34878adbf78","schema_version":"1.0","event_id":"sha256:966bef11b25855e613903af36b20078af99d5f74fe26b116f023c34878adbf78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7F2GOIFWBAI3UO2JYKKFHM4KJ/bundle.json","state_url":"https://pith.science/pith/V7F2GOIFWBAI3UO2JYKKFHM4KJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7F2GOIFWBAI3UO2JYKKFHM4KJ/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-11T22:00:03Z","links":{"resolver":"https://pith.science/pith/V7F2GOIFWBAI3UO2JYKKFHM4KJ","bundle":"https://pith.science/pith/V7F2GOIFWBAI3UO2JYKKFHM4KJ/bundle.json","state":"https://pith.science/pith/V7F2GOIFWBAI3UO2JYKKFHM4KJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7F2GOIFWBAI3UO2JYKKFHM4KJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:V7F2GOIFWBAI3UO2JYKKFHM4KJ","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":"12b391394a005a349a4d4b35fc885bcc3058310fb9f21425007b7a3a2489a58a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-31T00:27:45Z","title_canon_sha256":"918f66a207b13c71bf4e4543e2c8f655f7366885744fa3fbb26e9deb3d7ba4fc"},"schema_version":"1.0","source":{"id":"1101.5837","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5837","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5837v2","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5837","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"V7F2GOIFWBAI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V7F2GOIFWBAI3UO2","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V7F2GOIF","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:966bef11b25855e613903af36b20078af99d5f74fe26b116f023c34878adbf78","target":"graph","created_at":"2026-05-18T02:22:41Z","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":"The Nummellin's split chain construction allows to decompose a Markov chain Monte Carlo (MCMC) trajectory into i.i.d. \"excursions\". RegenerativeMCMC algorithms based on this technique use a random number of samples. They have been proposed as a promising alternative to usual fixed length simulation [25, 33, 14]. In this note we derive nonasymptotic bounds on the mean square error (MSE) of regenerative MCMC estimates via techniques of renewal theory and sequential statistics. These results are applied to costruct confidence intervals. We then focus on two cases of particular interest: chains sa","authors_text":"Blazej Miasojedow, Krzysztof Latuszynski, Wojciech Niemiro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-31T00:27:45Z","title":"Nonasymptotic bounds on the mean square error for MCMC estimates via renewal techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5837","kind":"arxiv","version":2},"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:89670ec959d513e7b7fadc36abe3cecbf81cce1e957556e211c14e541f941732","target":"record","created_at":"2026-05-18T02:22:41Z","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":"12b391394a005a349a4d4b35fc885bcc3058310fb9f21425007b7a3a2489a58a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-31T00:27:45Z","title_canon_sha256":"918f66a207b13c71bf4e4543e2c8f655f7366885744fa3fbb26e9deb3d7ba4fc"},"schema_version":"1.0","source":{"id":"1101.5837","kind":"arxiv","version":2}},"canonical_sha256":"afcba33905b0408dd1da4e14a29d9c5260fd73dac0a5b2405be01d1be1aef403","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afcba33905b0408dd1da4e14a29d9c5260fd73dac0a5b2405be01d1be1aef403","first_computed_at":"2026-05-18T02:22:41.891308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:41.891308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w8gtl8rF0lOgQkp1XNB/EsfCR7hq/70rvAEzwF0D7N9mgg7DMYECPLdNiBTm9Mr6tzheFgqHHjqlfIbH+HvMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:41.891950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5837","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89670ec959d513e7b7fadc36abe3cecbf81cce1e957556e211c14e541f941732","sha256:966bef11b25855e613903af36b20078af99d5f74fe26b116f023c34878adbf78"],"state_sha256":"48dece6cc34b184d22974a96f65c87551c4247204db0322d01d92c8a4aa6c7c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1r+GX7u/KMpoJck66+0BCFZH70rrlAAEjuOd8d1mLnXLm6cuu1cW2/Gcn8Khgyq9uJqpPRhajRPswTQQBX8zDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:00:03.445348Z","bundle_sha256":"e4667a1ee83f69090aab7b86ae5d57c2d77df26f04bf627d69352e4a1573470f"}}