{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WDV7CA4MDNNVSEPYBJIR6TIRFE","short_pith_number":"pith:WDV7CA4M","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"},"canonical_sha256":"b0ebf1038c1b5b5911f80a511f4d112914b2dd2c3f1c76eb0f373e0532799690","source":{"kind":"arxiv","id":"1304.1932","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1932","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1932v1","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1932","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"WDV7CA4MDNNV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WDV7CA4MDNNVSEPY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WDV7CA4M","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WDV7CA4MDNNVSEPYBJIR6TIRFE","target":"record","payload":{"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"},"canonical_sha256":"b0ebf1038c1b5b5911f80a511f4d112914b2dd2c3f1c76eb0f373e0532799690","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"},"source_kind":"arxiv","source_id":"1304.1932","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:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpDzqTZr4kQWIdB7aeUbK4A+QPEmUFNEfi9Po4XKO2EV4N6fbucq17flRceztBGKYMIXDcJTxF9aSRdWUp8nCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:38:43.700237Z"},"content_sha256":"de2028353ae199e57ddf5726bc91df84458d116da795db066b160e913e18c601","schema_version":"1.0","event_id":"sha256:de2028353ae199e57ddf5726bc91df84458d116da795db066b160e913e18c601"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WDV7CA4MDNNVSEPYBJIR6TIRFE","target":"graph","payload":{"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"},"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:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+0my8UQRxc9a7yg1gUUYfAdfmZOw1hBAE3wfaFO0lEVhGXitifvE9k2SHJHM3PysejoOFsjIZPaTnXRWsm3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:38:43.700618Z"},"content_sha256":"bdd5f67af51833107a597b0874083011fe815df8303e6579912ca4a3131525b2","schema_version":"1.0","event_id":"sha256:bdd5f67af51833107a597b0874083011fe815df8303e6579912ca4a3131525b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/bundle.json","state_url":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/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-05-20T16:38:43Z","links":{"resolver":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE","bundle":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/bundle.json","state":"https://pith.science/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDV7CA4MDNNVSEPYBJIR6TIRFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WDV7CA4MDNNVSEPYBJIR6TIRFE","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":"e15a961f4a4f60765b86e28e0a8a4281a4d190130c2c06217e746b42bf88c0ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-06T19:52:01Z","title_canon_sha256":"305918fa4cfcf31c27a617e8f5de0450f225e496dcc1d9f4d18a3c5bd9015c12"},"schema_version":"1.0","source":{"id":"1304.1932","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1932","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1932v1","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1932","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"WDV7CA4MDNNV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WDV7CA4MDNNVSEPY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WDV7CA4M","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:bdd5f67af51833107a597b0874083011fe815df8303e6579912ca4a3131525b2","target":"graph","created_at":"2026-05-18T03:28:44Z","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 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","authors_text":"R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-06T19:52:01Z","title":"Generalized Reduced-Rank Decompositions Using Switching and Adaptive Algorithms for Space-Time Adaptive Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1932","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:de2028353ae199e57ddf5726bc91df84458d116da795db066b160e913e18c601","target":"record","created_at":"2026-05-18T03:28:44Z","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":"e15a961f4a4f60765b86e28e0a8a4281a4d190130c2c06217e746b42bf88c0ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-06T19:52:01Z","title_canon_sha256":"305918fa4cfcf31c27a617e8f5de0450f225e496dcc1d9f4d18a3c5bd9015c12"},"schema_version":"1.0","source":{"id":"1304.1932","kind":"arxiv","version":1}},"canonical_sha256":"b0ebf1038c1b5b5911f80a511f4d112914b2dd2c3f1c76eb0f373e0532799690","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0ebf1038c1b5b5911f80a511f4d112914b2dd2c3f1c76eb0f373e0532799690","first_computed_at":"2026-05-18T03:28:44.665973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:44.665973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYIulRzPT2GMT/4l4ImwhXNFz3PZbgnZQaeff6NFYa+UODNPpHdEAy4FWu1z5ZwfhoWNEBLPB0P3srTPuktODg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:44.666807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1932","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de2028353ae199e57ddf5726bc91df84458d116da795db066b160e913e18c601","sha256:bdd5f67af51833107a597b0874083011fe815df8303e6579912ca4a3131525b2"],"state_sha256":"01252d29658815ef287c5632a6d88b058e1d5f5fd4b44fb8cc90dccd9d4cff09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebUaaBfsrM69EczDQJez5khnUvziLN5cP4CAz0iCdM4GqfnUXirGuausBjrHC14dJDOeqTGKN/aUQLHnHRc7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:38:43.702738Z","bundle_sha256":"adb4100d614b9e2de7fe60306889fc97b4acbbc82bfe5862938657d57ba0af28"}}