{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JRTHHRH4FOUNNK4O7ZJ3DWHNMD","short_pith_number":"pith:JRTHHRH4","canonical_record":{"source":{"id":"1707.04236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T17:37:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a0a29ece3143462b8a482f683056690ecfac5a29ea21505c8fa4295462c41cbc","abstract_canon_sha256":"909c73951bed0c05d06af51474484797d54d2224af7b099124efc292f2db1c11"},"schema_version":"1.0"},"canonical_sha256":"4c6673c4fc2ba8d6ab8efe53b1d8ed60c401587306a65d048ac69a8adacfefe4","source":{"kind":"arxiv","id":"1707.04236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04236","created_at":"2026-05-18T00:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04236v1","created_at":"2026-05-18T00:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04236","created_at":"2026-05-18T00:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"JRTHHRH4FOUN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JRTHHRH4FOUNNK4O","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JRTHHRH4","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JRTHHRH4FOUNNK4O7ZJ3DWHNMD","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T17:37:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a0a29ece3143462b8a482f683056690ecfac5a29ea21505c8fa4295462c41cbc","abstract_canon_sha256":"909c73951bed0c05d06af51474484797d54d2224af7b099124efc292f2db1c11"},"schema_version":"1.0"},"canonical_sha256":"4c6673c4fc2ba8d6ab8efe53b1d8ed60c401587306a65d048ac69a8adacfefe4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:20.170803Z","signature_b64":"e8cLom8IwMCLezcTPIUJMPgFOO4T6JiQQ5yQBgTfcUGEu+tSwiK6P6l9Ae+kb4YK9SDiAvIJaLSEypyFW9MiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c6673c4fc2ba8d6ab8efe53b1d8ed60c401587306a65d048ac69a8adacfefe4","last_reissued_at":"2026-05-18T00:40:20.170166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:20.170166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04236","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:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVGH7d/j3LZBk6FftySHv8da4zjWaIGAxi3oXel36/9zb40GSRPjuAkU6hqGpYXxOp2aY2rGIy7P7C3gJm+dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:28:03.033006Z"},"content_sha256":"155d117a2f1acc2288d409fbcaa262dd7863eda75ba378b36f99279e43b5f1c4","schema_version":"1.0","event_id":"sha256:155d117a2f1acc2288d409fbcaa262dd7863eda75ba378b36f99279e43b5f1c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JRTHHRH4FOUNNK4O7ZJ3DWHNMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Sparsity in Kernel Adaptive Filters Using a Unit-Norm Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Felipe Tobar","submitted_at":"2017-07-13T17:37:46Z","abstract_excerpt":"Kernel adaptive filters, a class of adaptive nonlinear time-series models, are known by their ability to learn expressive autoregressive patterns from sequential data. However, for trivial monotonic signals, they struggle to perform accurate predictions and at the same time keep computational complexity within desired boundaries. This is because new observations are incorporated to the dictionary when they are far from what the algorithm has seen in the past. We propose a novel approach to kernel adaptive filtering that compares new observations against dictionary samples in terms of their uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04236","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:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ipD9tbruUnnVwipG97bkn6KLXYqrLUK2jihqLE+Ev/Pbj1Yst/COXR/uDE7ueC1sr4pb2YCGmNrXYzdmk+6+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:28:03.033351Z"},"content_sha256":"ce23022643babb1c78968352d91ce13a5799c500cb1e578da2706af9c1d08080","schema_version":"1.0","event_id":"sha256:ce23022643babb1c78968352d91ce13a5799c500cb1e578da2706af9c1d08080"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRTHHRH4FOUNNK4O7ZJ3DWHNMD/bundle.json","state_url":"https://pith.science/pith/JRTHHRH4FOUNNK4O7ZJ3DWHNMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRTHHRH4FOUNNK4O7ZJ3DWHNMD/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-06-29T13:28:03Z","links":{"resolver":"https://pith.science/pith/JRTHHRH4FOUNNK4O7ZJ3DWHNMD","bundle":"https://pith.science/pith/JRTHHRH4FOUNNK4O7ZJ3DWHNMD/bundle.json","state":"https://pith.science/pith/JRTHHRH4FOUNNK4O7ZJ3DWHNMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRTHHRH4FOUNNK4O7ZJ3DWHNMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JRTHHRH4FOUNNK4O7ZJ3DWHNMD","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":"909c73951bed0c05d06af51474484797d54d2224af7b099124efc292f2db1c11","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T17:37:46Z","title_canon_sha256":"a0a29ece3143462b8a482f683056690ecfac5a29ea21505c8fa4295462c41cbc"},"schema_version":"1.0","source":{"id":"1707.04236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04236","created_at":"2026-05-18T00:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04236v1","created_at":"2026-05-18T00:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04236","created_at":"2026-05-18T00:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"JRTHHRH4FOUN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JRTHHRH4FOUNNK4O","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JRTHHRH4","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:ce23022643babb1c78968352d91ce13a5799c500cb1e578da2706af9c1d08080","target":"graph","created_at":"2026-05-18T00:40:20Z","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":"Kernel adaptive filters, a class of adaptive nonlinear time-series models, are known by their ability to learn expressive autoregressive patterns from sequential data. However, for trivial monotonic signals, they struggle to perform accurate predictions and at the same time keep computational complexity within desired boundaries. This is because new observations are incorporated to the dictionary when they are far from what the algorithm has seen in the past. We propose a novel approach to kernel adaptive filtering that compares new observations against dictionary samples in terms of their uni","authors_text":"Felipe Tobar","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T17:37:46Z","title":"Improving Sparsity in Kernel Adaptive Filters Using a Unit-Norm Dictionary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04236","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:155d117a2f1acc2288d409fbcaa262dd7863eda75ba378b36f99279e43b5f1c4","target":"record","created_at":"2026-05-18T00:40:20Z","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":"909c73951bed0c05d06af51474484797d54d2224af7b099124efc292f2db1c11","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T17:37:46Z","title_canon_sha256":"a0a29ece3143462b8a482f683056690ecfac5a29ea21505c8fa4295462c41cbc"},"schema_version":"1.0","source":{"id":"1707.04236","kind":"arxiv","version":1}},"canonical_sha256":"4c6673c4fc2ba8d6ab8efe53b1d8ed60c401587306a65d048ac69a8adacfefe4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c6673c4fc2ba8d6ab8efe53b1d8ed60c401587306a65d048ac69a8adacfefe4","first_computed_at":"2026-05-18T00:40:20.170166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:20.170166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e8cLom8IwMCLezcTPIUJMPgFOO4T6JiQQ5yQBgTfcUGEu+tSwiK6P6l9Ae+kb4YK9SDiAvIJaLSEypyFW9MiCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:20.170803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:155d117a2f1acc2288d409fbcaa262dd7863eda75ba378b36f99279e43b5f1c4","sha256:ce23022643babb1c78968352d91ce13a5799c500cb1e578da2706af9c1d08080"],"state_sha256":"7b7be99c3dbdd03eea7170ce0d4b4b03cae6f807e787da87ba359af344d41415"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ipr7CP22eNg8H0VeCvnVtydD2mOmhx6nWCXBRjMybMi/Q6/59n1d7kBt7apfQr260j/OcmsL464FVNWMTXuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:28:03.035164Z","bundle_sha256":"b7f19d249c7f2dd48284f502ad1970124018961b5aedf78154a75eeda4e298ad"}}