{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DGX765PI6OGPIANTAQIHJEQIMX","short_pith_number":"pith:DGX765PI","schema_version":"1.0","canonical_sha256":"19afff75e8f38cf401b3041074920865f5c87ed513ce19599c9cac8ed7f24839","source":{"kind":"arxiv","id":"1104.2773","version":2},"attestation_state":"computed","paper":{"title":"Distributed Stochastic Approximation for Constrained and Unconstrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J\\'er\\'emie Jakubowicz, Pascal Bianchi","submitted_at":"2011-04-14T14:20:11Z","abstract_excerpt":"In this paper, we analyze the convergence of a distributed Robbins-Monro algorithm for both constrained and unconstrained optimization in multi-agent systems. The algorithm searches for local minima of a (nonconvex) objective function which is supposed to coincide with a sum of local utility functions of the agents. The algorithm under study consists of two steps: a local stochastic gradient descent at each agent and a gossip step that drives the network of agents to a consensus. It is proved that i) an agreement is achieved between agents on the value of the estimate, ii) the algorithm conver"},"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":"1104.2773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-14T14:20:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5f00a070c467ae4f6854e8b7455ab29c5e104d96a117396e3055e9d1edc4666","abstract_canon_sha256":"c7c9e57306e39eca3bf80036699319a83faaece7522eb60f29b38143c96d74f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:55.976665Z","signature_b64":"T3EXBAPrYCI/Ya3mPkJ3/aIN8QL+WaVLaahhnZxd2l8dC8HIWscYLoi3PZazPaTWzIjD5iCAIHZt5AxVGrYxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19afff75e8f38cf401b3041074920865f5c87ed513ce19599c9cac8ed7f24839","last_reissued_at":"2026-05-18T04:23:55.976161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:55.976161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Stochastic Approximation for Constrained and Unconstrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J\\'er\\'emie Jakubowicz, Pascal Bianchi","submitted_at":"2011-04-14T14:20:11Z","abstract_excerpt":"In this paper, we analyze the convergence of a distributed Robbins-Monro algorithm for both constrained and unconstrained optimization in multi-agent systems. The algorithm searches for local minima of a (nonconvex) objective function which is supposed to coincide with a sum of local utility functions of the agents. The algorithm under study consists of two steps: a local stochastic gradient descent at each agent and a gossip step that drives the network of agents to a consensus. It is proved that i) an agreement is achieved between agents on the value of the estimate, ii) the algorithm conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2773","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":"1104.2773","created_at":"2026-05-18T04:23:55.976241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2773v2","created_at":"2026-05-18T04:23:55.976241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2773","created_at":"2026-05-18T04:23:55.976241+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGX765PI6OGP","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGX765PI6OGPIANT","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGX765PI","created_at":"2026-05-18T12:26:26.731475+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/DGX765PI6OGPIANTAQIHJEQIMX","json":"https://pith.science/pith/DGX765PI6OGPIANTAQIHJEQIMX.json","graph_json":"https://pith.science/api/pith-number/DGX765PI6OGPIANTAQIHJEQIMX/graph.json","events_json":"https://pith.science/api/pith-number/DGX765PI6OGPIANTAQIHJEQIMX/events.json","paper":"https://pith.science/paper/DGX765PI"},"agent_actions":{"view_html":"https://pith.science/pith/DGX765PI6OGPIANTAQIHJEQIMX","download_json":"https://pith.science/pith/DGX765PI6OGPIANTAQIHJEQIMX.json","view_paper":"https://pith.science/paper/DGX765PI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2773&json=true","fetch_graph":"https://pith.science/api/pith-number/DGX765PI6OGPIANTAQIHJEQIMX/graph.json","fetch_events":"https://pith.science/api/pith-number/DGX765PI6OGPIANTAQIHJEQIMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGX765PI6OGPIANTAQIHJEQIMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGX765PI6OGPIANTAQIHJEQIMX/action/storage_attestation","attest_author":"https://pith.science/pith/DGX765PI6OGPIANTAQIHJEQIMX/action/author_attestation","sign_citation":"https://pith.science/pith/DGX765PI6OGPIANTAQIHJEQIMX/action/citation_signature","submit_replication":"https://pith.science/pith/DGX765PI6OGPIANTAQIHJEQIMX/action/replication_record"}},"created_at":"2026-05-18T04:23:55.976241+00:00","updated_at":"2026-05-18T04:23:55.976241+00:00"}