{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5QVOVHXA5PNXB6NI7V7Z54TZXD","short_pith_number":"pith:5QVOVHXA","canonical_record":{"source":{"id":"1503.01105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:35:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d73c2b3d1664e36faf6b44a5aef33a4a9b849533115e6099ad4189d0346cec0c","abstract_canon_sha256":"672925c76ec4f4642f379d74d3c0d05e90b599e59295b9db87c31cfdfb2b2946"},"schema_version":"1.0"},"canonical_sha256":"ec2aea9ee0ebdb70f9a8fd7f9ef279b8f4788674a2c362d4e4a5641af6790927","source":{"kind":"arxiv","id":"1503.01105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01105","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01105v1","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01105","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"5QVOVHXA5PNX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QVOVHXA5PNXB6NI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QVOVHXA","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5QVOVHXA5PNXB6NI7V7Z54TZXD","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:35:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d73c2b3d1664e36faf6b44a5aef33a4a9b849533115e6099ad4189d0346cec0c","abstract_canon_sha256":"672925c76ec4f4642f379d74d3c0d05e90b599e59295b9db87c31cfdfb2b2946"},"schema_version":"1.0"},"canonical_sha256":"ec2aea9ee0ebdb70f9a8fd7f9ef279b8f4788674a2c362d4e4a5641af6790927","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:39.850922Z","signature_b64":"NGIJGZxqOcZlnAgvYjs608r9mFnrxKaFMSNFsCg7wQsHWswAnzvKvq1B2TV6Gz38E9XYVGbYywiq4I2kg+IoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec2aea9ee0ebdb70f9a8fd7f9ef279b8f4788674a2c362d4e4a5641af6790927","last_reissued_at":"2026-05-18T02:25:39.850309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:39.850309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01105","source_version":1,"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:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2owVOZg2AbCPQw4yUo1fBRXPnujnVEBv4+kx9nwuanqpKB95M0caU9AqF51Hmbm1wp2wczhq7fcYmjoW7v2kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:19:19.251715Z"},"content_sha256":"79c6adbec18b6aaff2ce11f49ceec78cae01f7e5e12f525eadfb6282f73cb38b","schema_version":"1.0","event_id":"sha256:79c6adbec18b6aaff2ce11f49ceec78cae01f7e5e12f525eadfb6282f73cb38b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5QVOVHXA5PNXB6NI7V7Z54TZXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ROSA: Robust sparse adaptive channel estimation in the presence of impulsive noises","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guan Gui, Li Xu, Nobuhiro Shimoi","submitted_at":"2015-03-03T01:35:49Z","abstract_excerpt":"Based on the assumption of Gaussian noise model, conventional adaptive filtering algorithms for reconstruction sparse channels were proposed to take advantage of channel sparsity due to the fact that broadband wireless channels usually have the sparse nature. However, state-of-the-art algorithms are vulnerable to deteriorate under the assumption of non-Gaussian noise models (e.g., impulsive noise) which often exist in many advanced communications systems. In this paper, we study the problem of RObust Sparse Adaptive channel estimation (ROSA) in the environment of impulsive noises using variabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01105","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":""},"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:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMLgMdzgVgqPjYYN3KWKJQgyqt54/Edc/GGQQTJnQvCz0h7QYwcFfC0rmZjw1/O0HJGoUunP7/3j6Jkh1cKmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:19:19.252523Z"},"content_sha256":"98fa6a15b95df846bf5204ae091ce7786f883ab90ece32085003a641eca8064b","schema_version":"1.0","event_id":"sha256:98fa6a15b95df846bf5204ae091ce7786f883ab90ece32085003a641eca8064b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QVOVHXA5PNXB6NI7V7Z54TZXD/bundle.json","state_url":"https://pith.science/pith/5QVOVHXA5PNXB6NI7V7Z54TZXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QVOVHXA5PNXB6NI7V7Z54TZXD/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-06-11T23:19:19Z","links":{"resolver":"https://pith.science/pith/5QVOVHXA5PNXB6NI7V7Z54TZXD","bundle":"https://pith.science/pith/5QVOVHXA5PNXB6NI7V7Z54TZXD/bundle.json","state":"https://pith.science/pith/5QVOVHXA5PNXB6NI7V7Z54TZXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QVOVHXA5PNXB6NI7V7Z54TZXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5QVOVHXA5PNXB6NI7V7Z54TZXD","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":"672925c76ec4f4642f379d74d3c0d05e90b599e59295b9db87c31cfdfb2b2946","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:35:49Z","title_canon_sha256":"d73c2b3d1664e36faf6b44a5aef33a4a9b849533115e6099ad4189d0346cec0c"},"schema_version":"1.0","source":{"id":"1503.01105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01105","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01105v1","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01105","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"5QVOVHXA5PNX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QVOVHXA5PNXB6NI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QVOVHXA","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:98fa6a15b95df846bf5204ae091ce7786f883ab90ece32085003a641eca8064b","target":"graph","created_at":"2026-05-18T02:25:39Z","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":"Based on the assumption of Gaussian noise model, conventional adaptive filtering algorithms for reconstruction sparse channels were proposed to take advantage of channel sparsity due to the fact that broadband wireless channels usually have the sparse nature. However, state-of-the-art algorithms are vulnerable to deteriorate under the assumption of non-Gaussian noise models (e.g., impulsive noise) which often exist in many advanced communications systems. In this paper, we study the problem of RObust Sparse Adaptive channel estimation (ROSA) in the environment of impulsive noises using variabl","authors_text":"Guan Gui, Li Xu, Nobuhiro Shimoi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:35:49Z","title":"ROSA: Robust sparse adaptive channel estimation in the presence of impulsive noises"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01105","kind":"arxiv","version":1},"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:79c6adbec18b6aaff2ce11f49ceec78cae01f7e5e12f525eadfb6282f73cb38b","target":"record","created_at":"2026-05-18T02:25:39Z","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":"672925c76ec4f4642f379d74d3c0d05e90b599e59295b9db87c31cfdfb2b2946","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:35:49Z","title_canon_sha256":"d73c2b3d1664e36faf6b44a5aef33a4a9b849533115e6099ad4189d0346cec0c"},"schema_version":"1.0","source":{"id":"1503.01105","kind":"arxiv","version":1}},"canonical_sha256":"ec2aea9ee0ebdb70f9a8fd7f9ef279b8f4788674a2c362d4e4a5641af6790927","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec2aea9ee0ebdb70f9a8fd7f9ef279b8f4788674a2c362d4e4a5641af6790927","first_computed_at":"2026-05-18T02:25:39.850309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:39.850309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NGIJGZxqOcZlnAgvYjs608r9mFnrxKaFMSNFsCg7wQsHWswAnzvKvq1B2TV6Gz38E9XYVGbYywiq4I2kg+IoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:39.850922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79c6adbec18b6aaff2ce11f49ceec78cae01f7e5e12f525eadfb6282f73cb38b","sha256:98fa6a15b95df846bf5204ae091ce7786f883ab90ece32085003a641eca8064b"],"state_sha256":"3dc84680a857541670abd1bac0823ac6f91f35a48d0d2fd762833d8e92010af5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UG/s5G2BDopfG4xxOvRvBsc7K7QNZO1Ljzr/Adc9rseFzfNhjhVW2YtyiFotnGV8CJTXXTe/6UhiWpOw1hfnCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:19:19.256700Z","bundle_sha256":"d4b817a76f20d95b680592f42fb0a1bb81ce10149b8b08a3568913d51993cfc3"}}