{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4RZTWFZF4ZFIHCCWYM6OLEOJOR","short_pith_number":"pith:4RZTWFZF","schema_version":"1.0","canonical_sha256":"e4733b1725e64a838856c33ce591c9746ae74ff9380059f4d8b21188795e4a11","source":{"kind":"arxiv","id":"1503.00802","version":2},"attestation_state":"computed","paper":{"title":"Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Badong Chen, Guan Gui, Hua Qua, Jihong Zhaoa, Li Xu, Wentao Ma","submitted_at":"2015-03-03T01:32:12Z","abstract_excerpt":"Sparse adaptive channel estimation problem is one of the most important topics in broadband wireless communications systems due to its simplicity and robustness. So far many sparsity-aware channel estimation algorithms have been developed based on the well-known minimum mean square error (MMSE) criterion, such as the zero-attracting least mean square (ZALMS), which are robust under Gaussian assumption. In non-Gaussian environments, however, these methods are often no longer robust especially when systems are disturbed by random impulsive noises. To address this problem, we propose in this work"},"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":"1503.00802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:32:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7dca4a1a0e59dba3878f7bf821f42b1fe5a9eeb09377af34690a094a66757ac1","abstract_canon_sha256":"ba52532ea002c4940595138fcafc3f3b783ccf3a061076097c679705684f1977"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:51.143812Z","signature_b64":"HE6CkoQiM4bUg+s7ZzZD1oSeCWK/uTqNk8hV/5M8mDUx9iKwNjspxePqO+MPXuDkU6wh4eWEcsGJUHbuP0KvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4733b1725e64a838856c33ce591c9746ae74ff9380059f4d8b21188795e4a11","last_reissued_at":"2026-05-18T02:18:51.143068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:51.143068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Badong Chen, Guan Gui, Hua Qua, Jihong Zhaoa, Li Xu, Wentao Ma","submitted_at":"2015-03-03T01:32:12Z","abstract_excerpt":"Sparse adaptive channel estimation problem is one of the most important topics in broadband wireless communications systems due to its simplicity and robustness. So far many sparsity-aware channel estimation algorithms have been developed based on the well-known minimum mean square error (MMSE) criterion, such as the zero-attracting least mean square (ZALMS), which are robust under Gaussian assumption. In non-Gaussian environments, however, these methods are often no longer robust especially when systems are disturbed by random impulsive noises. To address this problem, we propose in this work"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00802","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":"1503.00802","created_at":"2026-05-18T02:18:51.143186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00802v2","created_at":"2026-05-18T02:18:51.143186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00802","created_at":"2026-05-18T02:18:51.143186+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RZTWFZF4ZFI","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RZTWFZF4ZFIHCCW","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RZTWFZF","created_at":"2026-05-18T12:29:05.191682+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/4RZTWFZF4ZFIHCCWYM6OLEOJOR","json":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR.json","graph_json":"https://pith.science/api/pith-number/4RZTWFZF4ZFIHCCWYM6OLEOJOR/graph.json","events_json":"https://pith.science/api/pith-number/4RZTWFZF4ZFIHCCWYM6OLEOJOR/events.json","paper":"https://pith.science/paper/4RZTWFZF"},"agent_actions":{"view_html":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR","download_json":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR.json","view_paper":"https://pith.science/paper/4RZTWFZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00802&json=true","fetch_graph":"https://pith.science/api/pith-number/4RZTWFZF4ZFIHCCWYM6OLEOJOR/graph.json","fetch_events":"https://pith.science/api/pith-number/4RZTWFZF4ZFIHCCWYM6OLEOJOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/action/storage_attestation","attest_author":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/action/author_attestation","sign_citation":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/action/citation_signature","submit_replication":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/action/replication_record"}},"created_at":"2026-05-18T02:18:51.143186+00:00","updated_at":"2026-05-18T02:18:51.143186+00:00"}