{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MGPO2AAU6ZL7Z3U7JXVZ2GWOIY","short_pith_number":"pith:MGPO2AAU","canonical_record":{"source":{"id":"1309.3116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-12T11:27:24Z","cross_cats_sorted":[],"title_canon_sha256":"826adc875024f348bbd30f30da0bb824902897f16131193fedf53fae30b0a5e8","abstract_canon_sha256":"b649ece42acfe005a1fcf298b1ae9c08626efbcc06ea83f8f5825aec08158a97"},"schema_version":"1.0"},"canonical_sha256":"619eed0014f657fcee9f4deb9d1ace460105622c0810dc10792e89d510ff88ff","source":{"kind":"arxiv","id":"1309.3116","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3116","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3116v1","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3116","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"MGPO2AAU6ZL7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MGPO2AAU6ZL7Z3U7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MGPO2AAU","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MGPO2AAU6ZL7Z3U7JXVZ2GWOIY","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-12T11:27:24Z","cross_cats_sorted":[],"title_canon_sha256":"826adc875024f348bbd30f30da0bb824902897f16131193fedf53fae30b0a5e8","abstract_canon_sha256":"b649ece42acfe005a1fcf298b1ae9c08626efbcc06ea83f8f5825aec08158a97"},"schema_version":"1.0"},"canonical_sha256":"619eed0014f657fcee9f4deb9d1ace460105622c0810dc10792e89d510ff88ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:32.761923Z","signature_b64":"LlXsFwSay6susFlMCS4SNxkuP8VFZFa1fXRGd2SvZCdcl9LDtxheOyEC/NVY1EQVNMnoNBMNZwUnR7X4hbtKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"619eed0014f657fcee9f4deb9d1ace460105622c0810dc10792e89d510ff88ff","last_reissued_at":"2026-05-18T03:13:32.761321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:32.761321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3116","source_version":1,"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-18T03:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3zEDvb0HmGhYjg2FYmBH4wIeEih+nYiPBUUvDDA51sYMimycoxifAJ0U1PEh0urNNLFy7E3J55RVMGz/HuxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:40:04.255955Z"},"content_sha256":"1b1a8bacde8a3f062061797056103788b21806b9e159595e6c71dd5a22fd3738","schema_version":"1.0","event_id":"sha256:1b1a8bacde8a3f062061797056103788b21806b9e159595e6c71dd5a22fd3738"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MGPO2AAU6ZL7Z3U7JXVZ2GWOIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Central Limit Theorems for Stochastic Approximation with controlled Markov chain dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gersende Fort (LTCI)","submitted_at":"2013-09-12T11:27:24Z","abstract_excerpt":"This paper provides a Central Limit Theorem (CLT) for a process $\\{\\theta_n, n\\geq 0\\}$ satisfying a stochastic approximation (SA) equation of the form $\\theta_{n+1} = \\theta_n + \\gamma_{n+1} H(\\theta_n,X_{n+1})$; a CLT for the associated average sequence is also established. The originality of this paper is to address the case of controlled Markov chain dynamics $\\{X_n, n\\geq 0 \\}$ and the case of multiple targets. The framework also accomodates (randomly) truncated SA algorithms. Sufficient conditions for CLT's to hold are provided as well as comments on how these conditions extend previous "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3116","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"},"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-18T03:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDsRLAc9C1R4EIPgjX6o+pFYt2lyi3rEsRQ0gGJajSpNVCt7UMoI0wRxjFpTJMD9+VdPIVQx1D5doI+JR11SBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:40:04.256694Z"},"content_sha256":"1b0b9424e0574d698a3d8aae71dfea89bb08f69aba3ceb2e735edc330083ea85","schema_version":"1.0","event_id":"sha256:1b0b9424e0574d698a3d8aae71dfea89bb08f69aba3ceb2e735edc330083ea85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGPO2AAU6ZL7Z3U7JXVZ2GWOIY/bundle.json","state_url":"https://pith.science/pith/MGPO2AAU6ZL7Z3U7JXVZ2GWOIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGPO2AAU6ZL7Z3U7JXVZ2GWOIY/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-11T10:40:04Z","links":{"resolver":"https://pith.science/pith/MGPO2AAU6ZL7Z3U7JXVZ2GWOIY","bundle":"https://pith.science/pith/MGPO2AAU6ZL7Z3U7JXVZ2GWOIY/bundle.json","state":"https://pith.science/pith/MGPO2AAU6ZL7Z3U7JXVZ2GWOIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGPO2AAU6ZL7Z3U7JXVZ2GWOIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MGPO2AAU6ZL7Z3U7JXVZ2GWOIY","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":"b649ece42acfe005a1fcf298b1ae9c08626efbcc06ea83f8f5825aec08158a97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-12T11:27:24Z","title_canon_sha256":"826adc875024f348bbd30f30da0bb824902897f16131193fedf53fae30b0a5e8"},"schema_version":"1.0","source":{"id":"1309.3116","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3116","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3116v1","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3116","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"MGPO2AAU6ZL7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MGPO2AAU6ZL7Z3U7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MGPO2AAU","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:1b0b9424e0574d698a3d8aae71dfea89bb08f69aba3ceb2e735edc330083ea85","target":"graph","created_at":"2026-05-18T03:13:32Z","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":"This paper provides a Central Limit Theorem (CLT) for a process $\\{\\theta_n, n\\geq 0\\}$ satisfying a stochastic approximation (SA) equation of the form $\\theta_{n+1} = \\theta_n + \\gamma_{n+1} H(\\theta_n,X_{n+1})$; a CLT for the associated average sequence is also established. The originality of this paper is to address the case of controlled Markov chain dynamics $\\{X_n, n\\geq 0 \\}$ and the case of multiple targets. The framework also accomodates (randomly) truncated SA algorithms. Sufficient conditions for CLT's to hold are provided as well as comments on how these conditions extend previous ","authors_text":"Gersende Fort (LTCI)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-12T11:27:24Z","title":"Central Limit Theorems for Stochastic Approximation with controlled Markov chain dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3116","kind":"arxiv","version":1},"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:1b1a8bacde8a3f062061797056103788b21806b9e159595e6c71dd5a22fd3738","target":"record","created_at":"2026-05-18T03:13:32Z","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":"b649ece42acfe005a1fcf298b1ae9c08626efbcc06ea83f8f5825aec08158a97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-12T11:27:24Z","title_canon_sha256":"826adc875024f348bbd30f30da0bb824902897f16131193fedf53fae30b0a5e8"},"schema_version":"1.0","source":{"id":"1309.3116","kind":"arxiv","version":1}},"canonical_sha256":"619eed0014f657fcee9f4deb9d1ace460105622c0810dc10792e89d510ff88ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"619eed0014f657fcee9f4deb9d1ace460105622c0810dc10792e89d510ff88ff","first_computed_at":"2026-05-18T03:13:32.761321Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:32.761321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LlXsFwSay6susFlMCS4SNxkuP8VFZFa1fXRGd2SvZCdcl9LDtxheOyEC/NVY1EQVNMnoNBMNZwUnR7X4hbtKDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:32.761923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3116","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b1a8bacde8a3f062061797056103788b21806b9e159595e6c71dd5a22fd3738","sha256:1b0b9424e0574d698a3d8aae71dfea89bb08f69aba3ceb2e735edc330083ea85"],"state_sha256":"a4e5cd2a17f0d7ff41fb6997bcd2b573457adc39574a6556d3b4f3e00820f0f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qATOJNDbdRlaZtaWk+z5sJem3R9NRPwOxtKpqSJSV/036JarNtg7461a3XqK0ZeJesAkn0+tuwY0Qsbf5ZYqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:40:04.260539Z","bundle_sha256":"98b80b78ab7224d0eaab2fe75286e038bf342ffd4e55685b9de37874db8ca523"}}