{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YB6KPCC7W5SCI5L3Z62CNUCWNJ","short_pith_number":"pith:YB6KPCC7","schema_version":"1.0","canonical_sha256":"c07ca7885fb76424757bcfb426d0566a42c50fd6e4fa7eeb1511e17a7ec90763","source":{"kind":"arxiv","id":"1912.05805","version":1},"attestation_state":"computed","paper":{"title":"Online Distributed Learning over Graphs with Multitask Graph-Filter Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ali H. Sayed, C\\'edric Richard, Fei Hua, Haiyan Wang, Roula Nassif","submitted_at":"2019-12-12T07:26:06Z","abstract_excerpt":"In this work, we are interested in adaptive and distributed estimation of graph filters from streaming data. We formulate this problem as a consensus estimation problem over graphs, which can be addressed with diffusion LMS strategies. Most popular graph-shift operators such as those based on the graph Laplacian matrix, or the adjacency matrix, are not energy preserving. This may result in an ill-conditioned estimation problem, and reduce the convergence speed of the distributed algorithms. To address this issue and improve the transient performance, we introduce a preconditioned graph diffusi"},"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":"1912.05805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-12-12T07:26:06Z","cross_cats_sorted":[],"title_canon_sha256":"92dbfb687f850fa85d4eac4b47e6cb1ad1a854b86e0a7dd726be99f3952fbfe0","abstract_canon_sha256":"1c768c5f8ebf1dcd298d9cca80780144d20d97ca6ad7a80c42afc40d375161ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:43.056676Z","signature_b64":"TS2X7G5NeokY7Tc9Bpl/AFZcZ5WfuqliO72xvcc7V5DdLfAzzbMtxVFf5hZc+v6cMksmkXlyQllIY2afrMT/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c07ca7885fb76424757bcfb426d0566a42c50fd6e4fa7eeb1511e17a7ec90763","last_reissued_at":"2026-07-05T00:25:43.056230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:43.056230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Distributed Learning over Graphs with Multitask Graph-Filter Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ali H. Sayed, C\\'edric Richard, Fei Hua, Haiyan Wang, Roula Nassif","submitted_at":"2019-12-12T07:26:06Z","abstract_excerpt":"In this work, we are interested in adaptive and distributed estimation of graph filters from streaming data. We formulate this problem as a consensus estimation problem over graphs, which can be addressed with diffusion LMS strategies. Most popular graph-shift operators such as those based on the graph Laplacian matrix, or the adjacency matrix, are not energy preserving. This may result in an ill-conditioned estimation problem, and reduce the convergence speed of the distributed algorithms. To address this issue and improve the transient performance, we introduce a preconditioned graph diffusi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.05805","kind":"arxiv","version":1},"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/1912.05805/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":"1912.05805","created_at":"2026-07-05T00:25:43.056290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.05805v1","created_at":"2026-07-05T00:25:43.056290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.05805","created_at":"2026-07-05T00:25:43.056290+00:00"},{"alias_kind":"pith_short_12","alias_value":"YB6KPCC7W5SC","created_at":"2026-07-05T00:25:43.056290+00:00"},{"alias_kind":"pith_short_16","alias_value":"YB6KPCC7W5SCI5L3","created_at":"2026-07-05T00:25:43.056290+00:00"},{"alias_kind":"pith_short_8","alias_value":"YB6KPCC7","created_at":"2026-07-05T00:25:43.056290+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/YB6KPCC7W5SCI5L3Z62CNUCWNJ","json":"https://pith.science/pith/YB6KPCC7W5SCI5L3Z62CNUCWNJ.json","graph_json":"https://pith.science/api/pith-number/YB6KPCC7W5SCI5L3Z62CNUCWNJ/graph.json","events_json":"https://pith.science/api/pith-number/YB6KPCC7W5SCI5L3Z62CNUCWNJ/events.json","paper":"https://pith.science/paper/YB6KPCC7"},"agent_actions":{"view_html":"https://pith.science/pith/YB6KPCC7W5SCI5L3Z62CNUCWNJ","download_json":"https://pith.science/pith/YB6KPCC7W5SCI5L3Z62CNUCWNJ.json","view_paper":"https://pith.science/paper/YB6KPCC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.05805&json=true","fetch_graph":"https://pith.science/api/pith-number/YB6KPCC7W5SCI5L3Z62CNUCWNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YB6KPCC7W5SCI5L3Z62CNUCWNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YB6KPCC7W5SCI5L3Z62CNUCWNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YB6KPCC7W5SCI5L3Z62CNUCWNJ/action/storage_attestation","attest_author":"https://pith.science/pith/YB6KPCC7W5SCI5L3Z62CNUCWNJ/action/author_attestation","sign_citation":"https://pith.science/pith/YB6KPCC7W5SCI5L3Z62CNUCWNJ/action/citation_signature","submit_replication":"https://pith.science/pith/YB6KPCC7W5SCI5L3Z62CNUCWNJ/action/replication_record"}},"created_at":"2026-07-05T00:25:43.056290+00:00","updated_at":"2026-07-05T00:25:43.056290+00:00"}