{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J27UHNBRHJG3UG7RKJCOMPK2EV","short_pith_number":"pith:J27UHNBR","schema_version":"1.0","canonical_sha256":"4ebf43b4313a4dba1bf15244e63d5a255ed925c4b2068e8dee8833d164cfd51b","source":{"kind":"arxiv","id":"1805.08547","version":2},"attestation_state":"computed","paper":{"title":"Learning over Multitask Graphs -- Part II: Performance Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Ali H. Sayed, Cedric Richard, Roula Nassif, Stefan Vlaski","submitted_at":"2018-05-22T12:42:19Z","abstract_excerpt":"Part I of this paper formulated a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. A diffusion strategy was devised that responds to streaming data and employs stochastic approximations in place of actual gradient vectors, which are generally unavailable. The approach relied on minimizing a global cost consisting of the aggregate sum of individual costs regularized by a term that promotes smoothness. We examined the first-order, the second-order, and the "},"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":"1805.08547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-05-22T12:42:19Z","cross_cats_sorted":[],"title_canon_sha256":"1551ca32fe4f6a53ba837311cc82e3a7b0a83570527c6b1aa2b538bb06e7ed17","abstract_canon_sha256":"d66121afbef851d7884a27578e8b19e6ca092f787132c7a0517fe1953b41b147"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:17.990384Z","signature_b64":"bhwItoIP9nwbsNhxqSVYIkr7xOY25PQQstmKNWTryAq+EceHZ2X6wa5GN4VWEZAlIPFfv70Xy95SANxTfUQCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ebf43b4313a4dba1bf15244e63d5a255ed925c4b2068e8dee8833d164cfd51b","last_reissued_at":"2026-07-05T00:19:17.989948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:17.989948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning over Multitask Graphs -- Part II: Performance Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Ali H. Sayed, Cedric Richard, Roula Nassif, Stefan Vlaski","submitted_at":"2018-05-22T12:42:19Z","abstract_excerpt":"Part I of this paper formulated a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. A diffusion strategy was devised that responds to streaming data and employs stochastic approximations in place of actual gradient vectors, which are generally unavailable. The approach relied on minimizing a global cost consisting of the aggregate sum of individual costs regularized by a term that promotes smoothness. We examined the first-order, the second-order, and the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08547","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.08547/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1805.08547","created_at":"2026-07-05T00:19:17.990000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08547v2","created_at":"2026-07-05T00:19:17.990000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08547","created_at":"2026-07-05T00:19:17.990000+00:00"},{"alias_kind":"pith_short_12","alias_value":"J27UHNBRHJG3","created_at":"2026-07-05T00:19:17.990000+00:00"},{"alias_kind":"pith_short_16","alias_value":"J27UHNBRHJG3UG7R","created_at":"2026-07-05T00:19:17.990000+00:00"},{"alias_kind":"pith_short_8","alias_value":"J27UHNBR","created_at":"2026-07-05T00:19:17.990000+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/J27UHNBRHJG3UG7RKJCOMPK2EV","json":"https://pith.science/pith/J27UHNBRHJG3UG7RKJCOMPK2EV.json","graph_json":"https://pith.science/api/pith-number/J27UHNBRHJG3UG7RKJCOMPK2EV/graph.json","events_json":"https://pith.science/api/pith-number/J27UHNBRHJG3UG7RKJCOMPK2EV/events.json","paper":"https://pith.science/paper/J27UHNBR"},"agent_actions":{"view_html":"https://pith.science/pith/J27UHNBRHJG3UG7RKJCOMPK2EV","download_json":"https://pith.science/pith/J27UHNBRHJG3UG7RKJCOMPK2EV.json","view_paper":"https://pith.science/paper/J27UHNBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08547&json=true","fetch_graph":"https://pith.science/api/pith-number/J27UHNBRHJG3UG7RKJCOMPK2EV/graph.json","fetch_events":"https://pith.science/api/pith-number/J27UHNBRHJG3UG7RKJCOMPK2EV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J27UHNBRHJG3UG7RKJCOMPK2EV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J27UHNBRHJG3UG7RKJCOMPK2EV/action/storage_attestation","attest_author":"https://pith.science/pith/J27UHNBRHJG3UG7RKJCOMPK2EV/action/author_attestation","sign_citation":"https://pith.science/pith/J27UHNBRHJG3UG7RKJCOMPK2EV/action/citation_signature","submit_replication":"https://pith.science/pith/J27UHNBRHJG3UG7RKJCOMPK2EV/action/replication_record"}},"created_at":"2026-07-05T00:19:17.990000+00:00","updated_at":"2026-07-05T00:19:17.990000+00:00"}