{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:47K4JKIFTQPMGWPZOS3C2AVJAI","short_pith_number":"pith:47K4JKIF","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"},"canonical_sha256":"e7d5c4a9059c1ec359f974b62d02a90205d35f10cdee12dc980e31b1b64c0d62","source":{"kind":"arxiv","id":"1304.3874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3874","created_at":"2026-05-18T03:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3874v1","created_at":"2026-05-18T03:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3874","created_at":"2026-05-18T03:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"47K4JKIFTQPM","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"47K4JKIFTQPMGWPZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"47K4JKIF","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:47K4JKIFTQPMGWPZOS3C2AVJAI","target":"record","payload":{"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"},"canonical_sha256":"e7d5c4a9059c1ec359f974b62d02a90205d35f10cdee12dc980e31b1b64c0d62","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"},"source_kind":"arxiv","source_id":"1304.3874","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:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABj/WmIhfJFQsNKO3s6n8zJ36YSJggjzwniKDHKh1bAT3gfRgk9q0ntCgr3QwaeNUxcuxdQBWvIHPqRKMFy9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:57:00.802905Z"},"content_sha256":"e09d0e7b298bed696ad4323fdf88f0c05c5f9cdea3520744297f10fc1b1ac37a","schema_version":"1.0","event_id":"sha256:e09d0e7b298bed696ad4323fdf88f0c05c5f9cdea3520744297f10fc1b1ac37a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:47K4JKIFTQPMGWPZOS3C2AVJAI","target":"graph","payload":{"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"},"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:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLW3HrIx+1TsgjdMoIsjK9vnml/jUg0NKxDbS6x5u7J6LU79qqooKh7VQmohFRCX7WLqufMYWh8OgkcKDOz+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:57:00.803242Z"},"content_sha256":"4067ca4a322b9f0ec2207bf56798a8d4c3806f4cda3fe354b2ff2293f3c2a150","schema_version":"1.0","event_id":"sha256:4067ca4a322b9f0ec2207bf56798a8d4c3806f4cda3fe354b2ff2293f3c2a150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/bundle.json","state_url":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/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-20T12:57:00Z","links":{"resolver":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI","bundle":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/bundle.json","state":"https://pith.science/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47K4JKIFTQPMGWPZOS3C2AVJAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:47K4JKIFTQPMGWPZOS3C2AVJAI","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":"ee5c8a23ecedbe5a7a5a171bfe5eb965526c48b91ad6486a8693885c77cd7739","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-14T03:06:23Z","title_canon_sha256":"5009a37d780ff4e3d09b00349e42cd9d7be5903b404f28b1ff706c67e07fbf82"},"schema_version":"1.0","source":{"id":"1304.3874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3874","created_at":"2026-05-18T03:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3874v1","created_at":"2026-05-18T03:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3874","created_at":"2026-05-18T03:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"47K4JKIFTQPM","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"47K4JKIFTQPMGWPZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"47K4JKIF","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:4067ca4a322b9f0ec2207bf56798a8d4c3806f4cda3fe354b2ff2293f3c2a150","target":"graph","created_at":"2026-05-18T03:28:03Z","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 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","authors_text":"R. C. de Lamare, Z. Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-14T03:06:23Z","title":"Sparsity-Aware STAP Algorithms Using $L_1$-norm Regularization For Radar Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3874","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:e09d0e7b298bed696ad4323fdf88f0c05c5f9cdea3520744297f10fc1b1ac37a","target":"record","created_at":"2026-05-18T03:28:03Z","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":"ee5c8a23ecedbe5a7a5a171bfe5eb965526c48b91ad6486a8693885c77cd7739","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-14T03:06:23Z","title_canon_sha256":"5009a37d780ff4e3d09b00349e42cd9d7be5903b404f28b1ff706c67e07fbf82"},"schema_version":"1.0","source":{"id":"1304.3874","kind":"arxiv","version":1}},"canonical_sha256":"e7d5c4a9059c1ec359f974b62d02a90205d35f10cdee12dc980e31b1b64c0d62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7d5c4a9059c1ec359f974b62d02a90205d35f10cdee12dc980e31b1b64c0d62","first_computed_at":"2026-05-18T03:28:03.956459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:03.956459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DhTZBQc5H32tSTNcw0+00WAi+7ufnItYaNVnQqhi2ga8+tR2BFc0wIv0bgBqBivQgmOx30Fm5DXgfKOEcxnhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:03.957171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e09d0e7b298bed696ad4323fdf88f0c05c5f9cdea3520744297f10fc1b1ac37a","sha256:4067ca4a322b9f0ec2207bf56798a8d4c3806f4cda3fe354b2ff2293f3c2a150"],"state_sha256":"b6b6546dac1702cc7796d9c66de34219b80166efac7aa3e0e05d4753cab8ae04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vnApI2tGPFVJc63qV6g2Wj9g0inEe+LyyfCtPsc7sz2QHPf/7BT4SdByoi/OaSsEt94XGjo1YHMAAJYmYun7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T12:57:00.805218Z","bundle_sha256":"d243630a45df7a8053d9f2efd7c4c71b15ad1202f02ca9a759efc98539b853dc"}}