{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H6IZMOHI3I3IBYMZAFSGY22VVC","short_pith_number":"pith:H6IZMOHI","schema_version":"1.0","canonical_sha256":"3f919638e8da3680e19901646c6b55a88392e14198c60d2b14ae72d9cc98f9b7","source":{"kind":"arxiv","id":"2405.20849","version":4},"attestation_state":"computed","paper":{"title":"Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Amit Rajaraman, David X. Wu, Kuikui Liu, Prasad Raghavendra, Sidhanth Mohanty","submitted_at":"2024-05-31T14:32:32Z","abstract_excerpt":"Many natural Markov chains fail to mix to their stationary distribution in polynomially many steps. Often, this slow mixing is inevitable since it is computationally intractable to sample from their stationary measure.\n  Nevertheless, Markov chains can be shown to always converge quickly to measures that are locally stationary, i.e., measures that don't change over a small number of steps. These locally stationary measures are analogous to local minima in continuous optimization, while stationary measures correspond to global minima.\n  While locally stationary measures can be statistically far"},"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":"2405.20849","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-31T14:32:32Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"c018d88135a1450c33f776a41fec5210ea001003678708f3a8e1c73b3a8411a6","abstract_canon_sha256":"65b94f8b0f1aa76b9813298bf9e3b63abe6566f1db6469252372ed3c9df25206"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:15.509339Z","signature_b64":"Ik9oHkBSvAuN+L/gYyUupGWFrsp6hoT7HleqW6nN+M+WMWFC6Fjqw/9lBFhIOXzcj5kqCv8SwUaVli0P/7iFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f919638e8da3680e19901646c6b55a88392e14198c60d2b14ae72d9cc98f9b7","last_reissued_at":"2026-07-05T11:32:15.508843Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:15.508843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Amit Rajaraman, David X. Wu, Kuikui Liu, Prasad Raghavendra, Sidhanth Mohanty","submitted_at":"2024-05-31T14:32:32Z","abstract_excerpt":"Many natural Markov chains fail to mix to their stationary distribution in polynomially many steps. Often, this slow mixing is inevitable since it is computationally intractable to sample from their stationary measure.\n  Nevertheless, Markov chains can be shown to always converge quickly to measures that are locally stationary, i.e., measures that don't change over a small number of steps. These locally stationary measures are analogous to local minima in continuous optimization, while stationary measures correspond to global minima.\n  While locally stationary measures can be statistically far"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20849","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.20849/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.20849","created_at":"2026-07-05T11:32:15.508904+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.20849v4","created_at":"2026-07-05T11:32:15.508904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20849","created_at":"2026-07-05T11:32:15.508904+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6IZMOHI3I3I","created_at":"2026-07-05T11:32:15.508904+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6IZMOHI3I3IBYMZ","created_at":"2026-07-05T11:32:15.508904+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6IZMOHI","created_at":"2026-07-05T11:32:15.508904+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31230","citing_title":"Learning Gaussian Graphical Models from a Glauber Trajectory Without Mixing","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC","json":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC.json","graph_json":"https://pith.science/api/pith-number/H6IZMOHI3I3IBYMZAFSGY22VVC/graph.json","events_json":"https://pith.science/api/pith-number/H6IZMOHI3I3IBYMZAFSGY22VVC/events.json","paper":"https://pith.science/paper/H6IZMOHI"},"agent_actions":{"view_html":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC","download_json":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC.json","view_paper":"https://pith.science/paper/H6IZMOHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.20849&json=true","fetch_graph":"https://pith.science/api/pith-number/H6IZMOHI3I3IBYMZAFSGY22VVC/graph.json","fetch_events":"https://pith.science/api/pith-number/H6IZMOHI3I3IBYMZAFSGY22VVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC/action/storage_attestation","attest_author":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC/action/author_attestation","sign_citation":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC/action/citation_signature","submit_replication":"https://pith.science/pith/H6IZMOHI3I3IBYMZAFSGY22VVC/action/replication_record"}},"created_at":"2026-07-05T11:32:15.508904+00:00","updated_at":"2026-07-05T11:32:15.508904+00:00"}