{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BPSCM4HB3G5Z2M2DSPUVFMMIO7","short_pith_number":"pith:BPSCM4HB","schema_version":"1.0","canonical_sha256":"0be42670e1d9bb9d334393e952b18877d8590eda1684f071a3cd0423c058daa4","source":{"kind":"arxiv","id":"2209.01257","version":3},"attestation_state":"computed","paper":{"title":"Decentralized Eigendecomposition for Online Learning over Graphs with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Cemil Emre Ardic, Marius Pesavento, Minh Trinh-Hoang, Yufan Fan","submitted_at":"2022-09-02T20:04:45Z","abstract_excerpt":"In this paper, the problem of decentralized eigenvalue decomposition of a general symmetric matrix that is important, e.g., in Principal Component Analysis, is studied, and a decentralized online learning algorithm is proposed. Instead of collecting all information in a fusion center, the proposed algorithm involves only local interactions among adjacent agents. It benefits from the representation of the matrix as a sum of rank-one components which makes the algorithm attractive for online eigenvalue and eigenvector tracking applications. We examine the performance of the proposed algorithm in"},"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":"2209.01257","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-09-02T20:04:45Z","cross_cats_sorted":[],"title_canon_sha256":"7fbe03f5915cf75a1a80bf535a7a197afa02fa3af9b557477ebd2111e880ed1f","abstract_canon_sha256":"80affb4d60f1c5d78353bafd7740814c15363ff7cd2fcb69ebf6a5058620a4ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:10.392708Z","signature_b64":"MZJ/U4LzeXetnPICmwIXD1I0cXkkaGX0e08WaH9e1TXMo2dDieCfm2Aud9IvV6e5v9FvLBUAbIE5V6eR7sGeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be42670e1d9bb9d334393e952b18877d8590eda1684f071a3cd0423c058daa4","last_reissued_at":"2026-07-05T06:40:10.392173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:10.392173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Eigendecomposition for Online Learning over Graphs with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Cemil Emre Ardic, Marius Pesavento, Minh Trinh-Hoang, Yufan Fan","submitted_at":"2022-09-02T20:04:45Z","abstract_excerpt":"In this paper, the problem of decentralized eigenvalue decomposition of a general symmetric matrix that is important, e.g., in Principal Component Analysis, is studied, and a decentralized online learning algorithm is proposed. Instead of collecting all information in a fusion center, the proposed algorithm involves only local interactions among adjacent agents. It benefits from the representation of the matrix as a sum of rank-one components which makes the algorithm attractive for online eigenvalue and eigenvector tracking applications. We examine the performance of the proposed algorithm in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01257","kind":"arxiv","version":3},"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/2209.01257/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":"2209.01257","created_at":"2026-07-05T06:40:10.392239+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.01257v3","created_at":"2026-07-05T06:40:10.392239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01257","created_at":"2026-07-05T06:40:10.392239+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPSCM4HB3G5Z","created_at":"2026-07-05T06:40:10.392239+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPSCM4HB3G5Z2M2D","created_at":"2026-07-05T06:40:10.392239+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPSCM4HB","created_at":"2026-07-05T06:40:10.392239+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/BPSCM4HB3G5Z2M2DSPUVFMMIO7","json":"https://pith.science/pith/BPSCM4HB3G5Z2M2DSPUVFMMIO7.json","graph_json":"https://pith.science/api/pith-number/BPSCM4HB3G5Z2M2DSPUVFMMIO7/graph.json","events_json":"https://pith.science/api/pith-number/BPSCM4HB3G5Z2M2DSPUVFMMIO7/events.json","paper":"https://pith.science/paper/BPSCM4HB"},"agent_actions":{"view_html":"https://pith.science/pith/BPSCM4HB3G5Z2M2DSPUVFMMIO7","download_json":"https://pith.science/pith/BPSCM4HB3G5Z2M2DSPUVFMMIO7.json","view_paper":"https://pith.science/paper/BPSCM4HB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.01257&json=true","fetch_graph":"https://pith.science/api/pith-number/BPSCM4HB3G5Z2M2DSPUVFMMIO7/graph.json","fetch_events":"https://pith.science/api/pith-number/BPSCM4HB3G5Z2M2DSPUVFMMIO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPSCM4HB3G5Z2M2DSPUVFMMIO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPSCM4HB3G5Z2M2DSPUVFMMIO7/action/storage_attestation","attest_author":"https://pith.science/pith/BPSCM4HB3G5Z2M2DSPUVFMMIO7/action/author_attestation","sign_citation":"https://pith.science/pith/BPSCM4HB3G5Z2M2DSPUVFMMIO7/action/citation_signature","submit_replication":"https://pith.science/pith/BPSCM4HB3G5Z2M2DSPUVFMMIO7/action/replication_record"}},"created_at":"2026-07-05T06:40:10.392239+00:00","updated_at":"2026-07-05T06:40:10.392239+00:00"}