{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZGAF5C3XGG7AOS7BUU5WEPYBCZ","short_pith_number":"pith:ZGAF5C3X","schema_version":"1.0","canonical_sha256":"c9805e8b7731be074be1a53b623f01165b60c38e398ebd570934ef0db9ffaa85","source":{"kind":"arxiv","id":"1708.06851","version":2},"attestation_state":"computed","paper":{"title":"Linear Stochastic Approximation Algorithms and Group Consensus over Random Signed Networks: A Technical Report with All Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Bullo, Ge Chen, Wenjun Mei, Xiaoming Duan","submitted_at":"2017-08-22T23:32:42Z","abstract_excerpt":"This paper studies linear stochastic approximation (SA) algorithms and their application to multi-agent systems in engineering and sociology. As main contribution, we provide necessary and sufficient conditions for convergence of linear SA algorithms to a deterministic or random final vector. We also characterize the system convergence rate, when the system is convergent. Moreover, differing from non-negative gain functions in traditional SA algorithms, this paper considers also the case when the gain functions are allowed to take arbitrary real numbers. Using our general treatment, we provide"},"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":"1708.06851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T23:32:42Z","cross_cats_sorted":[],"title_canon_sha256":"02d374ede540468f5798185876d32f895a0eadade5d76869e78088d4fa8a795a","abstract_canon_sha256":"c866e014ac5bf83218b4bb159d95f99d0e2156f9822ef6010dbc8f225c859acc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:25.476547Z","signature_b64":"89t+JBYlmfQw3UnE8r7//fvE+GQ7HXGslad7VIMfok3HmmTmvoONl239EgZYiVlN/Koy3ipiUPOg+uXTUjubAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9805e8b7731be074be1a53b623f01165b60c38e398ebd570934ef0db9ffaa85","last_reissued_at":"2026-05-18T00:06:25.475875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:25.475875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Stochastic Approximation Algorithms and Group Consensus over Random Signed Networks: A Technical Report with All Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Bullo, Ge Chen, Wenjun Mei, Xiaoming Duan","submitted_at":"2017-08-22T23:32:42Z","abstract_excerpt":"This paper studies linear stochastic approximation (SA) algorithms and their application to multi-agent systems in engineering and sociology. As main contribution, we provide necessary and sufficient conditions for convergence of linear SA algorithms to a deterministic or random final vector. We also characterize the system convergence rate, when the system is convergent. Moreover, differing from non-negative gain functions in traditional SA algorithms, this paper considers also the case when the gain functions are allowed to take arbitrary real numbers. Using our general treatment, we provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06851","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":"1708.06851","created_at":"2026-05-18T00:06:25.475966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06851v2","created_at":"2026-05-18T00:06:25.475966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06851","created_at":"2026-05-18T00:06:25.475966+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGAF5C3XGG7A","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGAF5C3XGG7AOS7B","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGAF5C3X","created_at":"2026-05-18T12:31:59.375834+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/ZGAF5C3XGG7AOS7BUU5WEPYBCZ","json":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ.json","graph_json":"https://pith.science/api/pith-number/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/graph.json","events_json":"https://pith.science/api/pith-number/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/events.json","paper":"https://pith.science/paper/ZGAF5C3X"},"agent_actions":{"view_html":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ","download_json":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ.json","view_paper":"https://pith.science/paper/ZGAF5C3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06851&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/action/replication_record"}},"created_at":"2026-05-18T00:06:25.475966+00:00","updated_at":"2026-05-18T00:06:25.475966+00:00"}