{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PN3GXT7D4AKRB4LRUBFBA74M7L","short_pith_number":"pith:PN3GXT7D","schema_version":"1.0","canonical_sha256":"7b766bcfe3e01510f171a04a107f8cfae138202952d5adc84a6ff11e63304ff8","source":{"kind":"arxiv","id":"1808.06536","version":1},"attestation_state":"computed","paper":{"title":"Study of Set-Membership Adaptive Kernel Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"eess.SP","authors_text":"A. Flores, R. C. de Lamare","submitted_at":"2018-08-15T23:49:51Z","abstract_excerpt":"In the last decade, a considerable research effort has been devoted to developing adaptive algorithms based on kernel functions. One of the main features of these algorithms is that they form a family of universal approximation techniques, solving problems with nonlinearities elegantly. In this paper, we present data-selective adaptive kernel normalized least-mean square (KNLMS) algorithms that can increase their learning rate and reduce their computational complexity. In fact, these methods deal with kernel expansions, creating a growing structure also known as the dictionary, whose size depe"},"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":"1808.06536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-15T23:49:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"bf4f7d8e3ab9d0a0201f8e607bbce4a92586769944ebb12b539fc1fc0aea85d3","abstract_canon_sha256":"747aa7998cf903528ef60c15a565a31b21974fa94bd751bab98a9dbfc2b41ff6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:44.529431Z","signature_b64":"PwXUQCsydH1vsDwSPnPBBdTIcEGhZw2s1Ga+b9YtSCZIbocGKTMG5xrrlyh1H4vZDc9GRA8fPUD+wlTH3qoaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b766bcfe3e01510f171a04a107f8cfae138202952d5adc84a6ff11e63304ff8","last_reissued_at":"2026-05-18T00:07:44.528897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:44.528897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Study of Set-Membership Adaptive Kernel Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"eess.SP","authors_text":"A. Flores, R. C. de Lamare","submitted_at":"2018-08-15T23:49:51Z","abstract_excerpt":"In the last decade, a considerable research effort has been devoted to developing adaptive algorithms based on kernel functions. One of the main features of these algorithms is that they form a family of universal approximation techniques, solving problems with nonlinearities elegantly. In this paper, we present data-selective adaptive kernel normalized least-mean square (KNLMS) algorithms that can increase their learning rate and reduce their computational complexity. In fact, these methods deal with kernel expansions, creating a growing structure also known as the dictionary, whose size depe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06536","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":"1808.06536","created_at":"2026-05-18T00:07:44.528978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06536v1","created_at":"2026-05-18T00:07:44.528978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06536","created_at":"2026-05-18T00:07:44.528978+00:00"},{"alias_kind":"pith_short_12","alias_value":"PN3GXT7D4AKR","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PN3GXT7D4AKRB4LR","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PN3GXT7D","created_at":"2026-05-18T12:32:46.962924+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/PN3GXT7D4AKRB4LRUBFBA74M7L","json":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L.json","graph_json":"https://pith.science/api/pith-number/PN3GXT7D4AKRB4LRUBFBA74M7L/graph.json","events_json":"https://pith.science/api/pith-number/PN3GXT7D4AKRB4LRUBFBA74M7L/events.json","paper":"https://pith.science/paper/PN3GXT7D"},"agent_actions":{"view_html":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L","download_json":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L.json","view_paper":"https://pith.science/paper/PN3GXT7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06536&json=true","fetch_graph":"https://pith.science/api/pith-number/PN3GXT7D4AKRB4LRUBFBA74M7L/graph.json","fetch_events":"https://pith.science/api/pith-number/PN3GXT7D4AKRB4LRUBFBA74M7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/action/storage_attestation","attest_author":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/action/author_attestation","sign_citation":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/action/citation_signature","submit_replication":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/action/replication_record"}},"created_at":"2026-05-18T00:07:44.528978+00:00","updated_at":"2026-05-18T00:07:44.528978+00:00"}