{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UK2PRRDYGQKGNR7Y3ANHFVTIDX","short_pith_number":"pith:UK2PRRDY","canonical_record":{"source":{"id":"1708.08142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-27T21:41:48Z","cross_cats_sorted":[],"title_canon_sha256":"235efb9559c0438726d5621f9f8aa4cc98850884197e0ba4d8fdbff53899a841","abstract_canon_sha256":"8ad4dcf4dbe13d7f0c3c1408ed3e62413de271563d494c49d53b73e2ba3e263f"},"schema_version":"1.0"},"canonical_sha256":"a2b4f8c478341466c7f8d81a72d6681dee26031472a6d18efe7f48c13bd6eb5d","source":{"kind":"arxiv","id":"1708.08142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08142","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08142v1","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08142","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"UK2PRRDYGQKG","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UK2PRRDYGQKGNR7Y","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UK2PRRDY","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UK2PRRDYGQKGNR7Y3ANHFVTIDX","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-27T21:41:48Z","cross_cats_sorted":[],"title_canon_sha256":"235efb9559c0438726d5621f9f8aa4cc98850884197e0ba4d8fdbff53899a841","abstract_canon_sha256":"8ad4dcf4dbe13d7f0c3c1408ed3e62413de271563d494c49d53b73e2ba3e263f"},"schema_version":"1.0"},"canonical_sha256":"a2b4f8c478341466c7f8d81a72d6681dee26031472a6d18efe7f48c13bd6eb5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:36.848267Z","signature_b64":"vL0SZBfMaOwoLkmGW8ztHKSC1ClJwbGXgzjLVFAZ7ozHZc6Yp71sLZ2LXjr5ho8bGFnzpIPw9E72GA+Ds0SKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b4f8c478341466c7f8d81a72d6681dee26031472a6d18efe7f48c13bd6eb5d","last_reissued_at":"2026-05-18T00:36:36.847628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:36.847628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08142","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:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZT+PGfpYAhXDP//zVkjVXe+Qcbsl8YVAS3Av2RBus1CBM8wgWK2vpoRgbf9mc4G0Eo/hD7NVUxa3X+nN3FKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:52:34.684451Z"},"content_sha256":"9cf75f9fb46c36678f2e247e6c50130696f0dcd242b1c1a55a0f73e8e381e1e6","schema_version":"1.0","event_id":"sha256:9cf75f9fb46c36678f2e247e6c50130696f0dcd242b1c1a55a0f73e8e381e1e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UK2PRRDYGQKGNR7Y3ANHFVTIDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study of Set-Membership Kernel Adaptive Algorithms and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andr\\'e Flores, R. C. de Lamare","submitted_at":"2017-08-27T21:41:48Z","abstract_excerpt":"Adaptive algorithms based on kernel structures have been a topic of significant research over the past few years. The main advantage is that they form a family of universal approximators, offering an elegant solution to problems with nonlinearities. Nevertheless these methods deal with kernel expansions, creating a growing structure also known as dictionary, whose size depends on the number of new inputs. In this paper we derive the set-membership kernel-based normalized least-mean square (SM-NKLMS) algorithm, which is capable of limiting the size of the dictionary created in stationary enviro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08142","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:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbC+cW+PieUpIyYlYAzCQrmtgIL17Nt5AD298NL8bbW3KVsSUdQvumWp0mkN2/adIt4LKrxzpDMTP4s1fXLDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:52:34.685136Z"},"content_sha256":"837f961512128803df0362c34e52d7e2d84b46fe41f79bd7993f246b08f7fe66","schema_version":"1.0","event_id":"sha256:837f961512128803df0362c34e52d7e2d84b46fe41f79bd7993f246b08f7fe66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UK2PRRDYGQKGNR7Y3ANHFVTIDX/bundle.json","state_url":"https://pith.science/pith/UK2PRRDYGQKGNR7Y3ANHFVTIDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UK2PRRDYGQKGNR7Y3ANHFVTIDX/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-31T14:52:34Z","links":{"resolver":"https://pith.science/pith/UK2PRRDYGQKGNR7Y3ANHFVTIDX","bundle":"https://pith.science/pith/UK2PRRDYGQKGNR7Y3ANHFVTIDX/bundle.json","state":"https://pith.science/pith/UK2PRRDYGQKGNR7Y3ANHFVTIDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UK2PRRDYGQKGNR7Y3ANHFVTIDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UK2PRRDYGQKGNR7Y3ANHFVTIDX","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":"8ad4dcf4dbe13d7f0c3c1408ed3e62413de271563d494c49d53b73e2ba3e263f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-27T21:41:48Z","title_canon_sha256":"235efb9559c0438726d5621f9f8aa4cc98850884197e0ba4d8fdbff53899a841"},"schema_version":"1.0","source":{"id":"1708.08142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08142","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08142v1","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08142","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"UK2PRRDYGQKG","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UK2PRRDYGQKGNR7Y","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UK2PRRDY","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:837f961512128803df0362c34e52d7e2d84b46fe41f79bd7993f246b08f7fe66","target":"graph","created_at":"2026-05-18T00:36:36Z","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":"Adaptive algorithms based on kernel structures have been a topic of significant research over the past few years. The main advantage is that they form a family of universal approximators, offering an elegant solution to problems with nonlinearities. Nevertheless these methods deal with kernel expansions, creating a growing structure also known as dictionary, whose size depends on the number of new inputs. In this paper we derive the set-membership kernel-based normalized least-mean square (SM-NKLMS) algorithm, which is capable of limiting the size of the dictionary created in stationary enviro","authors_text":"Andr\\'e Flores, R. C. de Lamare","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-27T21:41:48Z","title":"Study of Set-Membership Kernel Adaptive Algorithms and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08142","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:9cf75f9fb46c36678f2e247e6c50130696f0dcd242b1c1a55a0f73e8e381e1e6","target":"record","created_at":"2026-05-18T00:36:36Z","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":"8ad4dcf4dbe13d7f0c3c1408ed3e62413de271563d494c49d53b73e2ba3e263f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-27T21:41:48Z","title_canon_sha256":"235efb9559c0438726d5621f9f8aa4cc98850884197e0ba4d8fdbff53899a841"},"schema_version":"1.0","source":{"id":"1708.08142","kind":"arxiv","version":1}},"canonical_sha256":"a2b4f8c478341466c7f8d81a72d6681dee26031472a6d18efe7f48c13bd6eb5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2b4f8c478341466c7f8d81a72d6681dee26031472a6d18efe7f48c13bd6eb5d","first_computed_at":"2026-05-18T00:36:36.847628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:36.847628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vL0SZBfMaOwoLkmGW8ztHKSC1ClJwbGXgzjLVFAZ7ozHZc6Yp71sLZ2LXjr5ho8bGFnzpIPw9E72GA+Ds0SKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:36.848267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cf75f9fb46c36678f2e247e6c50130696f0dcd242b1c1a55a0f73e8e381e1e6","sha256:837f961512128803df0362c34e52d7e2d84b46fe41f79bd7993f246b08f7fe66"],"state_sha256":"dbb1930e5f13ec5f6d4a2b1e4fea1f419fc702a755d573efb7203de6b04bbac6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4+XL8s0jirO8Gb6ct39GrjSmrIsn6jmHIG/7zBYfw2m2sRuoJn0cPlx7w+xUj8dRd2g/DWJSLiWWhyBZESeAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:52:34.689477Z","bundle_sha256":"46a598b1896eff772d715a7f6558e8643ee3615a20d66b777afaf9c188cef24c"}}