{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JCY5MV5DY6LDAPS5B2RKIWDKYU","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":"7c951b076f641ca5c271cfb089bb25c869a422cffd2258720a9cf704aa09d631","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-22T01:52:55Z","title_canon_sha256":"073befb3f523836ee851c5fbbc2f7d87c1a9d4101c2db4cadcf84ccac99c6b8c"},"schema_version":"1.0","source":{"id":"1908.08165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08165","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08165v1","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08165","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"JCY5MV5DY6LD","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_16","alias_value":"JCY5MV5DY6LDAPS5","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_8","alias_value":"JCY5MV5D","created_at":"2026-07-04T23:59:10Z"}],"graph_snapshots":[{"event_id":"sha256:531319a10090fd7ad86e8cee64bf3ae7c624cc598e3d2f2cc4658a5d60b73766","target":"graph","created_at":"2026-07-04T23:59:10Z","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/1908.08165/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"There is a need to improve the capability of the adaptive filtering algorithm against Gaussian or multiple types of non-Gaussian noises, time-varying system, and systems with low SNR. In this paper, we propose an optimized least mean absolute fourth (OPLMF) algorithm, especially for a time-varying unknown system with low signal-noise-rate (SNR). The optimal step-size of OPLMF is obtained by minimizing the mean-square deviation (MSD) at any given moment in time. In addition, the mean convergence and steady-state error of OPLMF are derived. Also the theoretical computational complexity of OPLMF ","authors_text":"Bharat Biswal, Chun Meng, Sihai Guan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-22T01:52:55Z","title":"Optimal step-size of least mean absolute fourth algorithm in low SNR"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08165","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:45f9839e0ff0e5962e1f65b843f9353f8ed99fc2fd653ae37e5a8f52d8736b0e","target":"record","created_at":"2026-07-04T23:59:10Z","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":"7c951b076f641ca5c271cfb089bb25c869a422cffd2258720a9cf704aa09d631","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-22T01:52:55Z","title_canon_sha256":"073befb3f523836ee851c5fbbc2f7d87c1a9d4101c2db4cadcf84ccac99c6b8c"},"schema_version":"1.0","source":{"id":"1908.08165","kind":"arxiv","version":1}},"canonical_sha256":"48b1d657a3c796303e5d0ea2a4586ac531b7354086a5f369596be7ab4927f62c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48b1d657a3c796303e5d0ea2a4586ac531b7354086a5f369596be7ab4927f62c","first_computed_at":"2026-07-04T23:59:10.183778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:10.183778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"on3yiJfxA3pWbxC639XhJPTTwuikFW2yhA01IFTNwdqxHEKOd0JDsy1gyoSlQtdBnCZ5j6SCyhO16jbg/styAA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:10.184206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45f9839e0ff0e5962e1f65b843f9353f8ed99fc2fd653ae37e5a8f52d8736b0e","sha256:531319a10090fd7ad86e8cee64bf3ae7c624cc598e3d2f2cc4658a5d60b73766"],"state_sha256":"89ae3e32a95a2a262916a87b355243098c69d5f959031e41e6ff2019c32da86f"}