{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OOVVP3ZXJXL6K233TTO57RFXPW","short_pith_number":"pith:OOVVP3ZX","canonical_record":{"source":{"id":"1205.4390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-20T07:24:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cb4d4c6cc9157f5006ea696fa86126a9cbc8a8ffd025356713e1631bbc4af828","abstract_canon_sha256":"588b6ae76dbcf6405e7d2d52d6cf5c534d4b8d8b1f506f039d6cb901de20e3dc"},"schema_version":"1.0"},"canonical_sha256":"73ab57ef374dd7e56b7b9cdddfc4b77da9b4a6a88a988a98d8f1554ddd697a9b","source":{"kind":"arxiv","id":"1205.4390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4390","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4390v1","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4390","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"pith_short_12","alias_value":"OOVVP3ZXJXL6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OOVVP3ZXJXL6K233","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OOVVP3ZX","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OOVVP3ZXJXL6K233TTO57RFXPW","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-20T07:24:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cb4d4c6cc9157f5006ea696fa86126a9cbc8a8ffd025356713e1631bbc4af828","abstract_canon_sha256":"588b6ae76dbcf6405e7d2d52d6cf5c534d4b8d8b1f506f039d6cb901de20e3dc"},"schema_version":"1.0"},"canonical_sha256":"73ab57ef374dd7e56b7b9cdddfc4b77da9b4a6a88a988a98d8f1554ddd697a9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:13.300353Z","signature_b64":"IGlb8JYsEuRn+kUQspPDawSko/Hf1TQ6o9wbntF6/1XszXuHYD1Q5Wzv1PZA3oBnMYbYQYjkeOcayeX5g7N2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73ab57ef374dd7e56b7b9cdddfc4b77da9b4a6a88a988a98d8f1554ddd697a9b","last_reissued_at":"2026-05-18T03:55:13.299877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:13.299877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4390","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-18T03:55:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Srk3yeDYqApg5e+zJjoMMjVSt8vgleme3FrY9Q82X1d8FWF8PmKFdEAWZGjf6yyXRYqTreAmES07DdTAbIcZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:12:18.554455Z"},"content_sha256":"12e51f9dae88d546d734479be7ae837aacf1a9b9aa609f978f84a14d634eb412","schema_version":"1.0","event_id":"sha256:12e51f9dae88d546d734479be7ae837aacf1a9b9aa609f978f84a14d634eb412"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OOVVP3ZXJXL6K233TTO57RFXPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced-Rank Adaptive Filtering Based on Joint Iterative Optimization of Adaptive Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Raimundo Sampaio-Neto, Rodrigo C. de Lamare","submitted_at":"2012-05-20T07:24:54Z","abstract_excerpt":"This letter proposes a novel adaptive reduced-rank filtering scheme based on joint iterative optimization of adaptive filters. The novel scheme consists of a joint iterative optimization of a bank of full-rank adaptive filters that forms the projection matrix and an adaptive reduced-rank filter that operates at the output of the bank of filters. We describe minimum mean-squared error (MMSE) expressions for the design of the projection matrix and the reduced-rank filter and low-complexity normalized least-mean squares (NLMS) adaptive algorithms for its efficient implementation. Simulations for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4390","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-18T03:55:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ut+/1ngV1RKP5GByVc6VbICd8wl5xUODy54ViPQMqN1sfgmJqNddI/vSAIJFioffezT1tyOuIFe8qCw7VvOxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:12:18.554804Z"},"content_sha256":"d71261c7c9f52b6b1d69fad0f8ebc254acf78d67712c2be869c60206d65627bc","schema_version":"1.0","event_id":"sha256:d71261c7c9f52b6b1d69fad0f8ebc254acf78d67712c2be869c60206d65627bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOVVP3ZXJXL6K233TTO57RFXPW/bundle.json","state_url":"https://pith.science/pith/OOVVP3ZXJXL6K233TTO57RFXPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOVVP3ZXJXL6K233TTO57RFXPW/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-08T12:12:18Z","links":{"resolver":"https://pith.science/pith/OOVVP3ZXJXL6K233TTO57RFXPW","bundle":"https://pith.science/pith/OOVVP3ZXJXL6K233TTO57RFXPW/bundle.json","state":"https://pith.science/pith/OOVVP3ZXJXL6K233TTO57RFXPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOVVP3ZXJXL6K233TTO57RFXPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OOVVP3ZXJXL6K233TTO57RFXPW","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":"588b6ae76dbcf6405e7d2d52d6cf5c534d4b8d8b1f506f039d6cb901de20e3dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-20T07:24:54Z","title_canon_sha256":"cb4d4c6cc9157f5006ea696fa86126a9cbc8a8ffd025356713e1631bbc4af828"},"schema_version":"1.0","source":{"id":"1205.4390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4390","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4390v1","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4390","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"pith_short_12","alias_value":"OOVVP3ZXJXL6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OOVVP3ZXJXL6K233","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OOVVP3ZX","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:d71261c7c9f52b6b1d69fad0f8ebc254acf78d67712c2be869c60206d65627bc","target":"graph","created_at":"2026-05-18T03:55:13Z","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":"This letter proposes a novel adaptive reduced-rank filtering scheme based on joint iterative optimization of adaptive filters. The novel scheme consists of a joint iterative optimization of a bank of full-rank adaptive filters that forms the projection matrix and an adaptive reduced-rank filter that operates at the output of the bank of filters. We describe minimum mean-squared error (MMSE) expressions for the design of the projection matrix and the reduced-rank filter and low-complexity normalized least-mean squares (NLMS) adaptive algorithms for its efficient implementation. Simulations for ","authors_text":"Raimundo Sampaio-Neto, Rodrigo C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-20T07:24:54Z","title":"Reduced-Rank Adaptive Filtering Based on Joint Iterative Optimization of Adaptive Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4390","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:12e51f9dae88d546d734479be7ae837aacf1a9b9aa609f978f84a14d634eb412","target":"record","created_at":"2026-05-18T03:55:13Z","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":"588b6ae76dbcf6405e7d2d52d6cf5c534d4b8d8b1f506f039d6cb901de20e3dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-20T07:24:54Z","title_canon_sha256":"cb4d4c6cc9157f5006ea696fa86126a9cbc8a8ffd025356713e1631bbc4af828"},"schema_version":"1.0","source":{"id":"1205.4390","kind":"arxiv","version":1}},"canonical_sha256":"73ab57ef374dd7e56b7b9cdddfc4b77da9b4a6a88a988a98d8f1554ddd697a9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73ab57ef374dd7e56b7b9cdddfc4b77da9b4a6a88a988a98d8f1554ddd697a9b","first_computed_at":"2026-05-18T03:55:13.299877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:13.299877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IGlb8JYsEuRn+kUQspPDawSko/Hf1TQ6o9wbntF6/1XszXuHYD1Q5Wzv1PZA3oBnMYbYQYjkeOcayeX5g7N2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:13.300353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12e51f9dae88d546d734479be7ae837aacf1a9b9aa609f978f84a14d634eb412","sha256:d71261c7c9f52b6b1d69fad0f8ebc254acf78d67712c2be869c60206d65627bc"],"state_sha256":"9678fa02ad8cc90337715f1377af1fcaf92616f644a6c38cf9f6c866f5697472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VmDdsB+dE5bZLbtM5aA54f1qbiZzsdX399ookecSsKc8nlxNII6mBCCLMPilrAsqDsGlZhMc3VDHJZg+2+EsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:12:18.556694Z","bundle_sha256":"1063385aca98597a55c1c99a0ad7177b51b0d1f5a8a6537a036eb0f751230eb9"}}