{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ODBPYT7H7VMCPP4LGZKIDXXXCJ","short_pith_number":"pith:ODBPYT7H","canonical_record":{"source":{"id":"1610.02943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-10-10T14:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"d81635ca80dcc1d90cdd2b0edd1a4daa2d42da4d2ab9322679ea7cd3e9eae1f1","abstract_canon_sha256":"5f759677b32459e86f13fb4c1f1d8a60da59b97f104739e7989494bc5e113482"},"schema_version":"1.0"},"canonical_sha256":"70c2fc4fe7fd5827bf8b365481def7124fd585aafab08ff7b18616dfa748963c","source":{"kind":"arxiv","id":"1610.02943","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02943","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02943v2","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02943","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"pith_short_12","alias_value":"ODBPYT7H7VMC","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ODBPYT7H7VMCPP4L","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ODBPYT7H","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ODBPYT7H7VMCPP4LGZKIDXXXCJ","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-10-10T14:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"d81635ca80dcc1d90cdd2b0edd1a4daa2d42da4d2ab9322679ea7cd3e9eae1f1","abstract_canon_sha256":"5f759677b32459e86f13fb4c1f1d8a60da59b97f104739e7989494bc5e113482"},"schema_version":"1.0"},"canonical_sha256":"70c2fc4fe7fd5827bf8b365481def7124fd585aafab08ff7b18616dfa748963c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:22.618493Z","signature_b64":"in4StH3if7GvzyUkCgqJ2LpSnj1dP9xjHeIYlbjAmcfaRjid1M93YwOTdhT9PPfTXdGzywV5oN9DAKNkE+PKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70c2fc4fe7fd5827bf8b365481def7124fd585aafab08ff7b18616dfa748963c","last_reissued_at":"2026-05-18T00:33:22.617825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:22.617825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02943","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:33:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSoWYdy4XPlVEFu27hbNUqgMx+gmtJKAyyfdSpyGvkDihVIfj28qH4bS/I0++NMx1/oGi3H1hRmzPN576wcrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:47:42.753114Z"},"content_sha256":"6f79b827f67dbdadf81cd34fe673a487f5b489310d0de2d65a8cc8349a0fcb4b","schema_version":"1.0","event_id":"sha256:6f79b827f67dbdadf81cd34fe673a487f5b489310d0de2d65a8cc8349a0fcb4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ODBPYT7H7VMCPP4LGZKIDXXXCJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diffusion LMS for Multitask Problems with Local Linear Equality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Ali H. Sayed, Andr\\'e Ferrari, C\\'edric Richard, Roula Nassif","submitted_at":"2016-10-10T14:51:34Z","abstract_excerpt":"We consider distributed multitask learning problems over a network of agents where each agent is interested in estimating its own parameter vector, also called task, and where the tasks at neighboring agents are related according to a set of linear equality constraints. Each agent possesses its own convex cost function of its parameter vector and a set of linear equality constraints involving its own parameter vector and the parameter vectors of its neighboring agents. We propose an adaptive stochastic algorithm based on the projection gradient method and diffusion strategies in order to allow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02943","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:33:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDL10la0EgV49OJ0JhpkGkl4NIP2Sxf/YKaDbrt55jZozjLXESlL3LjuH7zB70G2+YlQ5nR9IIorClgourX4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:47:42.753706Z"},"content_sha256":"055d832c6098ba5b8e15b988b66fd530020015f94d4db512438a768deb7a4285","schema_version":"1.0","event_id":"sha256:055d832c6098ba5b8e15b988b66fd530020015f94d4db512438a768deb7a4285"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODBPYT7H7VMCPP4LGZKIDXXXCJ/bundle.json","state_url":"https://pith.science/pith/ODBPYT7H7VMCPP4LGZKIDXXXCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODBPYT7H7VMCPP4LGZKIDXXXCJ/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-05-26T02:47:42Z","links":{"resolver":"https://pith.science/pith/ODBPYT7H7VMCPP4LGZKIDXXXCJ","bundle":"https://pith.science/pith/ODBPYT7H7VMCPP4LGZKIDXXXCJ/bundle.json","state":"https://pith.science/pith/ODBPYT7H7VMCPP4LGZKIDXXXCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODBPYT7H7VMCPP4LGZKIDXXXCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ODBPYT7H7VMCPP4LGZKIDXXXCJ","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":"5f759677b32459e86f13fb4c1f1d8a60da59b97f104739e7989494bc5e113482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-10-10T14:51:34Z","title_canon_sha256":"d81635ca80dcc1d90cdd2b0edd1a4daa2d42da4d2ab9322679ea7cd3e9eae1f1"},"schema_version":"1.0","source":{"id":"1610.02943","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02943","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02943v2","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02943","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"pith_short_12","alias_value":"ODBPYT7H7VMC","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ODBPYT7H7VMCPP4L","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ODBPYT7H","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:055d832c6098ba5b8e15b988b66fd530020015f94d4db512438a768deb7a4285","target":"graph","created_at":"2026-05-18T00:33:22Z","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 distributed multitask learning problems over a network of agents where each agent is interested in estimating its own parameter vector, also called task, and where the tasks at neighboring agents are related according to a set of linear equality constraints. Each agent possesses its own convex cost function of its parameter vector and a set of linear equality constraints involving its own parameter vector and the parameter vectors of its neighboring agents. We propose an adaptive stochastic algorithm based on the projection gradient method and diffusion strategies in order to allow","authors_text":"Ali H. Sayed, Andr\\'e Ferrari, C\\'edric Richard, Roula Nassif","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-10-10T14:51:34Z","title":"Diffusion LMS for Multitask Problems with Local Linear Equality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02943","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:6f79b827f67dbdadf81cd34fe673a487f5b489310d0de2d65a8cc8349a0fcb4b","target":"record","created_at":"2026-05-18T00:33:22Z","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":"5f759677b32459e86f13fb4c1f1d8a60da59b97f104739e7989494bc5e113482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-10-10T14:51:34Z","title_canon_sha256":"d81635ca80dcc1d90cdd2b0edd1a4daa2d42da4d2ab9322679ea7cd3e9eae1f1"},"schema_version":"1.0","source":{"id":"1610.02943","kind":"arxiv","version":2}},"canonical_sha256":"70c2fc4fe7fd5827bf8b365481def7124fd585aafab08ff7b18616dfa748963c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70c2fc4fe7fd5827bf8b365481def7124fd585aafab08ff7b18616dfa748963c","first_computed_at":"2026-05-18T00:33:22.617825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:22.617825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"in4StH3if7GvzyUkCgqJ2LpSnj1dP9xjHeIYlbjAmcfaRjid1M93YwOTdhT9PPfTXdGzywV5oN9DAKNkE+PKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:22.618493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02943","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f79b827f67dbdadf81cd34fe673a487f5b489310d0de2d65a8cc8349a0fcb4b","sha256:055d832c6098ba5b8e15b988b66fd530020015f94d4db512438a768deb7a4285"],"state_sha256":"75fa37d2e72ff5a72732d6263331981919bc315039a965376e3743180777f01d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Twbw2Jkmxo4hPAWvg5NtAiVpWh/rIl3X6F+sbtJd7KTmlNQkb99fnxlNegj6Vz1FiPizaiV3FPD1LI+31LSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:47:42.757331Z","bundle_sha256":"acde774ef094e3df42372c0732f80b1db693b7f0b7954583e765c58ace165c3c"}}