{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PPUA5D23GPYM2FIX2UXFBUTE7C","short_pith_number":"pith:PPUA5D23","canonical_record":{"source":{"id":"1711.04973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T06:44:28Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"78b872eda3e04cddd9c9dbdc6a1c3e34588e1afd023f2ce867028ab5dab8f571","abstract_canon_sha256":"b5f774f9a9622ebc9f0f76b1df921ad3faf10863cf0b4b5bd0b169c2b585485f"},"schema_version":"1.0"},"canonical_sha256":"7be80e8f5b33f0cd1517d52e50d264f884783f8fa39c9c936a75697690606117","source":{"kind":"arxiv","id":"1711.04973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04973","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04973v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04973","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"PPUA5D23GPYM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPUA5D23GPYM2FIX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPUA5D23","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PPUA5D23GPYM2FIX2UXFBUTE7C","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T06:44:28Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"78b872eda3e04cddd9c9dbdc6a1c3e34588e1afd023f2ce867028ab5dab8f571","abstract_canon_sha256":"b5f774f9a9622ebc9f0f76b1df921ad3faf10863cf0b4b5bd0b169c2b585485f"},"schema_version":"1.0"},"canonical_sha256":"7be80e8f5b33f0cd1517d52e50d264f884783f8fa39c9c936a75697690606117","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:35.278724Z","signature_b64":"Tz5d4XorTJTdhPQVjqK1z6s0GZvK++Qqvyg69jQVAWgAT+og09XmLGcSAZdjSAoHKqil6aDDnBtHjuN0o/COAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7be80e8f5b33f0cd1517d52e50d264f884783f8fa39c9c936a75697690606117","last_reissued_at":"2026-05-18T00:30:35.278110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:35.278110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04973","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-05-18T00:30:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpq9LQCQ5qnoBjufGOvJIAL04vickpJlGaFfJuKQFDhO35R4Se65j7O7zb+cK7LCEG7bDOMpdvcr9ZJojcmMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:12:25.390464Z"},"content_sha256":"6d6f32def2ac5f5b89daa7d8dee1aa7dffb2f5ea5a1f80df4b1ce71ede80c87f","schema_version":"1.0","event_id":"sha256:6d6f32def2ac5f5b89daa7d8dee1aa7dffb2f5ea5a1f80df4b1ce71ede80c87f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PPUA5D23GPYM2FIX2UXFBUTE7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Variable Step Size Fractional Least Mean Square (RVSS-FLMS) Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Imran Naseem, Mohammed Bennamoun, Muhammad Usman, Roberto Togneri, Shujaat Khan","submitted_at":"2017-11-14T06:44:28Z","abstract_excerpt":"In this paper, we propose an adaptive framework for the variable step size of the fractional least mean square (FLMS) algorithm. The proposed algorithm named the robust variable step size-FLMS (RVSS-FLMS), dynamically updates the step size of the FLMS to achieve high convergence rate with low steady state error. For the evaluation purpose, the problem of system identification is considered. The experiments clearly show that the proposed approach achieves better convergence rate compared to the FLMS and adaptive step-size modified FLMS (AMFLMS)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04973","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":""},"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-05-18T00:30:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0bCwpPVcKTXnaxOhvKyWTUCNGPSz6yv9kF/vNN2dIuUpmVWo8dRnBCcXdLbGHXTUFeW92isjxsa0bGJSmFkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:12:25.390822Z"},"content_sha256":"fd9b0d30def63fbe794ed92f747c860511c5ca1e75486855b478adb2033e2127","schema_version":"1.0","event_id":"sha256:fd9b0d30def63fbe794ed92f747c860511c5ca1e75486855b478adb2033e2127"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPUA5D23GPYM2FIX2UXFBUTE7C/bundle.json","state_url":"https://pith.science/pith/PPUA5D23GPYM2FIX2UXFBUTE7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPUA5D23GPYM2FIX2UXFBUTE7C/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-05-27T23:12:25Z","links":{"resolver":"https://pith.science/pith/PPUA5D23GPYM2FIX2UXFBUTE7C","bundle":"https://pith.science/pith/PPUA5D23GPYM2FIX2UXFBUTE7C/bundle.json","state":"https://pith.science/pith/PPUA5D23GPYM2FIX2UXFBUTE7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPUA5D23GPYM2FIX2UXFBUTE7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PPUA5D23GPYM2FIX2UXFBUTE7C","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":"b5f774f9a9622ebc9f0f76b1df921ad3faf10863cf0b4b5bd0b169c2b585485f","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T06:44:28Z","title_canon_sha256":"78b872eda3e04cddd9c9dbdc6a1c3e34588e1afd023f2ce867028ab5dab8f571"},"schema_version":"1.0","source":{"id":"1711.04973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04973","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04973v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04973","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"PPUA5D23GPYM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPUA5D23GPYM2FIX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPUA5D23","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:fd9b0d30def63fbe794ed92f747c860511c5ca1e75486855b478adb2033e2127","target":"graph","created_at":"2026-05-18T00:30:35Z","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"},"paper":{"abstract_excerpt":"In this paper, we propose an adaptive framework for the variable step size of the fractional least mean square (FLMS) algorithm. The proposed algorithm named the robust variable step size-FLMS (RVSS-FLMS), dynamically updates the step size of the FLMS to achieve high convergence rate with low steady state error. For the evaluation purpose, the problem of system identification is considered. The experiments clearly show that the proposed approach achieves better convergence rate compared to the FLMS and adaptive step-size modified FLMS (AMFLMS).","authors_text":"Imran Naseem, Mohammed Bennamoun, Muhammad Usman, Roberto Togneri, Shujaat Khan","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T06:44:28Z","title":"A Robust Variable Step Size Fractional Least Mean Square (RVSS-FLMS) Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04973","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:6d6f32def2ac5f5b89daa7d8dee1aa7dffb2f5ea5a1f80df4b1ce71ede80c87f","target":"record","created_at":"2026-05-18T00:30:35Z","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":"b5f774f9a9622ebc9f0f76b1df921ad3faf10863cf0b4b5bd0b169c2b585485f","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T06:44:28Z","title_canon_sha256":"78b872eda3e04cddd9c9dbdc6a1c3e34588e1afd023f2ce867028ab5dab8f571"},"schema_version":"1.0","source":{"id":"1711.04973","kind":"arxiv","version":1}},"canonical_sha256":"7be80e8f5b33f0cd1517d52e50d264f884783f8fa39c9c936a75697690606117","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7be80e8f5b33f0cd1517d52e50d264f884783f8fa39c9c936a75697690606117","first_computed_at":"2026-05-18T00:30:35.278110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:35.278110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tz5d4XorTJTdhPQVjqK1z6s0GZvK++Qqvyg69jQVAWgAT+og09XmLGcSAZdjSAoHKqil6aDDnBtHjuN0o/COAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:35.278724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d6f32def2ac5f5b89daa7d8dee1aa7dffb2f5ea5a1f80df4b1ce71ede80c87f","sha256:fd9b0d30def63fbe794ed92f747c860511c5ca1e75486855b478adb2033e2127"],"state_sha256":"02c1d43dc23c6b5d728575918ff1dd002ec2ff56a9cc2f98d86e619e1d326efe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvlDYgHSaHMdHwXxni2aqV2ZA92Gmo8Jojo1DpSEtu4V62H+BXxeX3WuBjb4vx3WA3bwMsJvYmL/FZoOTDLlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:12:25.393384Z","bundle_sha256":"c4ca75a3ebb47b25e3fd2264611212c929f41d4ce231bfc776bda0c9ceb6a157"}}