{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WDV7CA4MDNNVSEPYBJIR6TIRFE","short_pith_number":"pith:WDV7CA4M","schema_version":"1.0","canonical_sha256":"b0ebf1038c1b5b5911f80a511f4d112914b2dd2c3f1c76eb0f373e0532799690","source":{"kind":"arxiv","id":"1304.1932","version":1},"attestation_state":"computed","paper":{"title":"Generalized Reduced-Rank Decompositions Using Switching and Adaptive Algorithms for Space-Time Adaptive Processing","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-04-06T19:52:01Z","abstract_excerpt":"This work presents generalized low-rank signal decompositions with the aid of switching techniques and adaptive algorithms, which do not require eigen-decompositions, for space-time adaptive processing. A generalized scheme is proposed to compute low-rank signal decompositions by imposing suitable constraints on the filtering and by performing iterations between the computed subspace and the low-rank filter. An alternating optimization strategy based on recursive least squares algorithms is presented along with switching and iterations to cost-effectively compute the bases of the decomposition"},"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.1932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-06T19:52:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"305918fa4cfcf31c27a617e8f5de0450f225e496dcc1d9f4d18a3c5bd9015c12","abstract_canon_sha256":"e15a961f4a4f60765b86e28e0a8a4281a4d190130c2c06217e746b42bf88c0ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:44.666807Z","signature_b64":"YYIulRzPT2GMT/4l4ImwhXNFz3PZbgnZQaeff6NFYa+UODNPpHdEAy4FWu1z5ZwfhoWNEBLPB0P3srTPuktODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0ebf1038c1b5b5911f80a511f4d112914b2dd2c3f1c76eb0f373e0532799690","last_reissued_at":"2026-05-18T03:28:44.665973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:44.665973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Reduced-Rank Decompositions Using Switching and Adaptive Algorithms for Space-Time Adaptive Processing","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-04-06T19:52:01Z","abstract_excerpt":"This work presents generalized low-rank signal decompositions with the aid of switching techniques and adaptive algorithms, which do not require eigen-decompositions, for space-time adaptive processing. A generalized scheme is proposed to compute low-rank signal decompositions by imposing suitable constraints on the filtering and by performing iterations between the computed subspace and the low-rank filter. An alternating optimization strategy based on recursive least squares algorithms is presented along with switching and iterations to cost-effectively compute the bases of the decomposition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1932","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.1932","created_at":"2026-05-18T03:28:44.666105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1932v1","created_at":"2026-05-18T03:28:44.666105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1932","created_at":"2026-05-18T03:28:44.666105+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDV7CA4MDNNV","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDV7CA4MDNNVSEPY","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDV7CA4M","created_at":"2026-05-18T12:28:04.890932+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/WDV7CA4MDNNVSEPYBJIR6TIRFE","json":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE.json","graph_json":"https://pith.science/api/pith-number/WDV7CA4MDNNVSEPYBJIR6TIRFE/graph.json","events_json":"https://pith.science/api/pith-number/WDV7CA4MDNNVSEPYBJIR6TIRFE/events.json","paper":"https://pith.science/paper/WDV7CA4M"},"agent_actions":{"view_html":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE","download_json":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE.json","view_paper":"https://pith.science/paper/WDV7CA4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1932&json=true","fetch_graph":"https://pith.science/api/pith-number/WDV7CA4MDNNVSEPYBJIR6TIRFE/graph.json","fetch_events":"https://pith.science/api/pith-number/WDV7CA4MDNNVSEPYBJIR6TIRFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/action/storage_attestation","attest_author":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/action/author_attestation","sign_citation":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/action/citation_signature","submit_replication":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/action/replication_record"}},"created_at":"2026-05-18T03:28:44.666105+00:00","updated_at":"2026-05-18T03:28:44.666105+00:00"}