{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RVEUQTB2OPOV5OAXSZOX2NB3TV","short_pith_number":"pith:RVEUQTB2","schema_version":"1.0","canonical_sha256":"8d49484c3a73dd5eb817965d7d343b9d760f1fd02b31c320203f7bea65b6c3a2","source":{"kind":"arxiv","id":"1812.02588","version":2},"attestation_state":"computed","paper":{"title":"q-LMF: Quantum Calculus-based Least Mean Fourth Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC"],"primary_cat":"eess.SP","authors_text":"Alishba Sadiq, Imran Naseem, Muhammad Moinuddin, Muhammad Usman, Shujaat Khan, Ubaid M. Al-Saggaf","submitted_at":"2018-12-04T13:52:43Z","abstract_excerpt":"Channel estimation is an essential part of modern communication systems as it enhances the overall performance of the system. In recent past a variety of adaptive learning methods have been designed to enhance the robustness and convergence speed of the learning process. However, the need for an optimal technique is still there. Herein, for non-Gaussian noisy environment we propose a new class of stochastic gradient algorithm for channel identification. The proposed $q$-least mean fourth ($q$-LMF) is an extension of least mean fourth (LMF) algorithm and it is based on the $q$-calculus which is"},"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":"1812.02588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-04T13:52:43Z","cross_cats_sorted":["cs.LG","cs.SY","math.OC"],"title_canon_sha256":"078839a5aeaf2d875819b74394f8abd490795a5c83e4eb12e207d0be6ae6da84","abstract_canon_sha256":"8bc00604fe25ab21bea82540519719698bb0767d3d9e79bbd5e5cbc844c2d25d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:50.164093Z","signature_b64":"dOOkbrFGjtOUULK/zcGxmb/Dh1nUsg6bRATB39YeqR8pqzIrZSWa9Eaa56clRpf88QIufWb3JmA8/KgC8BiKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d49484c3a73dd5eb817965d7d343b9d760f1fd02b31c320203f7bea65b6c3a2","last_reissued_at":"2026-05-17T23:57:50.163347Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:50.163347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"q-LMF: Quantum Calculus-based Least Mean Fourth Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC"],"primary_cat":"eess.SP","authors_text":"Alishba Sadiq, Imran Naseem, Muhammad Moinuddin, Muhammad Usman, Shujaat Khan, Ubaid M. Al-Saggaf","submitted_at":"2018-12-04T13:52:43Z","abstract_excerpt":"Channel estimation is an essential part of modern communication systems as it enhances the overall performance of the system. In recent past a variety of adaptive learning methods have been designed to enhance the robustness and convergence speed of the learning process. However, the need for an optimal technique is still there. Herein, for non-Gaussian noisy environment we propose a new class of stochastic gradient algorithm for channel identification. The proposed $q$-least mean fourth ($q$-LMF) is an extension of least mean fourth (LMF) algorithm and it is based on the $q$-calculus which is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02588","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.02588","created_at":"2026-05-17T23:57:50.163467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02588v2","created_at":"2026-05-17T23:57:50.163467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02588","created_at":"2026-05-17T23:57:50.163467+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVEUQTB2OPOV","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVEUQTB2OPOV5OAX","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVEUQTB2","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08389","citing_title":"Chaotic Time Series Prediction using Spatio-Temporal RBF Neural Networks","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV","json":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV.json","graph_json":"https://pith.science/api/pith-number/RVEUQTB2OPOV5OAXSZOX2NB3TV/graph.json","events_json":"https://pith.science/api/pith-number/RVEUQTB2OPOV5OAXSZOX2NB3TV/events.json","paper":"https://pith.science/paper/RVEUQTB2"},"agent_actions":{"view_html":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV","download_json":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV.json","view_paper":"https://pith.science/paper/RVEUQTB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02588&json=true","fetch_graph":"https://pith.science/api/pith-number/RVEUQTB2OPOV5OAXSZOX2NB3TV/graph.json","fetch_events":"https://pith.science/api/pith-number/RVEUQTB2OPOV5OAXSZOX2NB3TV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/action/storage_attestation","attest_author":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/action/author_attestation","sign_citation":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/action/citation_signature","submit_replication":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/action/replication_record"}},"created_at":"2026-05-17T23:57:50.163467+00:00","updated_at":"2026-05-17T23:57:50.163467+00:00"}