{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5M4RKGELYRIAZNZYK4VFM64Y7D","short_pith_number":"pith:5M4RKGEL","canonical_record":{"source":{"id":"1509.01360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-04T08:08:00Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"0b8428af07f0ce781a3f231c03e7edf422b824643b5d3a30e704202cd5f8c11f","abstract_canon_sha256":"f8844ddeb007981ca7d5835792bbcd9bc1a3c4da3c33dee46a649d2622388589"},"schema_version":"1.0"},"canonical_sha256":"eb3915188bc4500cb738572a567b98f8d26fc3e592d5c11e3c186fe431a1f3a1","source":{"kind":"arxiv","id":"1509.01360","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01360","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01360v2","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01360","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"5M4RKGELYRIA","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5M4RKGELYRIAZNZY","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5M4RKGEL","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5M4RKGELYRIAZNZYK4VFM64Y7D","target":"record","payload":{"canonical_record":{"source":{"id":"1509.01360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-04T08:08:00Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"0b8428af07f0ce781a3f231c03e7edf422b824643b5d3a30e704202cd5f8c11f","abstract_canon_sha256":"f8844ddeb007981ca7d5835792bbcd9bc1a3c4da3c33dee46a649d2622388589"},"schema_version":"1.0"},"canonical_sha256":"eb3915188bc4500cb738572a567b98f8d26fc3e592d5c11e3c186fe431a1f3a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:40.432509Z","signature_b64":"Ao+35qYFbDJHKus8VSTqL37XFSwiMKQ4XqwTyBJg4GK0KUkzU6Bj1Ag1Z9gu/EqIgEKLn0I6pzzlId4tRcPGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb3915188bc4500cb738572a567b98f8d26fc3e592d5c11e3c186fe431a1f3a1","last_reissued_at":"2026-05-18T01:00:40.431942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:40.431942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.01360","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:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xizpoYs4X7+a4ATBY1BeYUCEMWxQZR1MIohgnWIgjDn86B7f4mj8CLl5NShBMdxaY35HJ3N6qrfRoauPlU0BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:46:47.950338Z"},"content_sha256":"18d4ac9a1eea8b598fb1de623288f1800ec9a0c64ab5a99eed265e7b6c1d504f","schema_version":"1.0","event_id":"sha256:18d4ac9a1eea8b598fb1de623288f1800ec9a0c64ab5a99eed265e7b6c1d504f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5M4RKGELYRIAZNZYK4VFM64Y7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Multitask Learning over Networks with Sparsity-inducing Coregularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Ali H. Sayed, Andr\\'e Ferrari, C\\'edric Richard, Roula Nassif","submitted_at":"2015-09-04T08:08:00Z","abstract_excerpt":"In this work, we consider multitask learning problems where clusters of nodes are interested in estimating their own parameter vector. Cooperation among clusters is beneficial when the optimal models of adjacent clusters have a good number of similar entries. We propose a fully distributed algorithm for solving this problem. The approach relies on minimizing a global mean-square error criterion regularized by non-differentiable terms to promote cooperation among neighboring clusters. A general diffusion forward-backward splitting strategy is introduced. Then, it is specialized to the case of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01360","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:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTHwd6dabuua5GqO+eYHSpj8YbyWSbQE1mIDQdz3z0h6prNsUYcZlFz9K2fpz00wZI3gGHDhiAQ4X3ALjSYcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:46:47.951056Z"},"content_sha256":"254254ac70206c28ceb08a79f7a0e1d1314ecbaa10a0567c24dc0f35a6750207","schema_version":"1.0","event_id":"sha256:254254ac70206c28ceb08a79f7a0e1d1314ecbaa10a0567c24dc0f35a6750207"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5M4RKGELYRIAZNZYK4VFM64Y7D/bundle.json","state_url":"https://pith.science/pith/5M4RKGELYRIAZNZYK4VFM64Y7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5M4RKGELYRIAZNZYK4VFM64Y7D/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-26T01:46:47Z","links":{"resolver":"https://pith.science/pith/5M4RKGELYRIAZNZYK4VFM64Y7D","bundle":"https://pith.science/pith/5M4RKGELYRIAZNZYK4VFM64Y7D/bundle.json","state":"https://pith.science/pith/5M4RKGELYRIAZNZYK4VFM64Y7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5M4RKGELYRIAZNZYK4VFM64Y7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5M4RKGELYRIAZNZYK4VFM64Y7D","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":"f8844ddeb007981ca7d5835792bbcd9bc1a3c4da3c33dee46a649d2622388589","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-04T08:08:00Z","title_canon_sha256":"0b8428af07f0ce781a3f231c03e7edf422b824643b5d3a30e704202cd5f8c11f"},"schema_version":"1.0","source":{"id":"1509.01360","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01360","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01360v2","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01360","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"5M4RKGELYRIA","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5M4RKGELYRIAZNZY","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5M4RKGEL","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:254254ac70206c28ceb08a79f7a0e1d1314ecbaa10a0567c24dc0f35a6750207","target":"graph","created_at":"2026-05-18T01:00:40Z","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":"In this work, we consider multitask learning problems where clusters of nodes are interested in estimating their own parameter vector. Cooperation among clusters is beneficial when the optimal models of adjacent clusters have a good number of similar entries. We propose a fully distributed algorithm for solving this problem. The approach relies on minimizing a global mean-square error criterion regularized by non-differentiable terms to promote cooperation among neighboring clusters. A general diffusion forward-backward splitting strategy is introduced. Then, it is specialized to the case of s","authors_text":"Ali H. Sayed, Andr\\'e Ferrari, C\\'edric Richard, Roula Nassif","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-04T08:08:00Z","title":"Proximal Multitask Learning over Networks with Sparsity-inducing Coregularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01360","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:18d4ac9a1eea8b598fb1de623288f1800ec9a0c64ab5a99eed265e7b6c1d504f","target":"record","created_at":"2026-05-18T01:00:40Z","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":"f8844ddeb007981ca7d5835792bbcd9bc1a3c4da3c33dee46a649d2622388589","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-04T08:08:00Z","title_canon_sha256":"0b8428af07f0ce781a3f231c03e7edf422b824643b5d3a30e704202cd5f8c11f"},"schema_version":"1.0","source":{"id":"1509.01360","kind":"arxiv","version":2}},"canonical_sha256":"eb3915188bc4500cb738572a567b98f8d26fc3e592d5c11e3c186fe431a1f3a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb3915188bc4500cb738572a567b98f8d26fc3e592d5c11e3c186fe431a1f3a1","first_computed_at":"2026-05-18T01:00:40.431942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:40.431942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ao+35qYFbDJHKus8VSTqL37XFSwiMKQ4XqwTyBJg4GK0KUkzU6Bj1Ag1Z9gu/EqIgEKLn0I6pzzlId4tRcPGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:40.432509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01360","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18d4ac9a1eea8b598fb1de623288f1800ec9a0c64ab5a99eed265e7b6c1d504f","sha256:254254ac70206c28ceb08a79f7a0e1d1314ecbaa10a0567c24dc0f35a6750207"],"state_sha256":"c1fe1d498d10f7ec2f847a8249b5ab4c2c918926a3a7264136ef393a3ebd3631"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2eROVPZ8GORmw3Pspy8xLJv/Sy3FufC0fmp+6WAssr1LzHl8Dam2lFECKODarw40V+vatuTuuFoz/T/UgSflDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:46:47.954742Z","bundle_sha256":"8293e5be97b7d9c1cd099ed29e359d19fc3c86e92c22ced06fc8d305e7eb3840"}}