{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BHBD6UCHPLMNET6ITR6266IIRD","short_pith_number":"pith:BHBD6UCH","schema_version":"1.0","canonical_sha256":"09c23f50477ad8d24fc89c7daf790888e7e0cdd16dcc7531c5e82d75025cc43a","source":{"kind":"arxiv","id":"1505.07569","version":4},"attestation_state":"computed","paper":{"title":"A novel normalized sign algorithm for system identification under impulsive noise interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Badong Chen, Haiquan Zhao, Kan Li, Lu Lu","submitted_at":"2015-05-28T07:31:58Z","abstract_excerpt":"To overcome the performance degradation of adaptive filtering algorithms in the presence of impulsive noise, a novel normalized sign algorithm (NSA) based on a convex combination strategy, called NSA-NSA, is proposed in this paper. The proposed algorithm is capable of solving the conflicting requirement of fast convergence rate and low steady-state error for an individual NSA filter. To further improve the robustness to impulsive noises, a mixing parameter updating formula based on a sign cost function is derived. Moreover, a tracking weight transfer scheme of coefficients from a fast NSA filt"},"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":"1505.07569","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-05-28T07:31:58Z","cross_cats_sorted":[],"title_canon_sha256":"ead64582d1584117fcfc2d22589285a645961e270c5369ce3c49fd97d3fc6dbb","abstract_canon_sha256":"e9746e5c379901ad181b9e7b57246a2aade832138dd27dc396094c11871a7387"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:00.122337Z","signature_b64":"hb+8fOoAlFGFdjXXn1QD4jAPSI1xrZa5P5MIC0V94yV0otD7V2fnwRW8t9Hm3rao6VPPGTYfnwxm37Bv6+imDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09c23f50477ad8d24fc89c7daf790888e7e0cdd16dcc7531c5e82d75025cc43a","last_reissued_at":"2026-05-18T01:25:00.121716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:00.121716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A novel normalized sign algorithm for system identification under impulsive noise interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Badong Chen, Haiquan Zhao, Kan Li, Lu Lu","submitted_at":"2015-05-28T07:31:58Z","abstract_excerpt":"To overcome the performance degradation of adaptive filtering algorithms in the presence of impulsive noise, a novel normalized sign algorithm (NSA) based on a convex combination strategy, called NSA-NSA, is proposed in this paper. The proposed algorithm is capable of solving the conflicting requirement of fast convergence rate and low steady-state error for an individual NSA filter. To further improve the robustness to impulsive noises, a mixing parameter updating formula based on a sign cost function is derived. Moreover, a tracking weight transfer scheme of coefficients from a fast NSA filt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07569","kind":"arxiv","version":4},"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":"1505.07569","created_at":"2026-05-18T01:25:00.121819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07569v4","created_at":"2026-05-18T01:25:00.121819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07569","created_at":"2026-05-18T01:25:00.121819+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHBD6UCHPLMN","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHBD6UCHPLMNET6I","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHBD6UCH","created_at":"2026-05-18T12:29:14.074870+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/BHBD6UCHPLMNET6ITR6266IIRD","json":"https://pith.science/pith/BHBD6UCHPLMNET6ITR6266IIRD.json","graph_json":"https://pith.science/api/pith-number/BHBD6UCHPLMNET6ITR6266IIRD/graph.json","events_json":"https://pith.science/api/pith-number/BHBD6UCHPLMNET6ITR6266IIRD/events.json","paper":"https://pith.science/paper/BHBD6UCH"},"agent_actions":{"view_html":"https://pith.science/pith/BHBD6UCHPLMNET6ITR6266IIRD","download_json":"https://pith.science/pith/BHBD6UCHPLMNET6ITR6266IIRD.json","view_paper":"https://pith.science/paper/BHBD6UCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07569&json=true","fetch_graph":"https://pith.science/api/pith-number/BHBD6UCHPLMNET6ITR6266IIRD/graph.json","fetch_events":"https://pith.science/api/pith-number/BHBD6UCHPLMNET6ITR6266IIRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHBD6UCHPLMNET6ITR6266IIRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHBD6UCHPLMNET6ITR6266IIRD/action/storage_attestation","attest_author":"https://pith.science/pith/BHBD6UCHPLMNET6ITR6266IIRD/action/author_attestation","sign_citation":"https://pith.science/pith/BHBD6UCHPLMNET6ITR6266IIRD/action/citation_signature","submit_replication":"https://pith.science/pith/BHBD6UCHPLMNET6ITR6266IIRD/action/replication_record"}},"created_at":"2026-05-18T01:25:00.121819+00:00","updated_at":"2026-05-18T01:25:00.121819+00:00"}