{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JCY5MV5DY6LDAPS5B2RKIWDKYU","short_pith_number":"pith:JCY5MV5D","schema_version":"1.0","canonical_sha256":"48b1d657a3c796303e5d0ea2a4586ac531b7354086a5f369596be7ab4927f62c","source":{"kind":"arxiv","id":"1908.08165","version":1},"attestation_state":"computed","paper":{"title":"Optimal step-size of least mean absolute fourth algorithm in low SNR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Bharat Biswal, Chun Meng, Sihai Guan","submitted_at":"2019-08-22T01:52:55Z","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 "},"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":"1908.08165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-22T01:52:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"073befb3f523836ee851c5fbbc2f7d87c1a9d4101c2db4cadcf84ccac99c6b8c","abstract_canon_sha256":"7c951b076f641ca5c271cfb089bb25c869a422cffd2258720a9cf704aa09d631"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:10.184206Z","signature_b64":"on3yiJfxA3pWbxC639XhJPTTwuikFW2yhA01IFTNwdqxHEKOd0JDsy1gyoSlQtdBnCZ5j6SCyhO16jbg/styAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b1d657a3c796303e5d0ea2a4586ac531b7354086a5f369596be7ab4927f62c","last_reissued_at":"2026-07-04T23:59:10.183778Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:10.183778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal step-size of least mean absolute fourth algorithm in low SNR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Bharat Biswal, Chun Meng, Sihai Guan","submitted_at":"2019-08-22T01:52:55Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08165","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/1908.08165/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":"1908.08165","created_at":"2026-07-04T23:59:10.183836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08165v1","created_at":"2026-07-04T23:59:10.183836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08165","created_at":"2026-07-04T23:59:10.183836+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCY5MV5DY6LD","created_at":"2026-07-04T23:59:10.183836+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCY5MV5DY6LDAPS5","created_at":"2026-07-04T23:59:10.183836+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCY5MV5D","created_at":"2026-07-04T23:59:10.183836+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/JCY5MV5DY6LDAPS5B2RKIWDKYU","json":"https://pith.science/pith/JCY5MV5DY6LDAPS5B2RKIWDKYU.json","graph_json":"https://pith.science/api/pith-number/JCY5MV5DY6LDAPS5B2RKIWDKYU/graph.json","events_json":"https://pith.science/api/pith-number/JCY5MV5DY6LDAPS5B2RKIWDKYU/events.json","paper":"https://pith.science/paper/JCY5MV5D"},"agent_actions":{"view_html":"https://pith.science/pith/JCY5MV5DY6LDAPS5B2RKIWDKYU","download_json":"https://pith.science/pith/JCY5MV5DY6LDAPS5B2RKIWDKYU.json","view_paper":"https://pith.science/paper/JCY5MV5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08165&json=true","fetch_graph":"https://pith.science/api/pith-number/JCY5MV5DY6LDAPS5B2RKIWDKYU/graph.json","fetch_events":"https://pith.science/api/pith-number/JCY5MV5DY6LDAPS5B2RKIWDKYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCY5MV5DY6LDAPS5B2RKIWDKYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCY5MV5DY6LDAPS5B2RKIWDKYU/action/storage_attestation","attest_author":"https://pith.science/pith/JCY5MV5DY6LDAPS5B2RKIWDKYU/action/author_attestation","sign_citation":"https://pith.science/pith/JCY5MV5DY6LDAPS5B2RKIWDKYU/action/citation_signature","submit_replication":"https://pith.science/pith/JCY5MV5DY6LDAPS5B2RKIWDKYU/action/replication_record"}},"created_at":"2026-07-04T23:59:10.183836+00:00","updated_at":"2026-07-04T23:59:10.183836+00:00"}