{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M3NBLHB6M6JMGB7KGTDBVE42IR","short_pith_number":"pith:M3NBLHB6","schema_version":"1.0","canonical_sha256":"66da159c3e6792c307ea34c61a939a446e6a32d03e8beb67bbafae7529e92071","source":{"kind":"arxiv","id":"1801.00196","version":1},"attestation_state":"computed","paper":{"title":"On approximating the stationary distribution of time-reversible Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Enoch Peserico, Luca Pretto, Marco Bressan","submitted_at":"2017-12-30T21:34:15Z","abstract_excerpt":"Approximating the stationary probability of a state in a Markov chain through Markov chain Monte Carlo techniques is, in general, inefficient. Standard random walk approaches require $\\tilde{O}(\\tau/\\pi(v))$ operations to approximate the probability $\\pi(v)$ of a state $v$ in a chain with mixing time $\\tau$, and even the best available techniques still have complexity $\\tilde{O}(\\tau^{1.5}/\\pi(v)^{0.5})$, and since these complexities depend inversely on $\\pi(v)$, they can grow beyond any bound in the size of the chain or in its mixing time. In this paper we show that, for time-reversible Marko"},"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":"1801.00196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-30T21:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"e037216e9e3e3e036bbb60d597f2a82dd4f132d2aaa7af685343c64648b6286d","abstract_canon_sha256":"73689331a0835d77528a87f28db35d94c0547e67df2a2e6e4af242c862ca86ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:59.108216Z","signature_b64":"tcZT/gD91klwsXTiavUPXWqfYTcZLu9OEz4oWHF2UDAcHKRY3OgC5T7SlvBWZ9YbwviURgyk6E5w95d19lIlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66da159c3e6792c307ea34c61a939a446e6a32d03e8beb67bbafae7529e92071","last_reissued_at":"2026-05-18T00:26:59.107478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:59.107478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On approximating the stationary distribution of time-reversible Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Enoch Peserico, Luca Pretto, Marco Bressan","submitted_at":"2017-12-30T21:34:15Z","abstract_excerpt":"Approximating the stationary probability of a state in a Markov chain through Markov chain Monte Carlo techniques is, in general, inefficient. Standard random walk approaches require $\\tilde{O}(\\tau/\\pi(v))$ operations to approximate the probability $\\pi(v)$ of a state $v$ in a chain with mixing time $\\tau$, and even the best available techniques still have complexity $\\tilde{O}(\\tau^{1.5}/\\pi(v)^{0.5})$, and since these complexities depend inversely on $\\pi(v)$, they can grow beyond any bound in the size of the chain or in its mixing time. In this paper we show that, for time-reversible Marko"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00196","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.00196","created_at":"2026-05-18T00:26:59.107586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00196v1","created_at":"2026-05-18T00:26:59.107586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00196","created_at":"2026-05-18T00:26:59.107586+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3NBLHB6M6JM","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3NBLHB6M6JMGB7K","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3NBLHB6","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR","json":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR.json","graph_json":"https://pith.science/api/pith-number/M3NBLHB6M6JMGB7KGTDBVE42IR/graph.json","events_json":"https://pith.science/api/pith-number/M3NBLHB6M6JMGB7KGTDBVE42IR/events.json","paper":"https://pith.science/paper/M3NBLHB6"},"agent_actions":{"view_html":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR","download_json":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR.json","view_paper":"https://pith.science/paper/M3NBLHB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00196&json=true","fetch_graph":"https://pith.science/api/pith-number/M3NBLHB6M6JMGB7KGTDBVE42IR/graph.json","fetch_events":"https://pith.science/api/pith-number/M3NBLHB6M6JMGB7KGTDBVE42IR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR/action/storage_attestation","attest_author":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR/action/author_attestation","sign_citation":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR/action/citation_signature","submit_replication":"https://pith.science/pith/M3NBLHB6M6JMGB7KGTDBVE42IR/action/replication_record"}},"created_at":"2026-05-18T00:26:59.107586+00:00","updated_at":"2026-05-18T00:26:59.107586+00:00"}