{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZGAF5C3XGG7AOS7BUU5WEPYBCZ","short_pith_number":"pith:ZGAF5C3X","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"},"canonical_sha256":"c9805e8b7731be074be1a53b623f01165b60c38e398ebd570934ef0db9ffaa85","source":{"kind":"arxiv","id":"1708.06851","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06851","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06851v2","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06851","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZGAF5C3XGG7A","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZGAF5C3XGG7AOS7B","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZGAF5C3X","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZGAF5C3XGG7AOS7BUU5WEPYBCZ","target":"record","payload":{"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"},"canonical_sha256":"c9805e8b7731be074be1a53b623f01165b60c38e398ebd570934ef0db9ffaa85","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"},"source_kind":"arxiv","source_id":"1708.06851","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-18T00:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MUo4A9DShdQErA6jMRk0e0V5Hg1HrbecrJEGbw22CCZeEzyIo3GaRnl3L3xpy7MtHCCmgpwhpF+CyH4IJwiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:52:44.428660Z"},"content_sha256":"05dfe24193075f4d096ff6485601cfcf90f1c750dd81fb56410876bd2f337a08","schema_version":"1.0","event_id":"sha256:05dfe24193075f4d096ff6485601cfcf90f1c750dd81fb56410876bd2f337a08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZGAF5C3XGG7AOS7BUU5WEPYBCZ","target":"graph","payload":{"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"},"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-18T00:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGlNlY7Zl6wux8aa/UL1RxxWRG36XsXxcd+oZOxoA5HwH3HNH7R00YcVah9TLuKvL0nBeapCB5IXVFYs4XdnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:52:44.428995Z"},"content_sha256":"d46158b7873912a1aac66a1ccd34ff740a5276c6f6d7da79794fb0f6554b191b","schema_version":"1.0","event_id":"sha256:d46158b7873912a1aac66a1ccd34ff740a5276c6f6d7da79794fb0f6554b191b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/bundle.json","state_url":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/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-20T02:52:44Z","links":{"resolver":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ","bundle":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/bundle.json","state":"https://pith.science/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGAF5C3XGG7AOS7BUU5WEPYBCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZGAF5C3XGG7AOS7BUU5WEPYBCZ","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":"c866e014ac5bf83218b4bb159d95f99d0e2156f9822ef6010dbc8f225c859acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T23:32:42Z","title_canon_sha256":"02d374ede540468f5798185876d32f895a0eadade5d76869e78088d4fa8a795a"},"schema_version":"1.0","source":{"id":"1708.06851","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06851","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06851v2","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06851","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZGAF5C3XGG7A","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZGAF5C3XGG7AOS7B","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZGAF5C3X","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:d46158b7873912a1aac66a1ccd34ff740a5276c6f6d7da79794fb0f6554b191b","target":"graph","created_at":"2026-05-18T00:06:25Z","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 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","authors_text":"Francesco Bullo, Ge Chen, Wenjun Mei, Xiaoming Duan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T23:32:42Z","title":"Linear Stochastic Approximation Algorithms and Group Consensus over Random Signed Networks: A Technical Report with All Proofs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06851","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:05dfe24193075f4d096ff6485601cfcf90f1c750dd81fb56410876bd2f337a08","target":"record","created_at":"2026-05-18T00:06:25Z","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":"c866e014ac5bf83218b4bb159d95f99d0e2156f9822ef6010dbc8f225c859acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T23:32:42Z","title_canon_sha256":"02d374ede540468f5798185876d32f895a0eadade5d76869e78088d4fa8a795a"},"schema_version":"1.0","source":{"id":"1708.06851","kind":"arxiv","version":2}},"canonical_sha256":"c9805e8b7731be074be1a53b623f01165b60c38e398ebd570934ef0db9ffaa85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9805e8b7731be074be1a53b623f01165b60c38e398ebd570934ef0db9ffaa85","first_computed_at":"2026-05-18T00:06:25.475875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:25.475875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"89t+JBYlmfQw3UnE8r7//fvE+GQ7HXGslad7VIMfok3HmmTmvoONl239EgZYiVlN/Koy3ipiUPOg+uXTUjubAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:25.476547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06851","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05dfe24193075f4d096ff6485601cfcf90f1c750dd81fb56410876bd2f337a08","sha256:d46158b7873912a1aac66a1ccd34ff740a5276c6f6d7da79794fb0f6554b191b"],"state_sha256":"cd0f6081c5211fb0b6f28e317470810ce75db1d8140dde084d6ad14f1059efd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHyBq+lMNPjtQwibCGVHtJ8Y6qxQSNQdViJeQy/aqr2KwjbJsg7neADIx1dZK845sLHya4J7FEBOfssPZjxaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:52:44.430830Z","bundle_sha256":"4ce710043100527230d071ab5c1454bbb4dcd49965ca4793b155d47d733fdf36"}}