{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DW75Y6K2WISPPO2ASFDNTHWK3Y","short_pith_number":"pith:DW75Y6K2","canonical_record":{"source":{"id":"1612.01600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-06T00:15:33Z","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","stat.ML"],"title_canon_sha256":"5bc5a378725152e9f8dc16e08d6fb5717fba7537ca646accd09ddabb8baf9e6d","abstract_canon_sha256":"17a1ef49f7bdcfb6841e9cc8361ce9dafbbcc589738ec322beb29b3e244425df"},"schema_version":"1.0"},"canonical_sha256":"1dbfdc795ab224f7bb409146d99ecade28bfd7fc68c6a8bb89a119190ddcc28a","source":{"kind":"arxiv","id":"1612.01600","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01600","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01600v2","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01600","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"DW75Y6K2WISP","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DW75Y6K2WISPPO2A","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DW75Y6K2","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DW75Y6K2WISPPO2ASFDNTHWK3Y","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-06T00:15:33Z","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","stat.ML"],"title_canon_sha256":"5bc5a378725152e9f8dc16e08d6fb5717fba7537ca646accd09ddabb8baf9e6d","abstract_canon_sha256":"17a1ef49f7bdcfb6841e9cc8361ce9dafbbcc589738ec322beb29b3e244425df"},"schema_version":"1.0"},"canonical_sha256":"1dbfdc795ab224f7bb409146d99ecade28bfd7fc68c6a8bb89a119190ddcc28a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:35.491908Z","signature_b64":"/WDvUpjT4N5zTFpABdG+ol9hckCggOm4cyZ/SJnVKpyvh6qEXioriHJPPWtERuhrvWlPoqbAm7AIa07CWcpeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dbfdc795ab224f7bb409146d99ecade28bfd7fc68c6a8bb89a119190ddcc28a","last_reissued_at":"2026-05-18T00:55:35.491395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:35.491395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01600","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-18T00:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNwNnSNxQPOwQ/QoKsgS/qABSM04cTd/fhjD/e6FAIz+t60nDknEjFfg+pWuhdEuc5a0cOhkgRC8qtffmt0GAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:10:26.309725Z"},"content_sha256":"5a2841b34323ba330a19fd777bfe062a72cdecdc766f097692eccfe4460e14ba","schema_version":"1.0","event_id":"sha256:5a2841b34323ba330a19fd777bfe062a72cdecdc766f097692eccfe4460e14ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DW75Y6K2WISPPO2ASFDNTHWK3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Gaussian Learning over Time-varying Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe","submitted_at":"2016-12-06T00:15:33Z","abstract_excerpt":"We present a distributed (non-Bayesian) learning algorithm for the problem of parameter estimation with Gaussian noise. The algorithm is expressed as explicit updates on the parameters of the Gaussian beliefs (i.e. means and precision). We show a convergence rate of $O(1/k)$ with the constant term depending on the number of agents and the topology of the network. Moreover, we show almost sure convergence to the optimal solution of the estimation problem for the general case of time-varying directed graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01600","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-18T00:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7jfBzDPhXD2YByJK4UGugZYsEKIm0Dk/a6Op0bXX6lB2+2QL2FmwckkbLpOMaDjHv73zYy390qY8E67+9GsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:10:26.310072Z"},"content_sha256":"a194785030086c91ae2d55b3fddf3dc0a61dfd81309074f0defbaf60a57dac77","schema_version":"1.0","event_id":"sha256:a194785030086c91ae2d55b3fddf3dc0a61dfd81309074f0defbaf60a57dac77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DW75Y6K2WISPPO2ASFDNTHWK3Y/bundle.json","state_url":"https://pith.science/pith/DW75Y6K2WISPPO2ASFDNTHWK3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DW75Y6K2WISPPO2ASFDNTHWK3Y/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-02T06:10:26Z","links":{"resolver":"https://pith.science/pith/DW75Y6K2WISPPO2ASFDNTHWK3Y","bundle":"https://pith.science/pith/DW75Y6K2WISPPO2ASFDNTHWK3Y/bundle.json","state":"https://pith.science/pith/DW75Y6K2WISPPO2ASFDNTHWK3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DW75Y6K2WISPPO2ASFDNTHWK3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DW75Y6K2WISPPO2ASFDNTHWK3Y","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":"17a1ef49f7bdcfb6841e9cc8361ce9dafbbcc589738ec322beb29b3e244425df","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-06T00:15:33Z","title_canon_sha256":"5bc5a378725152e9f8dc16e08d6fb5717fba7537ca646accd09ddabb8baf9e6d"},"schema_version":"1.0","source":{"id":"1612.01600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01600","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01600v2","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01600","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"DW75Y6K2WISP","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DW75Y6K2WISPPO2A","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DW75Y6K2","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:a194785030086c91ae2d55b3fddf3dc0a61dfd81309074f0defbaf60a57dac77","target":"graph","created_at":"2026-05-18T00:55:35Z","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 present a distributed (non-Bayesian) learning algorithm for the problem of parameter estimation with Gaussian noise. The algorithm is expressed as explicit updates on the parameters of the Gaussian beliefs (i.e. means and precision). We show a convergence rate of $O(1/k)$ with the constant term depending on the number of agents and the topology of the network. Moreover, we show almost sure convergence to the optimal solution of the estimation problem for the general case of time-varying directed graphs.","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe","cross_cats":["cs.LG","cs.MA","cs.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-06T00:15:33Z","title":"Distributed Gaussian Learning over Time-varying Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01600","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:5a2841b34323ba330a19fd777bfe062a72cdecdc766f097692eccfe4460e14ba","target":"record","created_at":"2026-05-18T00:55:35Z","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":"17a1ef49f7bdcfb6841e9cc8361ce9dafbbcc589738ec322beb29b3e244425df","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-06T00:15:33Z","title_canon_sha256":"5bc5a378725152e9f8dc16e08d6fb5717fba7537ca646accd09ddabb8baf9e6d"},"schema_version":"1.0","source":{"id":"1612.01600","kind":"arxiv","version":2}},"canonical_sha256":"1dbfdc795ab224f7bb409146d99ecade28bfd7fc68c6a8bb89a119190ddcc28a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dbfdc795ab224f7bb409146d99ecade28bfd7fc68c6a8bb89a119190ddcc28a","first_computed_at":"2026-05-18T00:55:35.491395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:35.491395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/WDvUpjT4N5zTFpABdG+ol9hckCggOm4cyZ/SJnVKpyvh6qEXioriHJPPWtERuhrvWlPoqbAm7AIa07CWcpeDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:35.491908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a2841b34323ba330a19fd777bfe062a72cdecdc766f097692eccfe4460e14ba","sha256:a194785030086c91ae2d55b3fddf3dc0a61dfd81309074f0defbaf60a57dac77"],"state_sha256":"657783f006868bc21d5ed4ec294d41d26090795c2bed00c4ff4a2ea6d7ea96ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7EQKMM7uyERR69LcczXvtxhiRuemb0lvI44iOdxA5ZjjQ2lLmUd1jt4eVwRR+AYXJDMHqpp+wy9JdZbyZzIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:10:26.312045Z","bundle_sha256":"cadeafb2baa263f24126151437c6b8d797364d04d955eff0ff15f7401ac94d33"}}