{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TCEBQDIZ3WXPPYPXDL2VXT5PGI","short_pith_number":"pith:TCEBQDIZ","schema_version":"1.0","canonical_sha256":"9888180d19ddaef7e1f71af55bcfaf323d6b7eaf8a99de2da35ab28afc9c50b4","source":{"kind":"arxiv","id":"2506.00403","version":1},"attestation_state":"computed","paper":{"title":"Transient Error Analysis of the LMS and RLS Algorithm for Graph Signal Estimation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Chengjin Li, Haiquan Zhao","submitted_at":"2025-05-31T05:48:30Z","abstract_excerpt":"Recently, the proposal of the least mean square (LMS) and recursive least squares (RLS) algorithm for graph signal processing (GSP) provides excellent solutions for processing signals defined on irregular structures such as sensor networks. The existing work has completed the steady state error analysis of the GSP LMS algorithm and GSP RLS algorithm in Gaussian noise scenarios, and a range of values for the step size of the GSP LMS algorithm has also been given. Meanwhile, the transient error analysis of the GSP LMS algorithm and GSP RLS algorithm is also important and challenging. Completing "},"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":"2506.00403","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-31T05:48:30Z","cross_cats_sorted":[],"title_canon_sha256":"9752a04e2f5951952514775ce50be9f37bfe4ae714d5c385f1be5da764f54f57","abstract_canon_sha256":"bd966688f923de3762c29a08c756a21a86cb0fcfc0ac12c2b44fabafa908efcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:34.086277Z","signature_b64":"T1DOsxV03CVJNFY29Li+M0OFL1unhv/2pQkIV93uX9JYUBE5hRPXxajIQWLp9K6Aubx/DoMO0YDM+fFL1Dn5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9888180d19ddaef7e1f71af55bcfaf323d6b7eaf8a99de2da35ab28afc9c50b4","last_reissued_at":"2026-07-05T11:13:34.085884Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:34.085884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transient Error Analysis of the LMS and RLS Algorithm for Graph Signal Estimation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Chengjin Li, Haiquan Zhao","submitted_at":"2025-05-31T05:48:30Z","abstract_excerpt":"Recently, the proposal of the least mean square (LMS) and recursive least squares (RLS) algorithm for graph signal processing (GSP) provides excellent solutions for processing signals defined on irregular structures such as sensor networks. The existing work has completed the steady state error analysis of the GSP LMS algorithm and GSP RLS algorithm in Gaussian noise scenarios, and a range of values for the step size of the GSP LMS algorithm has also been given. Meanwhile, the transient error analysis of the GSP LMS algorithm and GSP RLS algorithm is also important and challenging. Completing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00403","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/2506.00403/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":"2506.00403","created_at":"2026-07-05T11:13:34.085946+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00403v1","created_at":"2026-07-05T11:13:34.085946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00403","created_at":"2026-07-05T11:13:34.085946+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCEBQDIZ3WXP","created_at":"2026-07-05T11:13:34.085946+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCEBQDIZ3WXPPYPX","created_at":"2026-07-05T11:13:34.085946+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCEBQDIZ","created_at":"2026-07-05T11:13:34.085946+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/TCEBQDIZ3WXPPYPXDL2VXT5PGI","json":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI.json","graph_json":"https://pith.science/api/pith-number/TCEBQDIZ3WXPPYPXDL2VXT5PGI/graph.json","events_json":"https://pith.science/api/pith-number/TCEBQDIZ3WXPPYPXDL2VXT5PGI/events.json","paper":"https://pith.science/paper/TCEBQDIZ"},"agent_actions":{"view_html":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI","download_json":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI.json","view_paper":"https://pith.science/paper/TCEBQDIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00403&json=true","fetch_graph":"https://pith.science/api/pith-number/TCEBQDIZ3WXPPYPXDL2VXT5PGI/graph.json","fetch_events":"https://pith.science/api/pith-number/TCEBQDIZ3WXPPYPXDL2VXT5PGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/action/storage_attestation","attest_author":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/action/author_attestation","sign_citation":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/action/citation_signature","submit_replication":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/action/replication_record"}},"created_at":"2026-07-05T11:13:34.085946+00:00","updated_at":"2026-07-05T11:13:34.085946+00:00"}