{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CJ4YCPAQARR77XWBCINPJ5MRFT","short_pith_number":"pith:CJ4YCPAQ","schema_version":"1.0","canonical_sha256":"1279813c100463ffdec1121af4f5912cd17013f4074a86d878498c254167d629","source":{"kind":"arxiv","id":"1203.1505","version":2},"attestation_state":"computed","paper":{"title":"Performance of a Distributed Stochastic Approximation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Gersende Fort, Pascal Bianchi, Walid Hachem","submitted_at":"2012-03-07T15:44:31Z","abstract_excerpt":"In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing. The algorithm consists in two steps: a local step, where each node in a network updates a local estimate using a stochastic approximation algorithm with decreasing step size, and a gossip step, where a node computes a local weighted average between its estimates and those of its neighbors. Convergence of the estimates toward a consensus is established under weak assumptions. The approach relies on two main ingredients:"},"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":"1203.1505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-07T15:44:31Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"83f8ba6650e3cd7910d70f0cc18b8e4ba661cda1daac9ef19f7736653aeb47d0","abstract_canon_sha256":"f83eabad9af9f8c82e35e90a889321af51750af00101173f7bbbc74601b12c3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:55.118499Z","signature_b64":"m3D9AZKfSv7XwrikrM2GIo2eAdPRa5kTpJOLTUGPgU/1iczF1srfW//9E6Q4oysXnS2i2q7wuGrkKIh4t3gMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1279813c100463ffdec1121af4f5912cd17013f4074a86d878498c254167d629","last_reissued_at":"2026-05-18T03:05:55.117878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:55.117878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance of a Distributed Stochastic Approximation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Gersende Fort, Pascal Bianchi, Walid Hachem","submitted_at":"2012-03-07T15:44:31Z","abstract_excerpt":"In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing. The algorithm consists in two steps: a local step, where each node in a network updates a local estimate using a stochastic approximation algorithm with decreasing step size, and a gossip step, where a node computes a local weighted average between its estimates and those of its neighbors. Convergence of the estimates toward a consensus is established under weak assumptions. The approach relies on two main ingredients:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1505","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":"1203.1505","created_at":"2026-05-18T03:05:55.117977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1505v2","created_at":"2026-05-18T03:05:55.117977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1505","created_at":"2026-05-18T03:05:55.117977+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJ4YCPAQARR7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJ4YCPAQARR77XWB","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJ4YCPAQ","created_at":"2026-05-18T12:27:01.376967+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/CJ4YCPAQARR77XWBCINPJ5MRFT","json":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT.json","graph_json":"https://pith.science/api/pith-number/CJ4YCPAQARR77XWBCINPJ5MRFT/graph.json","events_json":"https://pith.science/api/pith-number/CJ4YCPAQARR77XWBCINPJ5MRFT/events.json","paper":"https://pith.science/paper/CJ4YCPAQ"},"agent_actions":{"view_html":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT","download_json":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT.json","view_paper":"https://pith.science/paper/CJ4YCPAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1505&json=true","fetch_graph":"https://pith.science/api/pith-number/CJ4YCPAQARR77XWBCINPJ5MRFT/graph.json","fetch_events":"https://pith.science/api/pith-number/CJ4YCPAQARR77XWBCINPJ5MRFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/action/storage_attestation","attest_author":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/action/author_attestation","sign_citation":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/action/citation_signature","submit_replication":"https://pith.science/pith/CJ4YCPAQARR77XWBCINPJ5MRFT/action/replication_record"}},"created_at":"2026-05-18T03:05:55.117977+00:00","updated_at":"2026-05-18T03:05:55.117977+00:00"}