{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RVEUQTB2OPOV5OAXSZOX2NB3TV","short_pith_number":"pith:RVEUQTB2","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"},"canonical_sha256":"8d49484c3a73dd5eb817965d7d343b9d760f1fd02b31c320203f7bea65b6c3a2","source":{"kind":"arxiv","id":"1812.02588","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02588","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02588v2","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02588","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"RVEUQTB2OPOV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RVEUQTB2OPOV5OAX","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RVEUQTB2","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RVEUQTB2OPOV5OAXSZOX2NB3TV","target":"record","payload":{"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"},"canonical_sha256":"8d49484c3a73dd5eb817965d7d343b9d760f1fd02b31c320203f7bea65b6c3a2","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"},"source_kind":"arxiv","source_id":"1812.02588","source_version":2,"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-17T23:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKQVnt7/vZ/+0QwNjDCAp/3nzaD6iS1Z4bhO4vGdl3r1tbiThZnyZ3mo2QvgA6J32AGgUd+P2QlS3qJrdT/AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:30:25.465410Z"},"content_sha256":"c05af673ece7ea9414311332c588ba105acbdce2638d061022ae0dad3d5fa630","schema_version":"1.0","event_id":"sha256:c05af673ece7ea9414311332c588ba105acbdce2638d061022ae0dad3d5fa630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RVEUQTB2OPOV5OAXSZOX2NB3TV","target":"graph","payload":{"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"},"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-17T23:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHD+aHv2csoesioXxN5S6K4W8tFrwFgUIvcNcnMhtXx5pf4OKys7Kw+Rm0Uj6AN/9VoP1LD9eLM67pNEgALmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:30:25.465867Z"},"content_sha256":"cc64282b3a91046021a56908e56b4a35e9d516894baa12335e77a89eb81cd635","schema_version":"1.0","event_id":"sha256:cc64282b3a91046021a56908e56b4a35e9d516894baa12335e77a89eb81cd635"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/bundle.json","state_url":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/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-16T20:30:25Z","links":{"resolver":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV","bundle":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/bundle.json","state":"https://pith.science/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVEUQTB2OPOV5OAXSZOX2NB3TV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RVEUQTB2OPOV5OAXSZOX2NB3TV","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":"8bc00604fe25ab21bea82540519719698bb0767d3d9e79bbd5e5cbc844c2d25d","cross_cats_sorted":["cs.LG","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-04T13:52:43Z","title_canon_sha256":"078839a5aeaf2d875819b74394f8abd490795a5c83e4eb12e207d0be6ae6da84"},"schema_version":"1.0","source":{"id":"1812.02588","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02588","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02588v2","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02588","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"RVEUQTB2OPOV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RVEUQTB2OPOV5OAX","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RVEUQTB2","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:cc64282b3a91046021a56908e56b4a35e9d516894baa12335e77a89eb81cd635","target":"graph","created_at":"2026-05-17T23:57:50Z","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":"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","authors_text":"Alishba Sadiq, Imran Naseem, Muhammad Moinuddin, Muhammad Usman, Shujaat Khan, Ubaid M. Al-Saggaf","cross_cats":["cs.LG","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-04T13:52:43Z","title":"q-LMF: Quantum Calculus-based Least Mean Fourth Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02588","kind":"arxiv","version":2},"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:c05af673ece7ea9414311332c588ba105acbdce2638d061022ae0dad3d5fa630","target":"record","created_at":"2026-05-17T23:57:50Z","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":"8bc00604fe25ab21bea82540519719698bb0767d3d9e79bbd5e5cbc844c2d25d","cross_cats_sorted":["cs.LG","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-04T13:52:43Z","title_canon_sha256":"078839a5aeaf2d875819b74394f8abd490795a5c83e4eb12e207d0be6ae6da84"},"schema_version":"1.0","source":{"id":"1812.02588","kind":"arxiv","version":2}},"canonical_sha256":"8d49484c3a73dd5eb817965d7d343b9d760f1fd02b31c320203f7bea65b6c3a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d49484c3a73dd5eb817965d7d343b9d760f1fd02b31c320203f7bea65b6c3a2","first_computed_at":"2026-05-17T23:57:50.163347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:50.163347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dOOkbrFGjtOUULK/zcGxmb/Dh1nUsg6bRATB39YeqR8pqzIrZSWa9Eaa56clRpf88QIufWb3JmA8/KgC8BiKCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:50.164093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02588","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c05af673ece7ea9414311332c588ba105acbdce2638d061022ae0dad3d5fa630","sha256:cc64282b3a91046021a56908e56b4a35e9d516894baa12335e77a89eb81cd635"],"state_sha256":"50a6d929ac1ea9cc8c18c2cb2b4f4a979029c30a0875cea25552ed4ea374e74d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNMG/j3nOLm+Ss+AIrrgvDsDMQV/6bQsUXD2T4ai6P6gVP70FOVSmnZgDzd2tsX2Fb1sc/oHyZF1G/9F6dcYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:30:25.471438Z","bundle_sha256":"ade2f1ea93b68b2f0d35ea7b1e8354d7fc8e49b01cd012c6019c419a1888a91d"}}