{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FCXDJEPB36U4DFIM2D6MIIJ7FL","short_pith_number":"pith:FCXDJEPB","schema_version":"1.0","canonical_sha256":"28ae3491e1dfa9c1950cd0fcc4213f2afb18332b99da5191bd232ac4be9d89d3","source":{"kind":"arxiv","id":"1410.1977","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.1977","created_at":"2026-05-18T01:34:57.399433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.1977v2","created_at":"2026-05-18T01:34:57.399433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1977","created_at":"2026-05-18T01:34:57.399433+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCXDJEPB36U4","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCXDJEPB36U4DFIM","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCXDJEPB","created_at":"2026-05-18T12:28:28.263976+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/FCXDJEPB36U4DFIM2D6MIIJ7FL","json":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL.json","graph_json":"https://pith.science/api/pith-number/FCXDJEPB36U4DFIM2D6MIIJ7FL/graph.json","events_json":"https://pith.science/api/pith-number/FCXDJEPB36U4DFIM2D6MIIJ7FL/events.json","paper":"https://pith.science/paper/FCXDJEPB"},"agent_actions":{"view_html":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL","download_json":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL.json","view_paper":"https://pith.science/paper/FCXDJEPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.1977&json=true","fetch_graph":"https://pith.science/api/pith-number/FCXDJEPB36U4DFIM2D6MIIJ7FL/graph.json","fetch_events":"https://pith.science/api/pith-number/FCXDJEPB36U4DFIM2D6MIIJ7FL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/action/storage_attestation","attest_author":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/action/author_attestation","sign_citation":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/action/citation_signature","submit_replication":"https://pith.science/pith/FCXDJEPB36U4DFIM2D6MIIJ7FL/action/replication_record"}},"created_at":"2026-05-18T01:34:57.399433+00:00","updated_at":"2026-05-18T01:34:57.399433+00:00"}