{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:A2TO6DU3X7HKF3Y2626NTQ7IDA","short_pith_number":"pith:A2TO6DU3","canonical_record":{"source":{"id":"1305.6336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T22:01:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9fd4a49657ea12bd83ea2931171afef74b12128d0ba8d591bf81cd7f3e565b26","abstract_canon_sha256":"cde13f1926311f9aa1427c1eb23ff697b59f5549c8aa0bf3c90643abe9867df2"},"schema_version":"1.0"},"canonical_sha256":"06a6ef0e9bbfcea2ef1af6bcd9c3e81803674d83cbd47c7ee312e3df5562dd8b","source":{"kind":"arxiv","id":"1305.6336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6336","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6336v1","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6336","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"A2TO6DU3X7HK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A2TO6DU3X7HKF3Y2","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A2TO6DU3","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:A2TO6DU3X7HKF3Y2626NTQ7IDA","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T22:01:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9fd4a49657ea12bd83ea2931171afef74b12128d0ba8d591bf81cd7f3e565b26","abstract_canon_sha256":"cde13f1926311f9aa1427c1eb23ff697b59f5549c8aa0bf3c90643abe9867df2"},"schema_version":"1.0"},"canonical_sha256":"06a6ef0e9bbfcea2ef1af6bcd9c3e81803674d83cbd47c7ee312e3df5562dd8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:40.991366Z","signature_b64":"HEtfKMPkXOwuRaCbhGcW4XHGO0EuaDiuKQjwv34oPWpScBxdNpToRkFrYnsjoTEP11SteOAgBmNGmT2G6R95AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06a6ef0e9bbfcea2ef1af6bcd9c3e81803674d83cbd47c7ee312e3df5562dd8b","last_reissued_at":"2026-05-18T03:24:40.990724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:40.990724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6336","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:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEg7s2vQkjLM42/Q2b9gqmRAZf4joQFEQA/Beb4UEVX8F3DONAxVHSsyxo98TLeI1f9A3MN/HrQ/0N3kCRuWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T08:17:53.280214Z"},"content_sha256":"122c73a75b63533e067c6d27968bda487ef81f69f53d124835698c694396bfae","schema_version":"1.0","event_id":"sha256:122c73a75b63533e067c6d27968bda487ef81f69f53d124835698c694396bfae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:A2TO6DU3X7HKF3Y2626NTQ7IDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Reduced-Rank Processing Using a Projection Operator Based on Joint Iterative Optimization of Adaptive Filters For CDMA Interference Suppression","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":"2013-05-27T22:01:18Z","abstract_excerpt":"This paper proposes a novel adaptive reduced-rank filtering scheme based on the joint iterative optimization of adaptive filters. The proposed scheme consists of a joint iterative optimization of a bank of full-rank adaptive filters that constitutes 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 simple least-mean squares (LMS) adaptive algorithms for its computationally efficient implementation. Simulati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6336","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:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YuQSpUsudKkglTWcACnmBsNyMarcJqS5GAIQgCKRyhELbzQAP0i1+y2LRRkunEo+CFUvqzd0BpwL4/YqyIbrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T08:17:53.281086Z"},"content_sha256":"09d94535b2c2083666b3719aa57d0de9143442069dcf4f6d31454a0d8a2dd606","schema_version":"1.0","event_id":"sha256:09d94535b2c2083666b3719aa57d0de9143442069dcf4f6d31454a0d8a2dd606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2TO6DU3X7HKF3Y2626NTQ7IDA/bundle.json","state_url":"https://pith.science/pith/A2TO6DU3X7HKF3Y2626NTQ7IDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2TO6DU3X7HKF3Y2626NTQ7IDA/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-08T08:17:53Z","links":{"resolver":"https://pith.science/pith/A2TO6DU3X7HKF3Y2626NTQ7IDA","bundle":"https://pith.science/pith/A2TO6DU3X7HKF3Y2626NTQ7IDA/bundle.json","state":"https://pith.science/pith/A2TO6DU3X7HKF3Y2626NTQ7IDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2TO6DU3X7HKF3Y2626NTQ7IDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A2TO6DU3X7HKF3Y2626NTQ7IDA","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":"cde13f1926311f9aa1427c1eb23ff697b59f5549c8aa0bf3c90643abe9867df2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T22:01:18Z","title_canon_sha256":"9fd4a49657ea12bd83ea2931171afef74b12128d0ba8d591bf81cd7f3e565b26"},"schema_version":"1.0","source":{"id":"1305.6336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6336","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6336v1","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6336","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"A2TO6DU3X7HK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A2TO6DU3X7HKF3Y2","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A2TO6DU3","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:09d94535b2c2083666b3719aa57d0de9143442069dcf4f6d31454a0d8a2dd606","target":"graph","created_at":"2026-05-18T03:24:40Z","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 paper proposes a novel adaptive reduced-rank filtering scheme based on the joint iterative optimization of adaptive filters. The proposed scheme consists of a joint iterative optimization of a bank of full-rank adaptive filters that constitutes 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 simple least-mean squares (LMS) adaptive algorithms for its computationally efficient implementation. Simulati","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":"2013-05-27T22:01:18Z","title":"Adaptive Reduced-Rank Processing Using a Projection Operator Based on Joint Iterative Optimization of Adaptive Filters For CDMA Interference Suppression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6336","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:122c73a75b63533e067c6d27968bda487ef81f69f53d124835698c694396bfae","target":"record","created_at":"2026-05-18T03:24:40Z","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":"cde13f1926311f9aa1427c1eb23ff697b59f5549c8aa0bf3c90643abe9867df2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T22:01:18Z","title_canon_sha256":"9fd4a49657ea12bd83ea2931171afef74b12128d0ba8d591bf81cd7f3e565b26"},"schema_version":"1.0","source":{"id":"1305.6336","kind":"arxiv","version":1}},"canonical_sha256":"06a6ef0e9bbfcea2ef1af6bcd9c3e81803674d83cbd47c7ee312e3df5562dd8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06a6ef0e9bbfcea2ef1af6bcd9c3e81803674d83cbd47c7ee312e3df5562dd8b","first_computed_at":"2026-05-18T03:24:40.990724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:40.990724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HEtfKMPkXOwuRaCbhGcW4XHGO0EuaDiuKQjwv34oPWpScBxdNpToRkFrYnsjoTEP11SteOAgBmNGmT2G6R95AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:40.991366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:122c73a75b63533e067c6d27968bda487ef81f69f53d124835698c694396bfae","sha256:09d94535b2c2083666b3719aa57d0de9143442069dcf4f6d31454a0d8a2dd606"],"state_sha256":"351ee7125d33b8c5b5a2f14ee693b6eca06a9ca5b13b5eb32c04854643ff0558"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLjGc4ubqSIF2qmdwXxCyaLbWxK3vo/W/6dCynK7z8LLIXlYrIfmHJbS7r17TScHTtWhbc/F4ahCaorsHw4iAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T08:17:53.285922Z","bundle_sha256":"323d9b398176776ef06925a46f33f467b1545cda761dfb76bad914361f961adb"}}