{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IWQU5WO4EKMN6542AOHJGYPID5","short_pith_number":"pith:IWQU5WO4","canonical_record":{"source":{"id":"1508.05161","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-21T01:32:03Z","cross_cats_sorted":[],"title_canon_sha256":"6fd1de305fb688def2a9e82fe77937459f8170a1c30a86e19fd74538541032a2","abstract_canon_sha256":"c4cb61cacf0dd77c26585acf803063906687d4ebc60302b1d98610bc422d4a5b"},"schema_version":"1.0"},"canonical_sha256":"45a14ed9dc2298df779a038e9361e81f522e119dec0df7c4399e3768202b3b9b","source":{"kind":"arxiv","id":"1508.05161","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05161","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05161v5","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05161","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"IWQU5WO4EKMN","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IWQU5WO4EKMN6542","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IWQU5WO4","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IWQU5WO4EKMN6542AOHJGYPID5","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05161","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-21T01:32:03Z","cross_cats_sorted":[],"title_canon_sha256":"6fd1de305fb688def2a9e82fe77937459f8170a1c30a86e19fd74538541032a2","abstract_canon_sha256":"c4cb61cacf0dd77c26585acf803063906687d4ebc60302b1d98610bc422d4a5b"},"schema_version":"1.0"},"canonical_sha256":"45a14ed9dc2298df779a038e9361e81f522e119dec0df7c4399e3768202b3b9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:43.156527Z","signature_b64":"dB1AAFQ8iUtAVtnb79LixJHBDUecPr2dIxP9U5BOezSieq8A3oiBxxb2a9O1eJKaNdVNx8EYKYfn4QauW9TQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a14ed9dc2298df779a038e9361e81f522e119dec0df7c4399e3768202b3b9b","last_reissued_at":"2026-05-18T00:46:43.155945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:43.155945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05161","source_version":5,"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wyEhioqRVBi62ZPymoIwCy1J6P8Irmc+YqKVthqD+eyu8Sr2eug2TvoTbvdMpkTt+UQL6TPi7ezbP2TuaXWfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:16:22.494169Z"},"content_sha256":"63a5cb4fe0a67c3b5214b3b56ef21de9f909f9966fd5adb9b6018916be7b0b14","schema_version":"1.0","event_id":"sha256:63a5cb4fe0a67c3b5214b3b56ef21de9f909f9966fd5adb9b6018916be7b0b14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IWQU5WO4EKMN6542AOHJGYPID5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Convergence Rates for Distributed Non-Bayesian Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe","submitted_at":"2015-08-21T01:32:03Z","abstract_excerpt":"We consider the problem of distributed learning, where a network of agents collectively aim to agree on a hypothesis that best explains a set of distributed observations of conditionally independent random processes. We propose a distributed algorithm and establish consistency, as well as a non-asymptotic, explicit and geometric convergence rate for the concentration of the beliefs around the set of optimal hypotheses. Additionally, if the agents interact over static networks, we provide an improved learning protocol with better scalability with respect to the number of nodes in the network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05161","kind":"arxiv","version":5},"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKbnS8YOHEhfcJ7Csuu265zDGTspI2EclT5gnuQhXm5hw9kVhchtporvTZ/Bml8dwgoKDvdZjHF+0mRPOxXiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:16:22.494530Z"},"content_sha256":"076a48a637672230c80f058d60cd5f45258643b33dfa57edec74177a95601ed1","schema_version":"1.0","event_id":"sha256:076a48a637672230c80f058d60cd5f45258643b33dfa57edec74177a95601ed1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWQU5WO4EKMN6542AOHJGYPID5/bundle.json","state_url":"https://pith.science/pith/IWQU5WO4EKMN6542AOHJGYPID5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWQU5WO4EKMN6542AOHJGYPID5/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-02T08:16:22Z","links":{"resolver":"https://pith.science/pith/IWQU5WO4EKMN6542AOHJGYPID5","bundle":"https://pith.science/pith/IWQU5WO4EKMN6542AOHJGYPID5/bundle.json","state":"https://pith.science/pith/IWQU5WO4EKMN6542AOHJGYPID5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWQU5WO4EKMN6542AOHJGYPID5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IWQU5WO4EKMN6542AOHJGYPID5","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":"c4cb61cacf0dd77c26585acf803063906687d4ebc60302b1d98610bc422d4a5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-21T01:32:03Z","title_canon_sha256":"6fd1de305fb688def2a9e82fe77937459f8170a1c30a86e19fd74538541032a2"},"schema_version":"1.0","source":{"id":"1508.05161","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05161","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05161v5","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05161","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"IWQU5WO4EKMN","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IWQU5WO4EKMN6542","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IWQU5WO4","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:076a48a637672230c80f058d60cd5f45258643b33dfa57edec74177a95601ed1","target":"graph","created_at":"2026-05-18T00:46:43Z","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 consider the problem of distributed learning, where a network of agents collectively aim to agree on a hypothesis that best explains a set of distributed observations of conditionally independent random processes. We propose a distributed algorithm and establish consistency, as well as a non-asymptotic, explicit and geometric convergence rate for the concentration of the beliefs around the set of optimal hypotheses. Additionally, if the agents interact over static networks, we provide an improved learning protocol with better scalability with respect to the number of nodes in the network.","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-21T01:32:03Z","title":"Fast Convergence Rates for Distributed Non-Bayesian Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05161","kind":"arxiv","version":5},"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:63a5cb4fe0a67c3b5214b3b56ef21de9f909f9966fd5adb9b6018916be7b0b14","target":"record","created_at":"2026-05-18T00:46:43Z","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":"c4cb61cacf0dd77c26585acf803063906687d4ebc60302b1d98610bc422d4a5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-21T01:32:03Z","title_canon_sha256":"6fd1de305fb688def2a9e82fe77937459f8170a1c30a86e19fd74538541032a2"},"schema_version":"1.0","source":{"id":"1508.05161","kind":"arxiv","version":5}},"canonical_sha256":"45a14ed9dc2298df779a038e9361e81f522e119dec0df7c4399e3768202b3b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45a14ed9dc2298df779a038e9361e81f522e119dec0df7c4399e3768202b3b9b","first_computed_at":"2026-05-18T00:46:43.155945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:43.155945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dB1AAFQ8iUtAVtnb79LixJHBDUecPr2dIxP9U5BOezSieq8A3oiBxxb2a9O1eJKaNdVNx8EYKYfn4QauW9TQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:43.156527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05161","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63a5cb4fe0a67c3b5214b3b56ef21de9f909f9966fd5adb9b6018916be7b0b14","sha256:076a48a637672230c80f058d60cd5f45258643b33dfa57edec74177a95601ed1"],"state_sha256":"80cabbcf1578fce81a6d650254618cbc77eb109b1f5b7de89b8b62f4610057aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MPRJCzPKmFKL3SiAlHUHFK8FWqHhM/v57iZJKfu50EP/zKJxOLs4oC2r3lR94TdLYJNzafejkIymBaojNc8bBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:16:22.496459Z","bundle_sha256":"230e732066d78a0b2e9a2391bab7bfcf6604c040005c63054a88b2dc7a0819d2"}}