{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WMZUWA36DCSNYDJZQNDBGJLL52","short_pith_number":"pith:WMZUWA36","schema_version":"1.0","canonical_sha256":"b3334b037e18a4dc0d39834613256beeba0329f93ec5992b2c4d44ebfaf0b800","source":{"kind":"arxiv","id":"1505.00749","version":2},"attestation_state":"computed","paper":{"title":"A central limit theorem for temporally non-homogenous Markov chains with applications to dynamic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Alessandro Arlotto, J. Michael Steele","submitted_at":"2015-05-04T18:51:30Z","abstract_excerpt":"We prove a central limit theorem for a class of additive processes that arise naturally in the theory of finite horizon Markov decision problems. The main theorem generalizes a classic result of Dobrushin (1956) for temporally non-homogeneous Markov chains, and the principal innovation is that here the summands are permitted to depend on both the current state and a bounded number of future states of the chain. We show through several examples that this added flexibility gives one a direct path to asymptotic normality of the optimal total reward of finite horizon Markov decision problems. The "},"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":"1505.00749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-04T18:51:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b3dfc1f886710555e00980b3d02221a9ab00eee5896e57d8fdeed407178d032f","abstract_canon_sha256":"b4aced9b3f822a84d62e91ce3a1a08c03127af683bbbf45a20262c2d3fe265cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:53.192427Z","signature_b64":"aAFaC8MCVltmqEV9o6G9oJ0fHTI08dvL5e9CyMfWGSf0N8woHxIoPYxZYDsUtpYIpagjxG2zd5CWHRp/aSo4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3334b037e18a4dc0d39834613256beeba0329f93ec5992b2c4d44ebfaf0b800","last_reissued_at":"2026-05-18T01:03:53.191722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:53.191722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A central limit theorem for temporally non-homogenous Markov chains with applications to dynamic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Alessandro Arlotto, J. Michael Steele","submitted_at":"2015-05-04T18:51:30Z","abstract_excerpt":"We prove a central limit theorem for a class of additive processes that arise naturally in the theory of finite horizon Markov decision problems. The main theorem generalizes a classic result of Dobrushin (1956) for temporally non-homogeneous Markov chains, and the principal innovation is that here the summands are permitted to depend on both the current state and a bounded number of future states of the chain. We show through several examples that this added flexibility gives one a direct path to asymptotic normality of the optimal total reward of finite horizon Markov decision problems. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00749","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.00749","created_at":"2026-05-18T01:03:53.191833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00749v2","created_at":"2026-05-18T01:03:53.191833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00749","created_at":"2026-05-18T01:03:53.191833+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMZUWA36DCSN","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMZUWA36DCSNYDJZ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMZUWA36","created_at":"2026-05-18T12:29:47.479230+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/WMZUWA36DCSNYDJZQNDBGJLL52","json":"https://pith.science/pith/WMZUWA36DCSNYDJZQNDBGJLL52.json","graph_json":"https://pith.science/api/pith-number/WMZUWA36DCSNYDJZQNDBGJLL52/graph.json","events_json":"https://pith.science/api/pith-number/WMZUWA36DCSNYDJZQNDBGJLL52/events.json","paper":"https://pith.science/paper/WMZUWA36"},"agent_actions":{"view_html":"https://pith.science/pith/WMZUWA36DCSNYDJZQNDBGJLL52","download_json":"https://pith.science/pith/WMZUWA36DCSNYDJZQNDBGJLL52.json","view_paper":"https://pith.science/paper/WMZUWA36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00749&json=true","fetch_graph":"https://pith.science/api/pith-number/WMZUWA36DCSNYDJZQNDBGJLL52/graph.json","fetch_events":"https://pith.science/api/pith-number/WMZUWA36DCSNYDJZQNDBGJLL52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMZUWA36DCSNYDJZQNDBGJLL52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMZUWA36DCSNYDJZQNDBGJLL52/action/storage_attestation","attest_author":"https://pith.science/pith/WMZUWA36DCSNYDJZQNDBGJLL52/action/author_attestation","sign_citation":"https://pith.science/pith/WMZUWA36DCSNYDJZQNDBGJLL52/action/citation_signature","submit_replication":"https://pith.science/pith/WMZUWA36DCSNYDJZQNDBGJLL52/action/replication_record"}},"created_at":"2026-05-18T01:03:53.191833+00:00","updated_at":"2026-05-18T01:03:53.191833+00:00"}