{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TCEBQDIZ3WXPPYPXDL2VXT5PGI","short_pith_number":"pith:TCEBQDIZ","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"},"canonical_sha256":"9888180d19ddaef7e1f71af55bcfaf323d6b7eaf8a99de2da35ab28afc9c50b4","source":{"kind":"arxiv","id":"2506.00403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00403","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00403v1","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00403","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"pith_short_12","alias_value":"TCEBQDIZ3WXP","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"pith_short_16","alias_value":"TCEBQDIZ3WXPPYPX","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"pith_short_8","alias_value":"TCEBQDIZ","created_at":"2026-07-05T11:13:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TCEBQDIZ3WXPPYPXDL2VXT5PGI","target":"record","payload":{"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"},"canonical_sha256":"9888180d19ddaef7e1f71af55bcfaf323d6b7eaf8a99de2da35ab28afc9c50b4","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"},"source_kind":"arxiv","source_id":"2506.00403","source_version":1,"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-07-05T11:13:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcNotuq0cmqkWlVYqFmVmK0QZuZad3zhW1TgdFH5m74rx1cDJL/NSI8xiWi6vZL5UBwxniwwF9Yd3oHadK0rBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:54:03.143191Z"},"content_sha256":"ec611bb93ae09b669851cc5eed41a1a2fe45717338ee704f44046bde9765f032","schema_version":"1.0","event_id":"sha256:ec611bb93ae09b669851cc5eed41a1a2fe45717338ee704f44046bde9765f032"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TCEBQDIZ3WXPPYPXDL2VXT5PGI","target":"graph","payload":{"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"},"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-07-05T11:13:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Av8fvO2uqR79G4jl3zxK0cE3pnds5joNC86R5fOShU1FTwS8bBt5XnDdKjB24hdIsP/R6Cz7c408gJpM7xRECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:54:03.145130Z"},"content_sha256":"d9a3a51bd559faba8484857350ad64f2b23dc58f61e204c426f16828f529f2b9","schema_version":"1.0","event_id":"sha256:d9a3a51bd559faba8484857350ad64f2b23dc58f61e204c426f16828f529f2b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/bundle.json","state_url":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/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-08-08T20:54:03Z","links":{"resolver":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI","bundle":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/bundle.json","state":"https://pith.science/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCEBQDIZ3WXPPYPXDL2VXT5PGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TCEBQDIZ3WXPPYPXDL2VXT5PGI","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":"bd966688f923de3762c29a08c756a21a86cb0fcfc0ac12c2b44fabafa908efcd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-31T05:48:30Z","title_canon_sha256":"9752a04e2f5951952514775ce50be9f37bfe4ae714d5c385f1be5da764f54f57"},"schema_version":"1.0","source":{"id":"2506.00403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00403","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00403v1","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00403","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"pith_short_12","alias_value":"TCEBQDIZ3WXP","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"pith_short_16","alias_value":"TCEBQDIZ3WXPPYPX","created_at":"2026-07-05T11:13:34Z"},{"alias_kind":"pith_short_8","alias_value":"TCEBQDIZ","created_at":"2026-07-05T11:13:34Z"}],"graph_snapshots":[{"event_id":"sha256:d9a3a51bd559faba8484857350ad64f2b23dc58f61e204c426f16828f529f2b9","target":"graph","created_at":"2026-07-05T11:13:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.00403/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Chengjin Li, Haiquan Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-31T05:48:30Z","title":"Transient Error Analysis of the LMS and RLS Algorithm for Graph Signal Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00403","kind":"arxiv","version":1},"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:ec611bb93ae09b669851cc5eed41a1a2fe45717338ee704f44046bde9765f032","target":"record","created_at":"2026-07-05T11:13:34Z","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":"bd966688f923de3762c29a08c756a21a86cb0fcfc0ac12c2b44fabafa908efcd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-31T05:48:30Z","title_canon_sha256":"9752a04e2f5951952514775ce50be9f37bfe4ae714d5c385f1be5da764f54f57"},"schema_version":"1.0","source":{"id":"2506.00403","kind":"arxiv","version":1}},"canonical_sha256":"9888180d19ddaef7e1f71af55bcfaf323d6b7eaf8a99de2da35ab28afc9c50b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9888180d19ddaef7e1f71af55bcfaf323d6b7eaf8a99de2da35ab28afc9c50b4","first_computed_at":"2026-07-05T11:13:34.085884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:34.085884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T1DOsxV03CVJNFY29Li+M0OFL1unhv/2pQkIV93uX9JYUBE5hRPXxajIQWLp9K6Aubx/DoMO0YDM+fFL1Dn5CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:34.086277Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec611bb93ae09b669851cc5eed41a1a2fe45717338ee704f44046bde9765f032","sha256:d9a3a51bd559faba8484857350ad64f2b23dc58f61e204c426f16828f529f2b9"],"state_sha256":"e224c9d8080ef306df64c39eb4670ae0b16a1ba2691b1997e2bf527dda9742f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgqP7vaGSbLUvqPx0V7av5urjP2BstB6pycW/RU6GpompLSTP9DZS3vJw7NGCPWVZJK/Ce1fvVNs+PmIPwEZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:54:03.153246Z","bundle_sha256":"8e5c6e5c230eee035cf8b88c7cd7eb1aace97af4c2b7442cfba37beb4b9b621c"}}