{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M222HAKH4IBLKJNI45TRNPA2YB","short_pith_number":"pith:M222HAKH","canonical_record":{"source":{"id":"1312.1986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T20:04:40Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"186524591041147bb80149d85de75af87b0be43f0c2e4d4b629d2008e3ffd0d2","abstract_canon_sha256":"1e0ab32b053ba1be49ccff886a9450082732aa1b96699a48c90024e36b03ece6"},"schema_version":"1.0"},"canonical_sha256":"66b5a38147e202b525a8e76716bc1ac07de8e15f2542ba6a4320411de86ab3e0","source":{"kind":"arxiv","id":"1312.1986","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1986","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1986v2","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1986","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"M222HAKH4IBL","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M222HAKH4IBLKJNI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M222HAKH","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M222HAKH4IBLKJNI45TRNPA2YB","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T20:04:40Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"186524591041147bb80149d85de75af87b0be43f0c2e4d4b629d2008e3ffd0d2","abstract_canon_sha256":"1e0ab32b053ba1be49ccff886a9450082732aa1b96699a48c90024e36b03ece6"},"schema_version":"1.0"},"canonical_sha256":"66b5a38147e202b525a8e76716bc1ac07de8e15f2542ba6a4320411de86ab3e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:38.757868Z","signature_b64":"RtbfCdwlTcgCLMOSWExPz5eZvl5iDATTgDYsE4I8lram09bcEo7nz94Izz1TYGou/LnVKGZjxsAyTPSyBXVXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66b5a38147e202b525a8e76716bc1ac07de8e15f2542ba6a4320411de86ab3e0","last_reissued_at":"2026-05-18T01:24:38.757490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:38.757490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1986","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-18T01:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0R85NHq6LbRCfBYXKP8fpwpYSyJaib1aK759R3DNqGF8aTUhvvW+HiVb6givmy8DfPEo8oRcTRljnAqNNvEsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:06:24.101411Z"},"content_sha256":"fc8e6e7bf7de909983cb41330c3ac8ee19197e99fadad511a5c1061a41017158","schema_version":"1.0","event_id":"sha256:fc8e6e7bf7de909983cb41330c3ac8ee19197e99fadad511a5c1061a41017158"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M222HAKH4IBLKJNI45TRNPA2YB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Stationary Probability of a Single State in a Markov chain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Asuman Ozdaglar, Christina E. Lee, Devavrat Shah","submitted_at":"2013-12-06T20:04:40Z","abstract_excerpt":"In this paper, we present a novel iterative Monte Carlo method for approximating the stationary probability of a single state of a positive recurrent Markov chain. We utilize the characterization that the stationary probability of a state $i$ is inversely proportional to the expected return time of a random walk beginning at $i$. Our method obtains an $\\epsilon$-multiplicative close estimate with probability greater than $1 - \\alpha$ using at most $\\tilde{O}\\left(t_{\\text{mix}} \\ln(1/\\alpha) / \\pi_i \\epsilon^2 \\right)$ simulated random walk steps on the Markov chain across all iterations, wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1986","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-18T01:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0Yr/NrH8tDGsZfbj8mQnUxASiWu65MG0SAxQnu3UrD7aZNq6jBvTnPB1NU052KvhePApt+svj+PjrfOtgvfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:06:24.102094Z"},"content_sha256":"79e4dfaba74bc1aa5a870b08dd929c5132aa19ebd1f9b456f222a1095d2beeb8","schema_version":"1.0","event_id":"sha256:79e4dfaba74bc1aa5a870b08dd929c5132aa19ebd1f9b456f222a1095d2beeb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M222HAKH4IBLKJNI45TRNPA2YB/bundle.json","state_url":"https://pith.science/pith/M222HAKH4IBLKJNI45TRNPA2YB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M222HAKH4IBLKJNI45TRNPA2YB/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-04T23:06:24Z","links":{"resolver":"https://pith.science/pith/M222HAKH4IBLKJNI45TRNPA2YB","bundle":"https://pith.science/pith/M222HAKH4IBLKJNI45TRNPA2YB/bundle.json","state":"https://pith.science/pith/M222HAKH4IBLKJNI45TRNPA2YB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M222HAKH4IBLKJNI45TRNPA2YB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M222HAKH4IBLKJNI45TRNPA2YB","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":"1e0ab32b053ba1be49ccff886a9450082732aa1b96699a48c90024e36b03ece6","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T20:04:40Z","title_canon_sha256":"186524591041147bb80149d85de75af87b0be43f0c2e4d4b629d2008e3ffd0d2"},"schema_version":"1.0","source":{"id":"1312.1986","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1986","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1986v2","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1986","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"M222HAKH4IBL","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M222HAKH4IBLKJNI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M222HAKH","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:79e4dfaba74bc1aa5a870b08dd929c5132aa19ebd1f9b456f222a1095d2beeb8","target":"graph","created_at":"2026-05-18T01:24:38Z","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 present a novel iterative Monte Carlo method for approximating the stationary probability of a single state of a positive recurrent Markov chain. We utilize the characterization that the stationary probability of a state $i$ is inversely proportional to the expected return time of a random walk beginning at $i$. Our method obtains an $\\epsilon$-multiplicative close estimate with probability greater than $1 - \\alpha$ using at most $\\tilde{O}\\left(t_{\\text{mix}} \\ln(1/\\alpha) / \\pi_i \\epsilon^2 \\right)$ simulated random walk steps on the Markov chain across all iterations, wher","authors_text":"Asuman Ozdaglar, Christina E. Lee, Devavrat Shah","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T20:04:40Z","title":"Approximating the Stationary Probability of a Single State in a Markov chain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1986","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:fc8e6e7bf7de909983cb41330c3ac8ee19197e99fadad511a5c1061a41017158","target":"record","created_at":"2026-05-18T01:24:38Z","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":"1e0ab32b053ba1be49ccff886a9450082732aa1b96699a48c90024e36b03ece6","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T20:04:40Z","title_canon_sha256":"186524591041147bb80149d85de75af87b0be43f0c2e4d4b629d2008e3ffd0d2"},"schema_version":"1.0","source":{"id":"1312.1986","kind":"arxiv","version":2}},"canonical_sha256":"66b5a38147e202b525a8e76716bc1ac07de8e15f2542ba6a4320411de86ab3e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66b5a38147e202b525a8e76716bc1ac07de8e15f2542ba6a4320411de86ab3e0","first_computed_at":"2026-05-18T01:24:38.757490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:38.757490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RtbfCdwlTcgCLMOSWExPz5eZvl5iDATTgDYsE4I8lram09bcEo7nz94Izz1TYGou/LnVKGZjxsAyTPSyBXVXAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:38.757868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1986","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc8e6e7bf7de909983cb41330c3ac8ee19197e99fadad511a5c1061a41017158","sha256:79e4dfaba74bc1aa5a870b08dd929c5132aa19ebd1f9b456f222a1095d2beeb8"],"state_sha256":"7e5673db175c1ad64ad401cb51cf9e52b304668d0c9ab86f670b44be5a4535c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGNmQvqEgauA4fQ6ta3aqf/c1t3wEivaxk0V+81FlPrSdbjz53rrbE4V3HPdBUl/G4Kq4aOsbbzx6YsEPEImCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:06:24.105795Z","bundle_sha256":"9c20c3651b6f93f9916756eb7580a8bfb1855b52181c72c6cb69d79d08ddcf11"}}