{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6CXGKDDYH4OLQFCAR6T5ONPZLF","short_pith_number":"pith:6CXGKDDY","schema_version":"1.0","canonical_sha256":"f0ae650c783f1cb814408fa7d735f9597a5544ed63dd182463b25036220b52e6","source":{"kind":"arxiv","id":"1805.01305","version":1},"attestation_state":"computed","paper":{"title":"Noise constrained least mean absolute third algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Sihai Guan, Zhi Li","submitted_at":"2018-05-03T13:41:55Z","abstract_excerpt":"The learning speed of an adaptive algorithm can be improved by properly constraining the cost function of the adaptive algorithm. Besides, the stabilization of the NCLMF algorithm is more complicated, whose stability depends solely on the input power of the adaptive filter and the NCLMF algorithm with unbounded repressors is not mean square stability even for a small value of the step-size. So, in this paper, a noise variance constrained least mean absolute third (LMAT) algorithm is investigated. The noise constrained LMAT (NCLMAT) algorithm is obtained by constraining the cost function of the"},"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":"1805.01305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-05-03T13:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"64aa063c39b76d0bdf682063540d5dd3cf20e1114120f00d8eaffd5d06d6b710","abstract_canon_sha256":"7e49e601d7b52cbb7c7489916ddaa45f7ac756524a50f8ff4d87597dabf7ebf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:51.819200Z","signature_b64":"u1oNyuguVgUBbANMd2xxg1+dUDvduf1+8NPA26H78C107DAcNDpEMATSlnXOAF5tOzzIZUW4VGUFOwJHf7f1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0ae650c783f1cb814408fa7d735f9597a5544ed63dd182463b25036220b52e6","last_reissued_at":"2026-05-18T00:16:51.818549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:51.818549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noise constrained least mean absolute third algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Sihai Guan, Zhi Li","submitted_at":"2018-05-03T13:41:55Z","abstract_excerpt":"The learning speed of an adaptive algorithm can be improved by properly constraining the cost function of the adaptive algorithm. Besides, the stabilization of the NCLMF algorithm is more complicated, whose stability depends solely on the input power of the adaptive filter and the NCLMF algorithm with unbounded repressors is not mean square stability even for a small value of the step-size. So, in this paper, a noise variance constrained least mean absolute third (LMAT) algorithm is investigated. The noise constrained LMAT (NCLMAT) algorithm is obtained by constraining the cost function of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01305","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.01305","created_at":"2026-05-18T00:16:51.818650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01305v1","created_at":"2026-05-18T00:16:51.818650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01305","created_at":"2026-05-18T00:16:51.818650+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CXGKDDYH4OL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CXGKDDYH4OLQFCA","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CXGKDDY","created_at":"2026-05-18T12:32:08.215937+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/6CXGKDDYH4OLQFCAR6T5ONPZLF","json":"https://pith.science/pith/6CXGKDDYH4OLQFCAR6T5ONPZLF.json","graph_json":"https://pith.science/api/pith-number/6CXGKDDYH4OLQFCAR6T5ONPZLF/graph.json","events_json":"https://pith.science/api/pith-number/6CXGKDDYH4OLQFCAR6T5ONPZLF/events.json","paper":"https://pith.science/paper/6CXGKDDY"},"agent_actions":{"view_html":"https://pith.science/pith/6CXGKDDYH4OLQFCAR6T5ONPZLF","download_json":"https://pith.science/pith/6CXGKDDYH4OLQFCAR6T5ONPZLF.json","view_paper":"https://pith.science/paper/6CXGKDDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01305&json=true","fetch_graph":"https://pith.science/api/pith-number/6CXGKDDYH4OLQFCAR6T5ONPZLF/graph.json","fetch_events":"https://pith.science/api/pith-number/6CXGKDDYH4OLQFCAR6T5ONPZLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CXGKDDYH4OLQFCAR6T5ONPZLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CXGKDDYH4OLQFCAR6T5ONPZLF/action/storage_attestation","attest_author":"https://pith.science/pith/6CXGKDDYH4OLQFCAR6T5ONPZLF/action/author_attestation","sign_citation":"https://pith.science/pith/6CXGKDDYH4OLQFCAR6T5ONPZLF/action/citation_signature","submit_replication":"https://pith.science/pith/6CXGKDDYH4OLQFCAR6T5ONPZLF/action/replication_record"}},"created_at":"2026-05-18T00:16:51.818650+00:00","updated_at":"2026-05-18T00:16:51.818650+00:00"}