{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y2ZHYOYFJ6F6K75JS62IW7T6M3","short_pith_number":"pith:Y2ZHYOYF","canonical_record":{"source":{"id":"1802.03070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-08T23:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bf93c534861713da4c108df5d26a655e41dc0a5b562c5b197a1634873a2e62d","abstract_canon_sha256":"37bde8d0d4746ec73494dd4d2342c3c17dce079d1136565e49fcedddb4e8a301"},"schema_version":"1.0"},"canonical_sha256":"c6b27c3b054f8be57fa997b48b7e7e66d5a002bf1129fafe91a66d747c67deaa","source":{"kind":"arxiv","id":"1802.03070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03070","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03070v1","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03070","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y2ZHYOYFJ6F6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2ZHYOYFJ6F6K75J","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2ZHYOYF","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y2ZHYOYFJ6F6K75JS62IW7T6M3","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-08T23:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bf93c534861713da4c108df5d26a655e41dc0a5b562c5b197a1634873a2e62d","abstract_canon_sha256":"37bde8d0d4746ec73494dd4d2342c3c17dce079d1136565e49fcedddb4e8a301"},"schema_version":"1.0"},"canonical_sha256":"c6b27c3b054f8be57fa997b48b7e7e66d5a002bf1129fafe91a66d747c67deaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.115519Z","signature_b64":"4ZfnTbM1YwKL+H0Xmyu/Ewt4DkbI15pWnodbQKDjXON3OcSt/ToiObruyWTH07zOza4pQJzIoGoXTj1iKEGaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6b27c3b054f8be57fa997b48b7e7e66d5a002bf1129fafe91a66d747c67deaa","last_reissued_at":"2026-05-18T00:24:02.114951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.114951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03070","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-18T00:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BaclRZwEiCmzNSla8KV30gIamgTW/H8UY8Y6oeSUYsCxKfSHSMqgnFoBYk1ZZGjy+l+pQkCw/1PcSheYp8arCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:10:56.069347Z"},"content_sha256":"5c71801271d4ae541a2db5408b0e9fbac3f1c12b3d3aa1a6f8b5336124dc281b","schema_version":"1.0","event_id":"sha256:5c71801271d4ae541a2db5408b0e9fbac3f1c12b3d3aa1a6f8b5336124dc281b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y2ZHYOYFJ6F6K75JS62IW7T6M3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Sparse Asymptotic Minimum Variance Based Approaches for Array Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Habti Abeida, Jian Li, Nadjim Merabtine, Qilin Zhang","submitted_at":"2018-02-08T23:03:53Z","abstract_excerpt":"This paper presents a series of user parameter-free iterative Sparse Asymptotic Minimum Variance (SAMV) approaches for array processing applications based on the asymptotically minimum variance (AMV) criterion. With the assumption of abundant snapshots in the direction-of-arrival (DOA) estimation problem, the signal powers and noise variance are jointly estimated by the proposed iterative AMV approach, which is later proved to coincide with the Maximum Likelihood (ML) estimator. We then propose a series of power-based iterative SAMV approaches, which are robust against insufficient snapshots, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03070","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-18T00:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUzQ9ReqfZX6dko/b+YRdU5b/Ms0QvS80q8aNi2GFzwmoC9XnaOYfbEzP7Pjf2cu12DnD4elBjuue7uTr8phCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:10:56.069695Z"},"content_sha256":"92213db9229c1adab879b13b032348bdd95329c4f90e35635031faa0c649994b","schema_version":"1.0","event_id":"sha256:92213db9229c1adab879b13b032348bdd95329c4f90e35635031faa0c649994b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2ZHYOYFJ6F6K75JS62IW7T6M3/bundle.json","state_url":"https://pith.science/pith/Y2ZHYOYFJ6F6K75JS62IW7T6M3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2ZHYOYFJ6F6K75JS62IW7T6M3/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-06-04T20:10:56Z","links":{"resolver":"https://pith.science/pith/Y2ZHYOYFJ6F6K75JS62IW7T6M3","bundle":"https://pith.science/pith/Y2ZHYOYFJ6F6K75JS62IW7T6M3/bundle.json","state":"https://pith.science/pith/Y2ZHYOYFJ6F6K75JS62IW7T6M3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2ZHYOYFJ6F6K75JS62IW7T6M3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y2ZHYOYFJ6F6K75JS62IW7T6M3","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":"37bde8d0d4746ec73494dd4d2342c3c17dce079d1136565e49fcedddb4e8a301","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-08T23:03:53Z","title_canon_sha256":"0bf93c534861713da4c108df5d26a655e41dc0a5b562c5b197a1634873a2e62d"},"schema_version":"1.0","source":{"id":"1802.03070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03070","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03070v1","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03070","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y2ZHYOYFJ6F6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2ZHYOYFJ6F6K75J","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2ZHYOYF","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:92213db9229c1adab879b13b032348bdd95329c4f90e35635031faa0c649994b","target":"graph","created_at":"2026-05-18T00:24:02Z","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 paper presents a series of user parameter-free iterative Sparse Asymptotic Minimum Variance (SAMV) approaches for array processing applications based on the asymptotically minimum variance (AMV) criterion. With the assumption of abundant snapshots in the direction-of-arrival (DOA) estimation problem, the signal powers and noise variance are jointly estimated by the proposed iterative AMV approach, which is later proved to coincide with the Maximum Likelihood (ML) estimator. We then propose a series of power-based iterative SAMV approaches, which are robust against insufficient snapshots, ","authors_text":"Habti Abeida, Jian Li, Nadjim Merabtine, Qilin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-08T23:03:53Z","title":"Iterative Sparse Asymptotic Minimum Variance Based Approaches for Array Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03070","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:5c71801271d4ae541a2db5408b0e9fbac3f1c12b3d3aa1a6f8b5336124dc281b","target":"record","created_at":"2026-05-18T00:24:02Z","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":"37bde8d0d4746ec73494dd4d2342c3c17dce079d1136565e49fcedddb4e8a301","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-08T23:03:53Z","title_canon_sha256":"0bf93c534861713da4c108df5d26a655e41dc0a5b562c5b197a1634873a2e62d"},"schema_version":"1.0","source":{"id":"1802.03070","kind":"arxiv","version":1}},"canonical_sha256":"c6b27c3b054f8be57fa997b48b7e7e66d5a002bf1129fafe91a66d747c67deaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6b27c3b054f8be57fa997b48b7e7e66d5a002bf1129fafe91a66d747c67deaa","first_computed_at":"2026-05-18T00:24:02.114951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:02.114951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ZfnTbM1YwKL+H0Xmyu/Ewt4DkbI15pWnodbQKDjXON3OcSt/ToiObruyWTH07zOza4pQJzIoGoXTj1iKEGaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:02.115519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c71801271d4ae541a2db5408b0e9fbac3f1c12b3d3aa1a6f8b5336124dc281b","sha256:92213db9229c1adab879b13b032348bdd95329c4f90e35635031faa0c649994b"],"state_sha256":"8ed19cfaa5ad143a356319d109e97a1eee994816bc93718b692960bf2c89ce97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8o/poH0nybaAG/L2UXzGzQNfQrb84nr9HR5hf2vwk66oc6bULtnBPHEO0aw34d9SVdGLv6w3NNYOlaPjvvzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:10:56.071631Z","bundle_sha256":"e3b1cadb514d864762593b76517e0bfd47ade0d4ba654fb5667b6e8dc45feadf"}}