{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FCXDJEPB36U4DFIM2D6MIIJ7FL","short_pith_number":"pith:FCXDJEPB","canonical_record":{"source":{"id":"1410.1977","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-08T03:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"7268f18aa91d9f014566aee740095edf985cf2d1ee195b74492035762df1fa7d","abstract_canon_sha256":"968c9bc56e5c796d4913609742f3731fe214fc80f3d02bfb047b36581afdf93d"},"schema_version":"1.0"},"canonical_sha256":"28ae3491e1dfa9c1950cd0fcc4213f2afb18332b99da5191bd232ac4be9d89d3","source":{"kind":"arxiv","id":"1410.1977","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1977","created_at":"2026-05-18T01:34:57Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1977v2","created_at":"2026-05-18T01:34:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1977","created_at":"2026-05-18T01:34:57Z"},{"alias_kind":"pith_short_12","alias_value":"FCXDJEPB36U4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FCXDJEPB36U4DFIM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FCXDJEPB","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FCXDJEPB36U4DFIM2D6MIIJ7FL","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1977","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-08T03:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"7268f18aa91d9f014566aee740095edf985cf2d1ee195b74492035762df1fa7d","abstract_canon_sha256":"968c9bc56e5c796d4913609742f3731fe214fc80f3d02bfb047b36581afdf93d"},"schema_version":"1.0"},"canonical_sha256":"28ae3491e1dfa9c1950cd0fcc4213f2afb18332b99da5191bd232ac4be9d89d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:57.400019Z","signature_b64":"gPMt3VUS578hky7HK7GeMhCfI0EmBYikkYixfMGyAZ9PJ1oekL/DPF6zF+CAFQYCTa+xlSFBtC30apIAZ666DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28ae3491e1dfa9c1950cd0fcc4213f2afb18332b99da5191bd232ac4be9d89d3","last_reissued_at":"2026-05-18T01:34:57.399325Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:57.399325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1977","source_version":2,"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-18T01:34:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3XFKmFTLNFTZYSAenxkQyltrTBJiXiLPChkQfTUde9f5jFIdoJ1dFt8LtEoTbYYPQsKx6N/o+9DzyHZW0wBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:27:32.780165Z"},"content_sha256":"13bf6c0aceca8c66626c402f39e4677b0566ddf5af447271553317112bd1d6ab","schema_version":"1.0","event_id":"sha256:13bf6c0aceca8c66626c402f39e4677b0566ddf5af447271553317112bd1d6ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FCXDJEPB36U4DFIM2D6MIIJ7FL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonasymptotic Convergence Rates for Cooperative Learning Over Time-Varying Directed Graphs","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":"2014-10-08T03:35:09Z","abstract_excerpt":"We study the problem of distributed hypothesis testing with a network of agents where some agents repeatedly gain access to information about the correct hypothesis. The group objective is to globally agree on a joint hypothesis that best describes the observed data at all the nodes. We assume that the agents can interact with their neighbors in an unknown sequence of time-varying directed graphs. Following the pioneering work of Jadbabaie, Molavi, Sandroni, and Tahbaz-Salehi, we propose local learning dynamics which combine Bayesian updates at each node with a local aggregation rule of privat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1977","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"},"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-18T01:34:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwueSI10m8Zlrm6LpgSQJJ6UNlVe3uarYzGlphFnKoikYeW8IKrOLPPTwLNyr0w/fOndUwniUHNnYjjVL5BhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:27:32.780530Z"},"content_sha256":"743cd6ef8a2ac0b0cd80df6a120ca471c2e2a5a67a176a36db64b37986bb8069","schema_version":"1.0","event_id":"sha256:743cd6ef8a2ac0b0cd80df6a120ca471c2e2a5a67a176a36db64b37986bb8069"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/bundle.json","state_url":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/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-02T02:27:32Z","links":{"resolver":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL","bundle":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/bundle.json","state":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FCXDJEPB36U4DFIM2D6MIIJ7FL","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":"968c9bc56e5c796d4913609742f3731fe214fc80f3d02bfb047b36581afdf93d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-08T03:35:09Z","title_canon_sha256":"7268f18aa91d9f014566aee740095edf985cf2d1ee195b74492035762df1fa7d"},"schema_version":"1.0","source":{"id":"1410.1977","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1977","created_at":"2026-05-18T01:34:57Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1977v2","created_at":"2026-05-18T01:34:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1977","created_at":"2026-05-18T01:34:57Z"},{"alias_kind":"pith_short_12","alias_value":"FCXDJEPB36U4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FCXDJEPB36U4DFIM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FCXDJEPB","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:743cd6ef8a2ac0b0cd80df6a120ca471c2e2a5a67a176a36db64b37986bb8069","target":"graph","created_at":"2026-05-18T01:34:57Z","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 distributed hypothesis testing with a network of agents where some agents repeatedly gain access to information about the correct hypothesis. The group objective is to globally agree on a joint hypothesis that best describes the observed data at all the nodes. We assume that the agents can interact with their neighbors in an unknown sequence of time-varying directed graphs. Following the pioneering work of Jadbabaie, Molavi, Sandroni, and Tahbaz-Salehi, we propose local learning dynamics which combine Bayesian updates at each node with a local aggregation rule of privat","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":"2014-10-08T03:35:09Z","title":"Nonasymptotic Convergence Rates for Cooperative Learning Over Time-Varying Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1977","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:13bf6c0aceca8c66626c402f39e4677b0566ddf5af447271553317112bd1d6ab","target":"record","created_at":"2026-05-18T01:34:57Z","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":"968c9bc56e5c796d4913609742f3731fe214fc80f3d02bfb047b36581afdf93d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-08T03:35:09Z","title_canon_sha256":"7268f18aa91d9f014566aee740095edf985cf2d1ee195b74492035762df1fa7d"},"schema_version":"1.0","source":{"id":"1410.1977","kind":"arxiv","version":2}},"canonical_sha256":"28ae3491e1dfa9c1950cd0fcc4213f2afb18332b99da5191bd232ac4be9d89d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28ae3491e1dfa9c1950cd0fcc4213f2afb18332b99da5191bd232ac4be9d89d3","first_computed_at":"2026-05-18T01:34:57.399325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:57.399325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gPMt3VUS578hky7HK7GeMhCfI0EmBYikkYixfMGyAZ9PJ1oekL/DPF6zF+CAFQYCTa+xlSFBtC30apIAZ666DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:57.400019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1977","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13bf6c0aceca8c66626c402f39e4677b0566ddf5af447271553317112bd1d6ab","sha256:743cd6ef8a2ac0b0cd80df6a120ca471c2e2a5a67a176a36db64b37986bb8069"],"state_sha256":"7923443af8ab57bcfa3cd9813846c8f8da14f216b14c31ed1cf82feee06c410a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7gAO5cTDVSCV/1E0OLWCrteukUb23II2U2BjDkzuchfE6IIBfkN2nLEhjLOVhmZ5vnP4qMqjPnEZzOqm3IiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:27:32.782472Z","bundle_sha256":"ecb3015bd77f54b02cbe1eeb6d7f2d8ce8a9d7d8806091803dada046e95c95b7"}}