{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4RZTWFZF4ZFIHCCWYM6OLEOJOR","short_pith_number":"pith:4RZTWFZF","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"},"canonical_sha256":"e4733b1725e64a838856c33ce591c9746ae74ff9380059f4d8b21188795e4a11","source":{"kind":"arxiv","id":"1503.00802","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00802","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00802v2","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00802","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"4RZTWFZF4ZFI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4RZTWFZF4ZFIHCCW","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4RZTWFZF","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4RZTWFZF4ZFIHCCWYM6OLEOJOR","target":"record","payload":{"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"},"canonical_sha256":"e4733b1725e64a838856c33ce591c9746ae74ff9380059f4d8b21188795e4a11","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"},"source_kind":"arxiv","source_id":"1503.00802","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-18T02:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87Ve8ilgOj8GvegLXZD0/AEZ2zdmww1Uxsfzdr5hKN7FyGx650CuQaSii0ZVPX87M5lBJSLMYb9Y4n0U85udAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:33:20.842862Z"},"content_sha256":"5aa67417bf828b7e3de556bc2f6cb3e8d0d26b4bea1e17b914af94044c520f62","schema_version":"1.0","event_id":"sha256:5aa67417bf828b7e3de556bc2f6cb3e8d0d26b4bea1e17b914af94044c520f62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4RZTWFZF4ZFIHCCWYM6OLEOJOR","target":"graph","payload":{"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"},"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-18T02:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eiAENZwvBzdaAwKqBoY2OFp1XZlwdY957C9fTtSptlzLM+DjP/1q8uAnFtmPcqT1qzFpSb85g6JBbX74Z394BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:33:20.843490Z"},"content_sha256":"1c96635a57e47ace092aa597106ea9325a0d4b42bb1b318c112b55f50f93d52d","schema_version":"1.0","event_id":"sha256:1c96635a57e47ace092aa597106ea9325a0d4b42bb1b318c112b55f50f93d52d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/bundle.json","state_url":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/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-05-28T06:33:20Z","links":{"resolver":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR","bundle":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/bundle.json","state":"https://pith.science/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RZTWFZF4ZFIHCCWYM6OLEOJOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4RZTWFZF4ZFIHCCWYM6OLEOJOR","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":"ba52532ea002c4940595138fcafc3f3b783ccf3a061076097c679705684f1977","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:32:12Z","title_canon_sha256":"7dca4a1a0e59dba3878f7bf821f42b1fe5a9eeb09377af34690a094a66757ac1"},"schema_version":"1.0","source":{"id":"1503.00802","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00802","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00802v2","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00802","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"4RZTWFZF4ZFI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4RZTWFZF4ZFIHCCW","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4RZTWFZF","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:1c96635a57e47ace092aa597106ea9325a0d4b42bb1b318c112b55f50f93d52d","target":"graph","created_at":"2026-05-18T02:18:51Z","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":"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","authors_text":"Badong Chen, Guan Gui, Hua Qua, Jihong Zhaoa, Li Xu, Wentao Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:32:12Z","title":"Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00802","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:5aa67417bf828b7e3de556bc2f6cb3e8d0d26b4bea1e17b914af94044c520f62","target":"record","created_at":"2026-05-18T02:18:51Z","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":"ba52532ea002c4940595138fcafc3f3b783ccf3a061076097c679705684f1977","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:32:12Z","title_canon_sha256":"7dca4a1a0e59dba3878f7bf821f42b1fe5a9eeb09377af34690a094a66757ac1"},"schema_version":"1.0","source":{"id":"1503.00802","kind":"arxiv","version":2}},"canonical_sha256":"e4733b1725e64a838856c33ce591c9746ae74ff9380059f4d8b21188795e4a11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4733b1725e64a838856c33ce591c9746ae74ff9380059f4d8b21188795e4a11","first_computed_at":"2026-05-18T02:18:51.143068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:51.143068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HE6CkoQiM4bUg+s7ZzZD1oSeCWK/uTqNk8hV/5M8mDUx9iKwNjspxePqO+MPXuDkU6wh4eWEcsGJUHbuP0KvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:51.143812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00802","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5aa67417bf828b7e3de556bc2f6cb3e8d0d26b4bea1e17b914af94044c520f62","sha256:1c96635a57e47ace092aa597106ea9325a0d4b42bb1b318c112b55f50f93d52d"],"state_sha256":"ab139c46c2d72a2c10d7e28a1b53ef3c959f8648ba9f32535801a2a9f749ff49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1l4X6k+TGXEa0kHDR5/E5cs9UXN297TDNeBeRgIJpyCjmRvukydExhbs6k2/sbVhyZFFQTMru0IHbMyOUzD2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:33:20.846384Z","bundle_sha256":"4c926943d960bc3e5809b8d89d092f369318d0942845c817166f502ef25f95c8"}}