{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7EAFFJPRFTYTQ44K3DHV6GVDNN","short_pith_number":"pith:7EAFFJPR","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"},"canonical_sha256":"f90052a5f12cf138738ad8cf5f1aa36b73d5a6b89d52f629fd481250a81d3733","source":{"kind":"arxiv","id":"1704.02718","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02718","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02718v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02718","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"7EAFFJPRFTYT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7EAFFJPRFTYTQ44K","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7EAFFJPR","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7EAFFJPRFTYTQ44K3DHV6GVDNN","target":"record","payload":{"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"},"canonical_sha256":"f90052a5f12cf138738ad8cf5f1aa36b73d5a6b89d52f629fd481250a81d3733","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"},"source_kind":"arxiv","source_id":"1704.02718","source_version":1,"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:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swtfnNUfdhDy0tBP8cR7ymnT58DMUojQL2Sij/u62dIGuTiLMt+XDVAarpqic9qWbD2auOzZxktkPrIPxd0CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:24:55.277050Z"},"content_sha256":"1a665626e671a38f5a6c75c95f31b57a3b1e98a16c20401aa982952b3daf133b","schema_version":"1.0","event_id":"sha256:1a665626e671a38f5a6c75c95f31b57a3b1e98a16c20401aa982952b3daf133b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7EAFFJPRFTYTQ44K3DHV6GVDNN","target":"graph","payload":{"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"},"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:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fO+F9gP+0KDz25xnkXnP3577TQJd7hRT8UAqFLYtjMNuobWXqxGvf9n/Vldvz8hUlMJg2KkNye//XEUi+xzmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:24:55.277418Z"},"content_sha256":"4aa7ee1d506d6e08645c1eef6eb92a9f94284b454a0eb186c5c6f6634c6d6220","schema_version":"1.0","event_id":"sha256:4aa7ee1d506d6e08645c1eef6eb92a9f94284b454a0eb186c5c6f6634c6d6220"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/bundle.json","state_url":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/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-02T10:24:55Z","links":{"resolver":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN","bundle":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/bundle.json","state":"https://pith.science/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EAFFJPRFTYTQ44K3DHV6GVDNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7EAFFJPRFTYTQ44K3DHV6GVDNN","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":"591a5026edf8ebdf3fd8abda02c95b66e2b185b955b65daed949e2d3b3096d2e","cross_cats_sorted":["cs.LG","cs.MA","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T06:04:34Z","title_canon_sha256":"70bb2ee5d27f796d831d890a07d75a1e69bab6d8c8426a29b268e98f9b37e574"},"schema_version":"1.0","source":{"id":"1704.02718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02718","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02718v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02718","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"7EAFFJPRFTYT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7EAFFJPRFTYTQ44K","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7EAFFJPR","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:4aa7ee1d506d6e08645c1eef6eb92a9f94284b454a0eb186c5c6f6634c6d6220","target":"graph","created_at":"2026-05-18T00:46:44Z","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":"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","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe","cross_cats":["cs.LG","cs.MA","math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T06:04:34Z","title":"Distributed Learning for Cooperative Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02718","kind":"arxiv","version":1},"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:1a665626e671a38f5a6c75c95f31b57a3b1e98a16c20401aa982952b3daf133b","target":"record","created_at":"2026-05-18T00:46:44Z","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":"591a5026edf8ebdf3fd8abda02c95b66e2b185b955b65daed949e2d3b3096d2e","cross_cats_sorted":["cs.LG","cs.MA","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T06:04:34Z","title_canon_sha256":"70bb2ee5d27f796d831d890a07d75a1e69bab6d8c8426a29b268e98f9b37e574"},"schema_version":"1.0","source":{"id":"1704.02718","kind":"arxiv","version":1}},"canonical_sha256":"f90052a5f12cf138738ad8cf5f1aa36b73d5a6b89d52f629fd481250a81d3733","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f90052a5f12cf138738ad8cf5f1aa36b73d5a6b89d52f629fd481250a81d3733","first_computed_at":"2026-05-18T00:46:44.635549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:44.635549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DCHAaDEoBHh2ZffnipMnDuzeDKVtR5loWoPEEJaae/bIlf2zq+Az3NCqQw3C7dH2myK+729jlOUveckRMkm0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:44.636163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a665626e671a38f5a6c75c95f31b57a3b1e98a16c20401aa982952b3daf133b","sha256:4aa7ee1d506d6e08645c1eef6eb92a9f94284b454a0eb186c5c6f6634c6d6220"],"state_sha256":"5f551fc8e600a752e4a6da185e13a2314ded0423f17493f8a92b1345d760705c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5bartp/98eGIg9n3YJZyf8edpP/G4jkLHsvYxWQShYwQmARDMr6SIC53XukGthA3ZhX8ef5np1X4o/9N1YEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:24:55.279416Z","bundle_sha256":"f36154573c82c3676bc53717d212f3a0c0de4c6375afc779625814af8bcc42d6"}}