{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PN3GXT7D4AKRB4LRUBFBA74M7L","short_pith_number":"pith:PN3GXT7D","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"},"canonical_sha256":"7b766bcfe3e01510f171a04a107f8cfae138202952d5adc84a6ff11e63304ff8","source":{"kind":"arxiv","id":"1808.06536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06536","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06536v1","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06536","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"PN3GXT7D4AKR","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PN3GXT7D4AKRB4LR","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PN3GXT7D","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PN3GXT7D4AKRB4LRUBFBA74M7L","target":"record","payload":{"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"},"canonical_sha256":"7b766bcfe3e01510f171a04a107f8cfae138202952d5adc84a6ff11e63304ff8","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"},"source_kind":"arxiv","source_id":"1808.06536","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-18T00:07:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fH9iI+030C9EPXTeCWQpCuFSS4htUHCKPimxWk2vbqGRGRf8OwWlt4lWhop0Ci/UCd/mHj6GdGoMJzJKm657CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:03:21.407488Z"},"content_sha256":"ab7140e0f8e04282bb48a0268cc44bf0dc2b3da1dfdd66bf32f7b7c63688e8a2","schema_version":"1.0","event_id":"sha256:ab7140e0f8e04282bb48a0268cc44bf0dc2b3da1dfdd66bf32f7b7c63688e8a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PN3GXT7D4AKRB4LRUBFBA74M7L","target":"graph","payload":{"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"},"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-18T00:07:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqsJ2wkTgVk33It7CSa38xMaZwhkGzCgOzi/SRtEWKDMvu5e+XOOw4vEC49/TOlvmj5WyScDvhzIWmLJUVhTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:03:21.407842Z"},"content_sha256":"dbb25776a482ff674ba8dfc211c25191468a0e69b92ac4c1acb5aa6abc4024d0","schema_version":"1.0","event_id":"sha256:dbb25776a482ff674ba8dfc211c25191468a0e69b92ac4c1acb5aa6abc4024d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/bundle.json","state_url":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/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-05-20T12:03:21Z","links":{"resolver":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L","bundle":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/bundle.json","state":"https://pith.science/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PN3GXT7D4AKRB4LRUBFBA74M7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PN3GXT7D4AKRB4LRUBFBA74M7L","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":"747aa7998cf903528ef60c15a565a31b21974fa94bd751bab98a9dbfc2b41ff6","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-15T23:49:51Z","title_canon_sha256":"bf4f7d8e3ab9d0a0201f8e607bbce4a92586769944ebb12b539fc1fc0aea85d3"},"schema_version":"1.0","source":{"id":"1808.06536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06536","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06536v1","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06536","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"PN3GXT7D4AKR","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PN3GXT7D4AKRB4LR","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PN3GXT7D","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:dbb25776a482ff674ba8dfc211c25191468a0e69b92ac4c1acb5aa6abc4024d0","target":"graph","created_at":"2026-05-18T00:07:44Z","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":"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","authors_text":"A. Flores, R. C. de Lamare","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-15T23:49:51Z","title":"Study of Set-Membership Adaptive Kernel Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06536","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:ab7140e0f8e04282bb48a0268cc44bf0dc2b3da1dfdd66bf32f7b7c63688e8a2","target":"record","created_at":"2026-05-18T00:07:44Z","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":"747aa7998cf903528ef60c15a565a31b21974fa94bd751bab98a9dbfc2b41ff6","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-15T23:49:51Z","title_canon_sha256":"bf4f7d8e3ab9d0a0201f8e607bbce4a92586769944ebb12b539fc1fc0aea85d3"},"schema_version":"1.0","source":{"id":"1808.06536","kind":"arxiv","version":1}},"canonical_sha256":"7b766bcfe3e01510f171a04a107f8cfae138202952d5adc84a6ff11e63304ff8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b766bcfe3e01510f171a04a107f8cfae138202952d5adc84a6ff11e63304ff8","first_computed_at":"2026-05-18T00:07:44.528897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:44.528897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PwXUQCsydH1vsDwSPnPBBdTIcEGhZw2s1Ga+b9YtSCZIbocGKTMG5xrrlyh1H4vZDc9GRA8fPUD+wlTH3qoaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:44.529431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab7140e0f8e04282bb48a0268cc44bf0dc2b3da1dfdd66bf32f7b7c63688e8a2","sha256:dbb25776a482ff674ba8dfc211c25191468a0e69b92ac4c1acb5aa6abc4024d0"],"state_sha256":"da6cf5ac5eedc44839035d72e05cf942f5f3c3c79ca0b55f43172c80bc7a1edc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YCtfNyOOSTHrLNSgn5k37x1qDq35pPV5rn4czOUvDevmZ/TZGzV5UhObFdb8s7SLKTfk2y2gySfZHfBLTXWBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T12:03:21.409806Z","bundle_sha256":"9aa7c0f6c3461f2869311872ff7538efe6dd3dc4175f376f8a01f8403ce95893"}}