{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JDM6PNOHOEIEDNOSOWYM2AZZX3","short_pith_number":"pith:JDM6PNOH","schema_version":"1.0","canonical_sha256":"48d9e7b5c7711041b5d275b0cd0339bef0f0c27defc530663fb7838cf8fd7e86","source":{"kind":"arxiv","id":"1304.7548","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Reduced-Rank RLS Algorithms based on Joint Iterative Optimization of Filters for Space-Time 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-04-29T01:41:53Z","abstract_excerpt":"This paper presents novel adaptive reduced-rank filtering algorithms 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 constitute the projection matrix and an adaptive reduced-rank filter that operates at the output of the bank of filters. We describe least squares (LS) expressions for the design of the projection matrix and the reduced-rank filter and recursive least squares (RLS) adaptive algorithms for its computationally efficient implementation. Simulations for a space-time in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1304.7548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-29T01:41:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b61dd03eed8f1040174bae514310bd6fd200c1898f7d0d5206e9e7bc4ad08f83","abstract_canon_sha256":"4d3b439fdf3a578eed878f553f644f3e11b2e1812c04f0f24452b6f6fdaaf8b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:53.692596Z","signature_b64":"8WVVPQv/NN6w8DkZ4s3kDYrckiWSOzvBpHmy1LxKmNZvI7Ts5B59ch2VpNaNShRErdEDn4jCgyNcANkkIoQGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48d9e7b5c7711041b5d275b0cd0339bef0f0c27defc530663fb7838cf8fd7e86","last_reissued_at":"2026-05-18T03:26:53.692047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:53.692047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Reduced-Rank RLS Algorithms based on Joint Iterative Optimization of Filters for Space-Time 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-04-29T01:41:53Z","abstract_excerpt":"This paper presents novel adaptive reduced-rank filtering algorithms 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 constitute the projection matrix and an adaptive reduced-rank filter that operates at the output of the bank of filters. We describe least squares (LS) expressions for the design of the projection matrix and the reduced-rank filter and recursive least squares (RLS) adaptive algorithms for its computationally efficient implementation. Simulations for a space-time in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7548","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.7548","created_at":"2026-05-18T03:26:53.692129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7548v1","created_at":"2026-05-18T03:26:53.692129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7548","created_at":"2026-05-18T03:26:53.692129+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDM6PNOHOEIE","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDM6PNOHOEIEDNOS","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDM6PNOH","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3","json":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3.json","graph_json":"https://pith.science/api/pith-number/JDM6PNOHOEIEDNOSOWYM2AZZX3/graph.json","events_json":"https://pith.science/api/pith-number/JDM6PNOHOEIEDNOSOWYM2AZZX3/events.json","paper":"https://pith.science/paper/JDM6PNOH"},"agent_actions":{"view_html":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3","download_json":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3.json","view_paper":"https://pith.science/paper/JDM6PNOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7548&json=true","fetch_graph":"https://pith.science/api/pith-number/JDM6PNOHOEIEDNOSOWYM2AZZX3/graph.json","fetch_events":"https://pith.science/api/pith-number/JDM6PNOHOEIEDNOSOWYM2AZZX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/action/storage_attestation","attest_author":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/action/author_attestation","sign_citation":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/action/citation_signature","submit_replication":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/action/replication_record"}},"created_at":"2026-05-18T03:26:53.692129+00:00","updated_at":"2026-05-18T03:26:53.692129+00:00"}