{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YFPGLSZ65UMXWJGBPNUB5YNQ4D","short_pith_number":"pith:YFPGLSZ6","schema_version":"1.0","canonical_sha256":"c15e65cb3eed197b24c17b681ee1b0e0ef308d4bfd6f4f32651420fbd1454804","source":{"kind":"arxiv","id":"1503.04123","version":3},"attestation_state":"computed","paper":{"title":"Perturbation theory for Markov chains via Wasserstein distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.PR","stat.ME"],"primary_cat":"stat.CO","authors_text":"Daniel Rudolf, Nikolaus Schweizer","submitted_at":"2015-03-13T16:00:46Z","abstract_excerpt":"Perturbation theory for Markov chains addresses the question how small differences in the transitions of Markov chains are reflected in differences between their distributions. We prove powerful and flexible bounds on the distance of the $n$th step distributions of two Markov chains when one of them satisfies a Wasserstein ergodicity condition. Our work is motivated by the recent interest in approximate Markov chain Monte Carlo (MCMC) methods in the analysis of big data sets. By using an approach based on Lyapunov functions, we provide estimates for geometrically ergodic Markov chains under we"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.04123","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-03-13T16:00:46Z","cross_cats_sorted":["math.NA","math.PR","stat.ME"],"title_canon_sha256":"80d243e921c93dc4d85fa85112d393e929b29f5c6f7be0e682795d65add166f3","abstract_canon_sha256":"777b3ad76a6f3663fe551fb9b3a28ed58487cb513ea72ac84e7919c8fda2e560"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:07.101340Z","signature_b64":"Pp/8u/pi7gQVIikLxeirvK9h62DUWflZuu2rlQDQIBPt5RVL+vWOSJMScULyRtAUPLr9qRH/PpDsKqW/zL3+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c15e65cb3eed197b24c17b681ee1b0e0ef308d4bfd6f4f32651420fbd1454804","last_reissued_at":"2026-05-18T00:50:07.100652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:07.100652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perturbation theory for Markov chains via Wasserstein distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.PR","stat.ME"],"primary_cat":"stat.CO","authors_text":"Daniel Rudolf, Nikolaus Schweizer","submitted_at":"2015-03-13T16:00:46Z","abstract_excerpt":"Perturbation theory for Markov chains addresses the question how small differences in the transitions of Markov chains are reflected in differences between their distributions. We prove powerful and flexible bounds on the distance of the $n$th step distributions of two Markov chains when one of them satisfies a Wasserstein ergodicity condition. Our work is motivated by the recent interest in approximate Markov chain Monte Carlo (MCMC) methods in the analysis of big data sets. By using an approach based on Lyapunov functions, we provide estimates for geometrically ergodic Markov chains under we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04123","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.04123","created_at":"2026-05-18T00:50:07.100766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04123v3","created_at":"2026-05-18T00:50:07.100766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04123","created_at":"2026-05-18T00:50:07.100766+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFPGLSZ65UMX","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFPGLSZ65UMXWJGB","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFPGLSZ6","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13127","citing_title":"State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives","ref_index":258,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D","json":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D.json","graph_json":"https://pith.science/api/pith-number/YFPGLSZ65UMXWJGBPNUB5YNQ4D/graph.json","events_json":"https://pith.science/api/pith-number/YFPGLSZ65UMXWJGBPNUB5YNQ4D/events.json","paper":"https://pith.science/paper/YFPGLSZ6"},"agent_actions":{"view_html":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D","download_json":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D.json","view_paper":"https://pith.science/paper/YFPGLSZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04123&json=true","fetch_graph":"https://pith.science/api/pith-number/YFPGLSZ65UMXWJGBPNUB5YNQ4D/graph.json","fetch_events":"https://pith.science/api/pith-number/YFPGLSZ65UMXWJGBPNUB5YNQ4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D/action/storage_attestation","attest_author":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D/action/author_attestation","sign_citation":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D/action/citation_signature","submit_replication":"https://pith.science/pith/YFPGLSZ65UMXWJGBPNUB5YNQ4D/action/replication_record"}},"created_at":"2026-05-18T00:50:07.100766+00:00","updated_at":"2026-05-18T00:50:07.100766+00:00"}