{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:47K4JKIFTQPMGWPZOS3C2AVJAI","short_pith_number":"pith:47K4JKIF","schema_version":"1.0","canonical_sha256":"e7d5c4a9059c1ec359f974b62d02a90205d35f10cdee12dc980e31b1b64c0d62","source":{"kind":"arxiv","id":"1304.3874","version":1},"attestation_state":"computed","paper":{"title":"Sparsity-Aware STAP Algorithms Using $L_1$-norm Regularization For Radar Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. C. de Lamare, Z. Yang","submitted_at":"2013-04-14T03:06:23Z","abstract_excerpt":"This article proposes novel sparsity-aware space-time adaptive processing (SA-STAP) algorithms with $l_1$-norm regularization for airborne phased-array radar applications. The proposed SA-STAP algorithms suppose that a number of samples of the full-rank STAP data cube are not meaningful for processing and the optimal full-rank STAP filter weight vector is sparse, or nearly sparse. The core idea of the proposed method is imposing a sparse regularization ($l_1$-norm type) to the minimum variance (MV) STAP cost function. Under some reasonable assumptions, we firstly propose a $l_1$-based sample m"},"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.3874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-14T03:06:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5009a37d780ff4e3d09b00349e42cd9d7be5903b404f28b1ff706c67e07fbf82","abstract_canon_sha256":"ee5c8a23ecedbe5a7a5a171bfe5eb965526c48b91ad6486a8693885c77cd7739"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:03.957171Z","signature_b64":"DhTZBQc5H32tSTNcw0+00WAi+7ufnItYaNVnQqhi2ga8+tR2BFc0wIv0bgBqBivQgmOx30Fm5DXgfKOEcxnhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7d5c4a9059c1ec359f974b62d02a90205d35f10cdee12dc980e31b1b64c0d62","last_reissued_at":"2026-05-18T03:28:03.956459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:03.956459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity-Aware STAP Algorithms Using $L_1$-norm Regularization For Radar Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. C. de Lamare, Z. Yang","submitted_at":"2013-04-14T03:06:23Z","abstract_excerpt":"This article proposes novel sparsity-aware space-time adaptive processing (SA-STAP) algorithms with $l_1$-norm regularization for airborne phased-array radar applications. The proposed SA-STAP algorithms suppose that a number of samples of the full-rank STAP data cube are not meaningful for processing and the optimal full-rank STAP filter weight vector is sparse, or nearly sparse. The core idea of the proposed method is imposing a sparse regularization ($l_1$-norm type) to the minimum variance (MV) STAP cost function. Under some reasonable assumptions, we firstly propose a $l_1$-based sample m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3874","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.3874","created_at":"2026-05-18T03:28:03.956561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3874v1","created_at":"2026-05-18T03:28:03.956561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3874","created_at":"2026-05-18T03:28:03.956561+00:00"},{"alias_kind":"pith_short_12","alias_value":"47K4JKIFTQPM","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"47K4JKIFTQPMGWPZ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"47K4JKIF","created_at":"2026-05-18T12:27:32.513160+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/47K4JKIFTQPMGWPZOS3C2AVJAI","json":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI.json","graph_json":"https://pith.science/api/pith-number/47K4JKIFTQPMGWPZOS3C2AVJAI/graph.json","events_json":"https://pith.science/api/pith-number/47K4JKIFTQPMGWPZOS3C2AVJAI/events.json","paper":"https://pith.science/paper/47K4JKIF"},"agent_actions":{"view_html":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI","download_json":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI.json","view_paper":"https://pith.science/paper/47K4JKIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3874&json=true","fetch_graph":"https://pith.science/api/pith-number/47K4JKIFTQPMGWPZOS3C2AVJAI/graph.json","fetch_events":"https://pith.science/api/pith-number/47K4JKIFTQPMGWPZOS3C2AVJAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/action/storage_attestation","attest_author":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/action/author_attestation","sign_citation":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/action/citation_signature","submit_replication":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/action/replication_record"}},"created_at":"2026-05-18T03:28:03.956561+00:00","updated_at":"2026-05-18T03:28:03.956561+00:00"}