{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FI76SEBJKCDKYINWH5MTIGSI6K","short_pith_number":"pith:FI76SEBJ","canonical_record":{"source":{"id":"1908.06369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-18T03:41:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b23f766da648ee2419f684bbe13a4efd91cd67d67da0dd24ce8063bb093b209f","abstract_canon_sha256":"5a5031032060d96cd3113a148f120dd84b9c0a9c2243a52b6c6d7b686c35db29"},"schema_version":"1.0"},"canonical_sha256":"2a3fe910295086ac21b63f59341a48f28c0bcb636659a19eab73170b4bec8718","source":{"kind":"arxiv","id":"1908.06369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06369","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06369v1","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06369","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"FI76SEBJKCDK","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_16","alias_value":"FI76SEBJKCDKYINW","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_8","alias_value":"FI76SEBJ","created_at":"2026-07-04T23:58:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FI76SEBJKCDKYINWH5MTIGSI6K","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-18T03:41:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b23f766da648ee2419f684bbe13a4efd91cd67d67da0dd24ce8063bb093b209f","abstract_canon_sha256":"5a5031032060d96cd3113a148f120dd84b9c0a9c2243a52b6c6d7b686c35db29"},"schema_version":"1.0"},"canonical_sha256":"2a3fe910295086ac21b63f59341a48f28c0bcb636659a19eab73170b4bec8718","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:15.093598Z","signature_b64":"6Cpgi5TuSrU0fE8mgCfrs9TESiXHcg4zp1OhlKOtwf8dW275g0TyKX89OFTR9WCukAzHsCpy8BpZPVbWx3ubBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a3fe910295086ac21b63f59341a48f28c0bcb636659a19eab73170b4bec8718","last_reissued_at":"2026-07-04T23:58:15.093233Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:15.093233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06369","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-07-04T23:58:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GHCHTOeUxmKeUkhuYGQk3zL+a7SOCiQ3i4OPXEiAoQB7yA6vJiii2Ii6GUiAG8wAPOyYifKBqDReov9/mRqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T18:26:33.487292Z"},"content_sha256":"dd32c7cd548e7ba8789a6bc9ebfd96bc08d59b22c4ab4bb11546aeee0a698408","schema_version":"1.0","event_id":"sha256:dd32c7cd548e7ba8789a6bc9ebfd96bc08d59b22c4ab4bb11546aeee0a698408"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FI76SEBJKCDKYINWH5MTIGSI6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust DCD-Based Recursive Adaptive Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"L. Lu, R. C. de Lamare, W. Wang, Y. Yu, Y. Zakharov, Z. Zheng","submitted_at":"2019-08-18T03:41:25Z","abstract_excerpt":"The dichotomous coordinate descent (DCD) algorithm has been successfully used for significant reduction in the complexity of recursive least squares (RLS) algorithms. In this work, we generalize the application of the DCD algorithm to RLS adaptive filtering in impulsive noise scenarios and derive a unified update formula. By employing different robust strategies against impulsive noise, we develop novel computationally efficient DCD-based robust recursive algorithms. Furthermore, to equip the proposed algorithms with the ability to track abrupt changes in unknown systems, a simple variable for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06369","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06369/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:58:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owQG3mJcf+uJqSMOAUoH5IQOdUKH3SS5ArIsLhzNTEtJQu4mssnsklwjNfDaidEn5WZeNxvsdXZBLr8GB+C1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T18:26:33.487805Z"},"content_sha256":"a7230277970cc3abc714e991c284730b7471ae62ee60f53d5d7add73d01b213d","schema_version":"1.0","event_id":"sha256:a7230277970cc3abc714e991c284730b7471ae62ee60f53d5d7add73d01b213d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FI76SEBJKCDKYINWH5MTIGSI6K/bundle.json","state_url":"https://pith.science/pith/FI76SEBJKCDKYINWH5MTIGSI6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FI76SEBJKCDKYINWH5MTIGSI6K/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-08-20T18:26:33Z","links":{"resolver":"https://pith.science/pith/FI76SEBJKCDKYINWH5MTIGSI6K","bundle":"https://pith.science/pith/FI76SEBJKCDKYINWH5MTIGSI6K/bundle.json","state":"https://pith.science/pith/FI76SEBJKCDKYINWH5MTIGSI6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FI76SEBJKCDKYINWH5MTIGSI6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FI76SEBJKCDKYINWH5MTIGSI6K","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":"5a5031032060d96cd3113a148f120dd84b9c0a9c2243a52b6c6d7b686c35db29","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-18T03:41:25Z","title_canon_sha256":"b23f766da648ee2419f684bbe13a4efd91cd67d67da0dd24ce8063bb093b209f"},"schema_version":"1.0","source":{"id":"1908.06369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06369","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06369v1","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06369","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"FI76SEBJKCDK","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_16","alias_value":"FI76SEBJKCDKYINW","created_at":"2026-07-04T23:58:15Z"},{"alias_kind":"pith_short_8","alias_value":"FI76SEBJ","created_at":"2026-07-04T23:58:15Z"}],"graph_snapshots":[{"event_id":"sha256:a7230277970cc3abc714e991c284730b7471ae62ee60f53d5d7add73d01b213d","target":"graph","created_at":"2026-07-04T23:58:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06369/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The dichotomous coordinate descent (DCD) algorithm has been successfully used for significant reduction in the complexity of recursive least squares (RLS) algorithms. In this work, we generalize the application of the DCD algorithm to RLS adaptive filtering in impulsive noise scenarios and derive a unified update formula. By employing different robust strategies against impulsive noise, we develop novel computationally efficient DCD-based robust recursive algorithms. Furthermore, to equip the proposed algorithms with the ability to track abrupt changes in unknown systems, a simple variable for","authors_text":"L. Lu, R. C. de Lamare, W. Wang, Y. Yu, Y. Zakharov, Z. Zheng","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-18T03:41:25Z","title":"Robust DCD-Based Recursive Adaptive Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06369","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:dd32c7cd548e7ba8789a6bc9ebfd96bc08d59b22c4ab4bb11546aeee0a698408","target":"record","created_at":"2026-07-04T23:58:15Z","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":"5a5031032060d96cd3113a148f120dd84b9c0a9c2243a52b6c6d7b686c35db29","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-18T03:41:25Z","title_canon_sha256":"b23f766da648ee2419f684bbe13a4efd91cd67d67da0dd24ce8063bb093b209f"},"schema_version":"1.0","source":{"id":"1908.06369","kind":"arxiv","version":1}},"canonical_sha256":"2a3fe910295086ac21b63f59341a48f28c0bcb636659a19eab73170b4bec8718","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a3fe910295086ac21b63f59341a48f28c0bcb636659a19eab73170b4bec8718","first_computed_at":"2026-07-04T23:58:15.093233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:15.093233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Cpgi5TuSrU0fE8mgCfrs9TESiXHcg4zp1OhlKOtwf8dW275g0TyKX89OFTR9WCukAzHsCpy8BpZPVbWx3ubBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:15.093598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd32c7cd548e7ba8789a6bc9ebfd96bc08d59b22c4ab4bb11546aeee0a698408","sha256:a7230277970cc3abc714e991c284730b7471ae62ee60f53d5d7add73d01b213d"],"state_sha256":"0ed3131be4ce3b63a45d0e6377337ff7793d8136cf6969ec8f2faae34ce5c57a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDcDdIY43SgEraRg/baKHZxdQ6kYDa5sQj7qsRCI+NEnf817HP73E+4FHx8/X3lSoCgriJi8w/CkvCnMi54NAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T18:26:33.492543Z","bundle_sha256":"b6ec6e211bbf7ad3ef89d9030f5c9941fd8b3e83a80e2b372c47c2c8d92d34aa"}}