{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZEX6AORA6TB7CSN6ES5MMUFBRF","short_pith_number":"pith:ZEX6AORA","schema_version":"1.0","canonical_sha256":"c92fe03a20f4c3f149be24bac650a1895ab8f4185d4cf7aa8911e18d8792f41f","source":{"kind":"arxiv","id":"1302.2339","version":1},"attestation_state":"computed","paper":{"title":"Robust Low-Rank LCMV Beamforming Algorithms Based on Joint Iterative Optimization Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. C. de Lamare","submitted_at":"2013-02-10T15:35:52Z","abstract_excerpt":"This chapter presents reduced-rank linearly constrained minimum variance (LCMV) algorithms based on the concept of joint iterative optimization of parameters. The proposed reduced-rank scheme is based on a constrained robust joint iterative optimization (RJIO) of parameters according to the minimum variance criterion. The robust optimization procedure adjusts the parameters of a rank-reduction matrix, a reduced-rank beamformer and the diagonal loading in an alternating manner. LCMV expressions are developed for the design of the rank-reduction matrix and the reduced-rank beamformer. Stochastic"},"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":"1302.2339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-10T15:35:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"49c4abe1a96b2c1574f693e0a3ecae67f8e198113d93349ed50d6284220298f9","abstract_canon_sha256":"c1c184d70f1457ad20d1d2d52271818b22bdf3a7c8efdf290d91040254fe0c56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:01.513700Z","signature_b64":"0jrOau8mKk3lZJYaFbStCetTFf6xj96nN5I3H+LKQoIJqq/BfH45x3IZBmaQ4mVnDjJzikUnLqJIFW+DBMUKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c92fe03a20f4c3f149be24bac650a1895ab8f4185d4cf7aa8911e18d8792f41f","last_reissued_at":"2026-05-18T03:34:01.512968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:01.512968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Low-Rank LCMV Beamforming Algorithms Based on Joint Iterative Optimization Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. C. de Lamare","submitted_at":"2013-02-10T15:35:52Z","abstract_excerpt":"This chapter presents reduced-rank linearly constrained minimum variance (LCMV) algorithms based on the concept of joint iterative optimization of parameters. The proposed reduced-rank scheme is based on a constrained robust joint iterative optimization (RJIO) of parameters according to the minimum variance criterion. The robust optimization procedure adjusts the parameters of a rank-reduction matrix, a reduced-rank beamformer and the diagonal loading in an alternating manner. LCMV expressions are developed for the design of the rank-reduction matrix and the reduced-rank beamformer. Stochastic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2339","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":"1302.2339","created_at":"2026-05-18T03:34:01.513079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2339v1","created_at":"2026-05-18T03:34:01.513079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2339","created_at":"2026-05-18T03:34:01.513079+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEX6AORA6TB7","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEX6AORA6TB7CSN6","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEX6AORA","created_at":"2026-05-18T12:28:09.283467+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/ZEX6AORA6TB7CSN6ES5MMUFBRF","json":"https://pith.science/pith/ZEX6AORA6TB7CSN6ES5MMUFBRF.json","graph_json":"https://pith.science/api/pith-number/ZEX6AORA6TB7CSN6ES5MMUFBRF/graph.json","events_json":"https://pith.science/api/pith-number/ZEX6AORA6TB7CSN6ES5MMUFBRF/events.json","paper":"https://pith.science/paper/ZEX6AORA"},"agent_actions":{"view_html":"https://pith.science/pith/ZEX6AORA6TB7CSN6ES5MMUFBRF","download_json":"https://pith.science/pith/ZEX6AORA6TB7CSN6ES5MMUFBRF.json","view_paper":"https://pith.science/paper/ZEX6AORA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2339&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEX6AORA6TB7CSN6ES5MMUFBRF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEX6AORA6TB7CSN6ES5MMUFBRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEX6AORA6TB7CSN6ES5MMUFBRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEX6AORA6TB7CSN6ES5MMUFBRF/action/storage_attestation","attest_author":"https://pith.science/pith/ZEX6AORA6TB7CSN6ES5MMUFBRF/action/author_attestation","sign_citation":"https://pith.science/pith/ZEX6AORA6TB7CSN6ES5MMUFBRF/action/citation_signature","submit_replication":"https://pith.science/pith/ZEX6AORA6TB7CSN6ES5MMUFBRF/action/replication_record"}},"created_at":"2026-05-18T03:34:01.513079+00:00","updated_at":"2026-05-18T03:34:01.513079+00:00"}