{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7EAFFJPRFTYTQ44K3DHV6GVDNN","short_pith_number":"pith:7EAFFJPR","schema_version":"1.0","canonical_sha256":"f90052a5f12cf138738ad8cf5f1aa36b73d5a6b89d52f629fd481250a81d3733","source":{"kind":"arxiv","id":"1704.02718","version":1},"attestation_state":"computed","paper":{"title":"Distributed Learning for Cooperative Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","math.PR","stat.ML"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe","submitted_at":"2017-04-10T06:04:34Z","abstract_excerpt":"We study the problem of cooperative inference where a group of agents interact over a network and seek to estimate a joint parameter that best explains a set of observations. Agents do not know the network topology or the observations of other agents. We explore a variational interpretation of the Bayesian posterior density, and its relation to the stochastic mirror descent algorithm, to propose a new distributed learning algorithm. We show that, under appropriate assumptions, the beliefs generated by the proposed algorithm concentrate around the true parameter exponentially fast. We provide e"},"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":"1704.02718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T06:04:34Z","cross_cats_sorted":["cs.LG","cs.MA","math.PR","stat.ML"],"title_canon_sha256":"70bb2ee5d27f796d831d890a07d75a1e69bab6d8c8426a29b268e98f9b37e574","abstract_canon_sha256":"591a5026edf8ebdf3fd8abda02c95b66e2b185b955b65daed949e2d3b3096d2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:44.636163Z","signature_b64":"DCHAaDEoBHh2ZffnipMnDuzeDKVtR5loWoPEEJaae/bIlf2zq+Az3NCqQw3C7dH2myK+729jlOUveckRMkm0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f90052a5f12cf138738ad8cf5f1aa36b73d5a6b89d52f629fd481250a81d3733","last_reissued_at":"2026-05-18T00:46:44.635549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:44.635549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Learning for Cooperative Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","math.PR","stat.ML"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe","submitted_at":"2017-04-10T06:04:34Z","abstract_excerpt":"We study the problem of cooperative inference where a group of agents interact over a network and seek to estimate a joint parameter that best explains a set of observations. Agents do not know the network topology or the observations of other agents. We explore a variational interpretation of the Bayesian posterior density, and its relation to the stochastic mirror descent algorithm, to propose a new distributed learning algorithm. We show that, under appropriate assumptions, the beliefs generated by the proposed algorithm concentrate around the true parameter exponentially fast. We provide e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02718","kind":"arxiv","version":1},"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":"1704.02718","created_at":"2026-05-18T00:46:44.635675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02718v1","created_at":"2026-05-18T00:46:44.635675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02718","created_at":"2026-05-18T00:46:44.635675+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EAFFJPRFTYT","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EAFFJPRFTYTQ44K","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EAFFJPR","created_at":"2026-05-18T12:31:05.417338+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/7EAFFJPRFTYTQ44K3DHV6GVDNN","json":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN.json","graph_json":"https://pith.science/api/pith-number/7EAFFJPRFTYTQ44K3DHV6GVDNN/graph.json","events_json":"https://pith.science/api/pith-number/7EAFFJPRFTYTQ44K3DHV6GVDNN/events.json","paper":"https://pith.science/paper/7EAFFJPR"},"agent_actions":{"view_html":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN","download_json":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN.json","view_paper":"https://pith.science/paper/7EAFFJPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02718&json=true","fetch_graph":"https://pith.science/api/pith-number/7EAFFJPRFTYTQ44K3DHV6GVDNN/graph.json","fetch_events":"https://pith.science/api/pith-number/7EAFFJPRFTYTQ44K3DHV6GVDNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/action/storage_attestation","attest_author":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/action/author_attestation","sign_citation":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/action/citation_signature","submit_replication":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/action/replication_record"}},"created_at":"2026-05-18T00:46:44.635675+00:00","updated_at":"2026-05-18T00:46:44.635675+00:00"}