{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IIERJON6I37CAO4VIVVCHDKH4N","short_pith_number":"pith:IIERJON6","canonical_record":{"source":{"id":"1802.07935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T08:13:53Z","cross_cats_sorted":["math.DS","stat.ML"],"title_canon_sha256":"18ad5e0ed3352c27d0b89f65fea4547792cf528cfdd887366447f90e57b910ef","abstract_canon_sha256":"08886b4f03e7580108988258fe762a35103d1ec143ae0cebead8bffe6b31d206"},"schema_version":"1.0"},"canonical_sha256":"420914b9be46fe203b95456a238d47e37d1197ebea73da273cca4766917048ed","source":{"kind":"arxiv","id":"1802.07935","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07935","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07935v2","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07935","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"IIERJON6I37C","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IIERJON6I37CAO4V","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IIERJON6","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IIERJON6I37CAO4VIVVCHDKH4N","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T08:13:53Z","cross_cats_sorted":["math.DS","stat.ML"],"title_canon_sha256":"18ad5e0ed3352c27d0b89f65fea4547792cf528cfdd887366447f90e57b910ef","abstract_canon_sha256":"08886b4f03e7580108988258fe762a35103d1ec143ae0cebead8bffe6b31d206"},"schema_version":"1.0"},"canonical_sha256":"420914b9be46fe203b95456a238d47e37d1197ebea73da273cca4766917048ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.724020Z","signature_b64":"2kTwyzHd8mJpcw24l3Tf2ci/OYIjLlTTn6h8+2GeMwffkGr4Q8XLOhWF9DRXKJJ/pNa8JYdocKdazimA8C1WCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"420914b9be46fe203b95456a238d47e37d1197ebea73da273cca4766917048ed","last_reissued_at":"2026-05-17T23:47:12.723620Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.723620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07935","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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"248jdBdTpo318KC12wqKSttH9CXLcB5LRHZINf8+AHzxSA+SWBv25OtoV6IZyqD9d5+1V6EZjhLPg6yU5EqPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:20:59.701887Z"},"content_sha256":"65da4ab69d63c5e8978a1af31c65132e678d2e15370cc429fab922aada4d2a0d","schema_version":"1.0","event_id":"sha256:65da4ab69d63c5e8978a1af31c65132e678d2e15370cc429fab922aada4d2a0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IIERJON6I37CAO4VIVVCHDKH4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous stochastic approximations with asymptotically biased errors and deep multi-agent learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","stat.ML"],"primary_cat":"math.OC","authors_text":"Arunselvan Ramaswamy, Daniel E. Quevedo, Shalabh Bhatnagar","submitted_at":"2018-02-22T08:13:53Z","abstract_excerpt":"Asynchronous stochastic approximations (SAs) are an important class of model-free algorithms, tools and techniques that are popular in multi-agent and distributed control scenarios. To counter Bellman's curse of dimensionality, such algorithms are coupled with function approximations. Although the learning/ control problem becomes more tractable, function approximations affect stability and convergence. In this paper, we present verifiable sufficient conditions for stability and convergence of asynchronous SAs with biased approximation errors. The theory developed herein is used to analyze Pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07935","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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmJG4t+epWmGB9FBOMvMQqOi/Ca4K3sOeGcUtQPwzhRNjRDGJiCn6XGwh45SOcFD6xdkml/amU3Hmsh8vDnMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:20:59.702234Z"},"content_sha256":"d315d127775e1d07938aff8c33870dbb16d121b2a0c338fcee3430f8f8d69f79","schema_version":"1.0","event_id":"sha256:d315d127775e1d07938aff8c33870dbb16d121b2a0c338fcee3430f8f8d69f79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIERJON6I37CAO4VIVVCHDKH4N/bundle.json","state_url":"https://pith.science/pith/IIERJON6I37CAO4VIVVCHDKH4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIERJON6I37CAO4VIVVCHDKH4N/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-05-28T02:20:59Z","links":{"resolver":"https://pith.science/pith/IIERJON6I37CAO4VIVVCHDKH4N","bundle":"https://pith.science/pith/IIERJON6I37CAO4VIVVCHDKH4N/bundle.json","state":"https://pith.science/pith/IIERJON6I37CAO4VIVVCHDKH4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIERJON6I37CAO4VIVVCHDKH4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IIERJON6I37CAO4VIVVCHDKH4N","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":"08886b4f03e7580108988258fe762a35103d1ec143ae0cebead8bffe6b31d206","cross_cats_sorted":["math.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T08:13:53Z","title_canon_sha256":"18ad5e0ed3352c27d0b89f65fea4547792cf528cfdd887366447f90e57b910ef"},"schema_version":"1.0","source":{"id":"1802.07935","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07935","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07935v2","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07935","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"IIERJON6I37C","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IIERJON6I37CAO4V","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IIERJON6","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:d315d127775e1d07938aff8c33870dbb16d121b2a0c338fcee3430f8f8d69f79","target":"graph","created_at":"2026-05-17T23:47:12Z","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":"Asynchronous stochastic approximations (SAs) are an important class of model-free algorithms, tools and techniques that are popular in multi-agent and distributed control scenarios. To counter Bellman's curse of dimensionality, such algorithms are coupled with function approximations. Although the learning/ control problem becomes more tractable, function approximations affect stability and convergence. In this paper, we present verifiable sufficient conditions for stability and convergence of asynchronous SAs with biased approximation errors. The theory developed herein is used to analyze Pol","authors_text":"Arunselvan Ramaswamy, Daniel E. Quevedo, Shalabh Bhatnagar","cross_cats":["math.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T08:13:53Z","title":"Asynchronous stochastic approximations with asymptotically biased errors and deep multi-agent learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07935","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:65da4ab69d63c5e8978a1af31c65132e678d2e15370cc429fab922aada4d2a0d","target":"record","created_at":"2026-05-17T23:47:12Z","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":"08886b4f03e7580108988258fe762a35103d1ec143ae0cebead8bffe6b31d206","cross_cats_sorted":["math.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T08:13:53Z","title_canon_sha256":"18ad5e0ed3352c27d0b89f65fea4547792cf528cfdd887366447f90e57b910ef"},"schema_version":"1.0","source":{"id":"1802.07935","kind":"arxiv","version":2}},"canonical_sha256":"420914b9be46fe203b95456a238d47e37d1197ebea73da273cca4766917048ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"420914b9be46fe203b95456a238d47e37d1197ebea73da273cca4766917048ed","first_computed_at":"2026-05-17T23:47:12.723620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:12.723620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2kTwyzHd8mJpcw24l3Tf2ci/OYIjLlTTn6h8+2GeMwffkGr4Q8XLOhWF9DRXKJJ/pNa8JYdocKdazimA8C1WCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:12.724020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07935","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65da4ab69d63c5e8978a1af31c65132e678d2e15370cc429fab922aada4d2a0d","sha256:d315d127775e1d07938aff8c33870dbb16d121b2a0c338fcee3430f8f8d69f79"],"state_sha256":"3211b5c25e0796b603889709da19809931edcd2f57418bf0f6732b2cfe39b5fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgaPujHSxfml69SLu+NyPNb6mGlRIBimuIdfp5HBoD7OmLIQRg527Zj0pCbLn2jCLhzNzdGU2I0vJ9JFFphHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:20:59.704272Z","bundle_sha256":"07ef19db082594b2b97052b476a7b5fa670c738a0ad9b1b5aabbe3d93dc7239b"}}