{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DGX765PI6OGPIANTAQIHJEQIMX","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":"c7c9e57306e39eca3bf80036699319a83faaece7522eb60f29b38143c96d74f7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-14T14:20:11Z","title_canon_sha256":"f5f00a070c467ae4f6854e8b7455ab29c5e104d96a117396e3055e9d1edc4666"},"schema_version":"1.0","source":{"id":"1104.2773","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2773","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2773v2","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2773","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"DGX765PI6OGP","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DGX765PI6OGPIANT","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DGX765PI","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:f32a2cc396bea5972a11c898e3138729de19b8c953e64aa32e0505cfd406c2e9","target":"graph","created_at":"2026-05-18T04:23:55Z","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":"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","authors_text":"J\\'er\\'emie Jakubowicz, Pascal Bianchi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-14T14:20:11Z","title":"Distributed Stochastic Approximation for Constrained and Unconstrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2773","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:222220442f8fef13e1c8aad2f7874bc646c1b4f00e10e17b08621cdb9c83cb61","target":"record","created_at":"2026-05-18T04:23:55Z","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":"c7c9e57306e39eca3bf80036699319a83faaece7522eb60f29b38143c96d74f7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-14T14:20:11Z","title_canon_sha256":"f5f00a070c467ae4f6854e8b7455ab29c5e104d96a117396e3055e9d1edc4666"},"schema_version":"1.0","source":{"id":"1104.2773","kind":"arxiv","version":2}},"canonical_sha256":"19afff75e8f38cf401b3041074920865f5c87ed513ce19599c9cac8ed7f24839","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19afff75e8f38cf401b3041074920865f5c87ed513ce19599c9cac8ed7f24839","first_computed_at":"2026-05-18T04:23:55.976161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:55.976161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T3EXBAPrYCI/Ya3mPkJ3/aIN8QL+WaVLaahhnZxd2l8dC8HIWscYLoi3PZazPaTWzIjD5iCAIHZt5AxVGrYxBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:55.976665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2773","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:222220442f8fef13e1c8aad2f7874bc646c1b4f00e10e17b08621cdb9c83cb61","sha256:f32a2cc396bea5972a11c898e3138729de19b8c953e64aa32e0505cfd406c2e9"],"state_sha256":"2d05d7dab25a8d49cc98abff293ff30f2a920e6e80541d860ff83083126a4456"}