{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ABGU4GOCZCUQBM3NFYNCRSPAJZ","short_pith_number":"pith:ABGU4GOC","schema_version":"1.0","canonical_sha256":"004d4e19c2c8a900b36d2e1a28c9e04e5d06fae4774ae739f023812c5b8afb0c","source":{"kind":"arxiv","id":"2111.12665","version":2},"attestation_state":"computed","paper":{"title":"Finite-Time Error Bounds for Distributed Linear Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ji Liu, Vijay Gupta, Yixuan Lin","submitted_at":"2021-11-24T17:51:35Z","abstract_excerpt":"This paper considers a novel multi-agent linear stochastic approximation algorithm driven by Markovian noise and general consensus-type interaction, in which each agent evolves according to its local stochastic approximation process which depends on the information from its neighbors. The interconnection structure among the agents is described by a time-varying directed graph. While the convergence of consensus-based stochastic approximation algorithms when the interconnection among the agents is described by doubly stochastic matrices (at least in expectation) has been studied, less is known "},"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":"2111.12665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-24T17:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"ab01d224eeba129057682dc93336267aad2db4f95358ee845107862358f5777c","abstract_canon_sha256":"9c0bc1da0abdd566655f1e1af090635daa9b7e82bacc8269b9ee0a69a32743e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:20.346807Z","signature_b64":"S+uifLCXsTo9Xj+R5sO6j99h3IZf78h7nxilF9mZzMLXljonOeiZ3jZRiudQGFK2Zrd6DEuhZuoAL6sXRj5SCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"004d4e19c2c8a900b36d2e1a28c9e04e5d06fae4774ae739f023812c5b8afb0c","last_reissued_at":"2026-07-05T06:55:20.346175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:20.346175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-Time Error Bounds for Distributed Linear Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ji Liu, Vijay Gupta, Yixuan Lin","submitted_at":"2021-11-24T17:51:35Z","abstract_excerpt":"This paper considers a novel multi-agent linear stochastic approximation algorithm driven by Markovian noise and general consensus-type interaction, in which each agent evolves according to its local stochastic approximation process which depends on the information from its neighbors. The interconnection structure among the agents is described by a time-varying directed graph. While the convergence of consensus-based stochastic approximation algorithms when the interconnection among the agents is described by doubly stochastic matrices (at least in expectation) has been studied, less is known "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12665","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.12665/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":"2111.12665","created_at":"2026-07-05T06:55:20.346264+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.12665v2","created_at":"2026-07-05T06:55:20.346264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12665","created_at":"2026-07-05T06:55:20.346264+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABGU4GOCZCUQ","created_at":"2026-07-05T06:55:20.346264+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABGU4GOCZCUQBM3N","created_at":"2026-07-05T06:55:20.346264+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABGU4GOC","created_at":"2026-07-05T06:55:20.346264+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/ABGU4GOCZCUQBM3NFYNCRSPAJZ","json":"https://pith.science/pith/ABGU4GOCZCUQBM3NFYNCRSPAJZ.json","graph_json":"https://pith.science/api/pith-number/ABGU4GOCZCUQBM3NFYNCRSPAJZ/graph.json","events_json":"https://pith.science/api/pith-number/ABGU4GOCZCUQBM3NFYNCRSPAJZ/events.json","paper":"https://pith.science/paper/ABGU4GOC"},"agent_actions":{"view_html":"https://pith.science/pith/ABGU4GOCZCUQBM3NFYNCRSPAJZ","download_json":"https://pith.science/pith/ABGU4GOCZCUQBM3NFYNCRSPAJZ.json","view_paper":"https://pith.science/paper/ABGU4GOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.12665&json=true","fetch_graph":"https://pith.science/api/pith-number/ABGU4GOCZCUQBM3NFYNCRSPAJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ABGU4GOCZCUQBM3NFYNCRSPAJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABGU4GOCZCUQBM3NFYNCRSPAJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABGU4GOCZCUQBM3NFYNCRSPAJZ/action/storage_attestation","attest_author":"https://pith.science/pith/ABGU4GOCZCUQBM3NFYNCRSPAJZ/action/author_attestation","sign_citation":"https://pith.science/pith/ABGU4GOCZCUQBM3NFYNCRSPAJZ/action/citation_signature","submit_replication":"https://pith.science/pith/ABGU4GOCZCUQBM3NFYNCRSPAJZ/action/replication_record"}},"created_at":"2026-07-05T06:55:20.346264+00:00","updated_at":"2026-07-05T06:55:20.346264+00:00"}