{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QYSRSKAQA7KKM4E7RUXJ4XPKJO","short_pith_number":"pith:QYSRSKAQ","schema_version":"1.0","canonical_sha256":"862519281007d4a6709f8d2e9e5dea4bb3b6fb2b53eeb97108e7acf7942b5cb3","source":{"kind":"arxiv","id":"1602.08116","version":1},"attestation_state":"computed","paper":{"title":"Interference-Normalised Least Mean Square Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SD"],"primary_cat":"cs.SY","authors_text":"Iain B. Collings, Jean-Marc Valin","submitted_at":"2016-02-25T21:12:05Z","abstract_excerpt":"An interference-normalised least mean square (INLMS) algorithm for robust adaptive filtering is proposed. The INLMS algorithm extends the gradient-adaptive learning rate approach to the case where the signals are non-stationary. In particular, we show that the INLMS algorithm can work even for highly non-stationary interference signals, where previous gradient-adaptive learning rate algorithms fail."},"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":"1602.08116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-02-25T21:12:05Z","cross_cats_sorted":["cs.SD"],"title_canon_sha256":"f1195348eade27bdee2bdf933133f90e34e29de4b316d3e0634f9df6b37fa434","abstract_canon_sha256":"a7b48dd85ca93178bdde0bcdff7a9858be6a39ba4789fc9427c1f40b705ceb47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.768987Z","signature_b64":"Xizm6/Qyff6LUNxRQsmy+UhZEx0Bzy7kVoBBZ1IBFtnqy+uuyMan0n/vsmuxb6BFE7SXiD4qKlwGWSqIlFhYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"862519281007d4a6709f8d2e9e5dea4bb3b6fb2b53eeb97108e7acf7942b5cb3","last_reissued_at":"2026-05-18T01:19:56.768440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.768440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference-Normalised Least Mean Square Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SD"],"primary_cat":"cs.SY","authors_text":"Iain B. Collings, Jean-Marc Valin","submitted_at":"2016-02-25T21:12:05Z","abstract_excerpt":"An interference-normalised least mean square (INLMS) algorithm for robust adaptive filtering is proposed. The INLMS algorithm extends the gradient-adaptive learning rate approach to the case where the signals are non-stationary. In particular, we show that the INLMS algorithm can work even for highly non-stationary interference signals, where previous gradient-adaptive learning rate algorithms fail."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08116","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":"1602.08116","created_at":"2026-05-18T01:19:56.768516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08116v1","created_at":"2026-05-18T01:19:56.768516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08116","created_at":"2026-05-18T01:19:56.768516+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYSRSKAQA7KK","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYSRSKAQA7KKM4E7","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYSRSKAQ","created_at":"2026-05-18T12:30:41.710351+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/QYSRSKAQA7KKM4E7RUXJ4XPKJO","json":"https://pith.science/pith/QYSRSKAQA7KKM4E7RUXJ4XPKJO.json","graph_json":"https://pith.science/api/pith-number/QYSRSKAQA7KKM4E7RUXJ4XPKJO/graph.json","events_json":"https://pith.science/api/pith-number/QYSRSKAQA7KKM4E7RUXJ4XPKJO/events.json","paper":"https://pith.science/paper/QYSRSKAQ"},"agent_actions":{"view_html":"https://pith.science/pith/QYSRSKAQA7KKM4E7RUXJ4XPKJO","download_json":"https://pith.science/pith/QYSRSKAQA7KKM4E7RUXJ4XPKJO.json","view_paper":"https://pith.science/paper/QYSRSKAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08116&json=true","fetch_graph":"https://pith.science/api/pith-number/QYSRSKAQA7KKM4E7RUXJ4XPKJO/graph.json","fetch_events":"https://pith.science/api/pith-number/QYSRSKAQA7KKM4E7RUXJ4XPKJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYSRSKAQA7KKM4E7RUXJ4XPKJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYSRSKAQA7KKM4E7RUXJ4XPKJO/action/storage_attestation","attest_author":"https://pith.science/pith/QYSRSKAQA7KKM4E7RUXJ4XPKJO/action/author_attestation","sign_citation":"https://pith.science/pith/QYSRSKAQA7KKM4E7RUXJ4XPKJO/action/citation_signature","submit_replication":"https://pith.science/pith/QYSRSKAQA7KKM4E7RUXJ4XPKJO/action/replication_record"}},"created_at":"2026-05-18T01:19:56.768516+00:00","updated_at":"2026-05-18T01:19:56.768516+00:00"}