{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ABDA6QSZ344ENPXR3QNBK6K2EP","short_pith_number":"pith:ABDA6QSZ","canonical_record":{"source":{"id":"1111.5421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-23T07:31:58Z","cross_cats_sorted":["stat.CO","stat.ME"],"title_canon_sha256":"ebf693a8727e9cb29718eb8a0f1ae6f580c63d9dcd113a4ed219d4a1bb587d21","abstract_canon_sha256":"483b27aaf64b3a40ae2f5ccb87d9aca783b0594cd99ac1350c12482856ec0574"},"schema_version":"1.0"},"canonical_sha256":"00460f4259df3846bef1dc1a15795a23f622a83a3c4e895f957e3568214594fc","source":{"kind":"arxiv","id":"1111.5421","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5421","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5421v2","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5421","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"ABDA6QSZ344E","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ABDA6QSZ344ENPXR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ABDA6QSZ","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ABDA6QSZ344ENPXR3QNBK6K2EP","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-23T07:31:58Z","cross_cats_sorted":["stat.CO","stat.ME"],"title_canon_sha256":"ebf693a8727e9cb29718eb8a0f1ae6f580c63d9dcd113a4ed219d4a1bb587d21","abstract_canon_sha256":"483b27aaf64b3a40ae2f5ccb87d9aca783b0594cd99ac1350c12482856ec0574"},"schema_version":"1.0"},"canonical_sha256":"00460f4259df3846bef1dc1a15795a23f622a83a3c4e895f957e3568214594fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:58.626424Z","signature_b64":"jXsqucMQ0/CKKG6hxaTwZrC43cvuPYguTFfxYoiYTENBVQB6vKSWsE1yXndvyvL6NE89eaSyy2WM7fqdcXhNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00460f4259df3846bef1dc1a15795a23f622a83a3c4e895f957e3568214594fc","last_reissued_at":"2026-05-18T02:56:58.626009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:58.626009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5421","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-18T02:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaT1FftYbZR8pC27ixoeZSuH+3bTla8qLqQKIcBR903UJ8FkMF+H/E/7Oa5DgzUkmXW7P3Rkxfft2l0UqB68DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:40:18.872709Z"},"content_sha256":"6d928f610d913f6a3ab614bc65e96d0a6ada42e517bf8f4d9540a15c9b4a475e","schema_version":"1.0","event_id":"sha256:6d928f610d913f6a3ab614bc65e96d0a6ada42e517bf8f4d9540a15c9b4a475e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ABDA6QSZ344ENPXR3QNBK6K2EP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markovian stochastic approximation with expanding projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ME"],"primary_cat":"math.PR","authors_text":"Christophe Andrieu, Matti Vihola","submitted_at":"2011-11-23T07:31:58Z","abstract_excerpt":"Stochastic approximation is a framework unifying many random iterative algorithms occurring in a diverse range of applications. The stability of the process is often difficult to verify in practical applications and the process may even be unstable without additional stabilisation techniques. We study a stochastic approximation procedure with expanding projections similar to Andrad\\'{o}ttir [Oper. Res. 43 (1995) 1037-1048]. We focus on Markovian noise and show the stability and convergence under general conditions. Our framework also incorporates the possibility to use a random step size seque"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5421","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-18T02:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6S3fPGDKGoP1W+4Bc82vy3OO2V0dPlSMnrROShWQkvqoWd52pgpK9iMym6BKzORI9aan+v8tVTh2qL8uL3KdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:40:18.873191Z"},"content_sha256":"1b4aef5f69e65cdb2896c3c02a8251e54fc67f02b76d8c697b177ba292553344","schema_version":"1.0","event_id":"sha256:1b4aef5f69e65cdb2896c3c02a8251e54fc67f02b76d8c697b177ba292553344"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABDA6QSZ344ENPXR3QNBK6K2EP/bundle.json","state_url":"https://pith.science/pith/ABDA6QSZ344ENPXR3QNBK6K2EP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABDA6QSZ344ENPXR3QNBK6K2EP/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-02T11:40:18Z","links":{"resolver":"https://pith.science/pith/ABDA6QSZ344ENPXR3QNBK6K2EP","bundle":"https://pith.science/pith/ABDA6QSZ344ENPXR3QNBK6K2EP/bundle.json","state":"https://pith.science/pith/ABDA6QSZ344ENPXR3QNBK6K2EP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABDA6QSZ344ENPXR3QNBK6K2EP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ABDA6QSZ344ENPXR3QNBK6K2EP","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":"483b27aaf64b3a40ae2f5ccb87d9aca783b0594cd99ac1350c12482856ec0574","cross_cats_sorted":["stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-23T07:31:58Z","title_canon_sha256":"ebf693a8727e9cb29718eb8a0f1ae6f580c63d9dcd113a4ed219d4a1bb587d21"},"schema_version":"1.0","source":{"id":"1111.5421","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5421","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5421v2","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5421","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"ABDA6QSZ344E","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ABDA6QSZ344ENPXR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ABDA6QSZ","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:1b4aef5f69e65cdb2896c3c02a8251e54fc67f02b76d8c697b177ba292553344","target":"graph","created_at":"2026-05-18T02:56:58Z","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":"Stochastic approximation is a framework unifying many random iterative algorithms occurring in a diverse range of applications. The stability of the process is often difficult to verify in practical applications and the process may even be unstable without additional stabilisation techniques. We study a stochastic approximation procedure with expanding projections similar to Andrad\\'{o}ttir [Oper. Res. 43 (1995) 1037-1048]. We focus on Markovian noise and show the stability and convergence under general conditions. Our framework also incorporates the possibility to use a random step size seque","authors_text":"Christophe Andrieu, Matti Vihola","cross_cats":["stat.CO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-23T07:31:58Z","title":"Markovian stochastic approximation with expanding projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5421","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:6d928f610d913f6a3ab614bc65e96d0a6ada42e517bf8f4d9540a15c9b4a475e","target":"record","created_at":"2026-05-18T02:56:58Z","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":"483b27aaf64b3a40ae2f5ccb87d9aca783b0594cd99ac1350c12482856ec0574","cross_cats_sorted":["stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-23T07:31:58Z","title_canon_sha256":"ebf693a8727e9cb29718eb8a0f1ae6f580c63d9dcd113a4ed219d4a1bb587d21"},"schema_version":"1.0","source":{"id":"1111.5421","kind":"arxiv","version":2}},"canonical_sha256":"00460f4259df3846bef1dc1a15795a23f622a83a3c4e895f957e3568214594fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00460f4259df3846bef1dc1a15795a23f622a83a3c4e895f957e3568214594fc","first_computed_at":"2026-05-18T02:56:58.626009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:58.626009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jXsqucMQ0/CKKG6hxaTwZrC43cvuPYguTFfxYoiYTENBVQB6vKSWsE1yXndvyvL6NE89eaSyy2WM7fqdcXhNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:58.626424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5421","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d928f610d913f6a3ab614bc65e96d0a6ada42e517bf8f4d9540a15c9b4a475e","sha256:1b4aef5f69e65cdb2896c3c02a8251e54fc67f02b76d8c697b177ba292553344"],"state_sha256":"2c84293397fc9df0423111a308acb901cd01522b9c0b509fc29b30a51930dbe9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uv5pXQTzrcAfxtirpjxgT7c6uoseiIVVrFDWCPA86gh3yOsk4qvLWwqQ3gP+nNt+AASED1sKpJki8k/GouHNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:40:18.875760Z","bundle_sha256":"c04d4aa01739a5e685438270c95bb003b200c2743b49cf8b5e1d034bff011339"}}