{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K43HTNPKGP5IJ3ZUGSGP5OIYGY","short_pith_number":"pith:K43HTNPK","canonical_record":{"source":{"id":"1606.01313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-06-04T00:44:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6166635e48ef13fbe46afc8d6bc0de0ee7f4e3b930ed8043b76aeeb67e9ce9cd","abstract_canon_sha256":"4e9c0da69e36c3f73907ede24dcc9e332e72430cd0ab98fa7f3e8a6b677e46b3"},"schema_version":"1.0"},"canonical_sha256":"573679b5ea33fa84ef34348cfeb918362e0162e51c6d25171c9ddf98287d5bb3","source":{"kind":"arxiv","id":"1606.01313","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01313","created_at":"2026-05-18T01:08:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01313v1","created_at":"2026-05-18T01:08:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01313","created_at":"2026-05-18T01:08:09Z"},{"alias_kind":"pith_short_12","alias_value":"K43HTNPKGP5I","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K43HTNPKGP5IJ3ZU","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K43HTNPK","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K43HTNPKGP5IJ3ZUGSGP5OIYGY","target":"record","payload":{"canonical_record":{"source":{"id":"1606.01313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-06-04T00:44:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6166635e48ef13fbe46afc8d6bc0de0ee7f4e3b930ed8043b76aeeb67e9ce9cd","abstract_canon_sha256":"4e9c0da69e36c3f73907ede24dcc9e332e72430cd0ab98fa7f3e8a6b677e46b3"},"schema_version":"1.0"},"canonical_sha256":"573679b5ea33fa84ef34348cfeb918362e0162e51c6d25171c9ddf98287d5bb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:09.060248Z","signature_b64":"G38T8M1laN0ZCrydmFaYRv8L49noEH2gNJz5VuEh5oDnLlzH08mhZPxKtVwMMoHoDhZaeBePtRlSlr9G/Do2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"573679b5ea33fa84ef34348cfeb918362e0162e51c6d25171c9ddf98287d5bb3","last_reissued_at":"2026-05-18T01:08:09.059715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:09.059715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.01313","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-18T01:08:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YK90J7zeZ1rySSZXbhQyt8HwcTlTi4W9o9iSX5LCOb7LA8SPDko+7MJNYM4ZiMd2bFoHaKlK17m7IHLz2FVfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T10:49:20.297787Z"},"content_sha256":"c590208b6bd9e31c11d0f3fbecd021571e3b9ca6384a3ddabf9f0952385c5d49","schema_version":"1.0","event_id":"sha256:c590208b6bd9e31c11d0f3fbecd021571e3b9ca6384a3ddabf9f0952385c5d49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K43HTNPKGP5IJ3ZUGSGP5OIYGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CE","authors_text":"H. Ruan, R. C. de Lamare","submitted_at":"2016-06-04T00:44:35Z","abstract_excerpt":"This work presents cost-effective low-rank techniques for designing robust adaptive beamforming (RAB) algorithms. The proposed algorithms are based on the exploitation of the cross-correlation between the array observation data and the output of the beamformer. Firstly, we construct a general linear equation considered in large dimensions whose solution yields the steering vector mismatch. Then, we employ the idea of the full orthogonalization method (FOM), an orthogonal Krylov subspace based method, to iteratively estimate the steering vector mismatch in a reduced-dimensional subspace, result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01313","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-18T01:08:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXEIfE48/l69KQo+KWAcPuH/2p5bURgxoZtmooitBMZ51gW3AlxBfl0cCnzL0d1mnQQPmQ3KDPCFbaOEShQdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T10:49:20.298125Z"},"content_sha256":"8260b77cec091627f56cc19818d5fdb4fdaf5d26cef7328a12da9f8d40dd2fe8","schema_version":"1.0","event_id":"sha256:8260b77cec091627f56cc19818d5fdb4fdaf5d26cef7328a12da9f8d40dd2fe8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K43HTNPKGP5IJ3ZUGSGP5OIYGY/bundle.json","state_url":"https://pith.science/pith/K43HTNPKGP5IJ3ZUGSGP5OIYGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K43HTNPKGP5IJ3ZUGSGP5OIYGY/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-20T10:49:20Z","links":{"resolver":"https://pith.science/pith/K43HTNPKGP5IJ3ZUGSGP5OIYGY","bundle":"https://pith.science/pith/K43HTNPKGP5IJ3ZUGSGP5OIYGY/bundle.json","state":"https://pith.science/pith/K43HTNPKGP5IJ3ZUGSGP5OIYGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K43HTNPKGP5IJ3ZUGSGP5OIYGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K43HTNPKGP5IJ3ZUGSGP5OIYGY","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":"4e9c0da69e36c3f73907ede24dcc9e332e72430cd0ab98fa7f3e8a6b677e46b3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-06-04T00:44:35Z","title_canon_sha256":"6166635e48ef13fbe46afc8d6bc0de0ee7f4e3b930ed8043b76aeeb67e9ce9cd"},"schema_version":"1.0","source":{"id":"1606.01313","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01313","created_at":"2026-05-18T01:08:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01313v1","created_at":"2026-05-18T01:08:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01313","created_at":"2026-05-18T01:08:09Z"},{"alias_kind":"pith_short_12","alias_value":"K43HTNPKGP5I","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K43HTNPKGP5IJ3ZU","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K43HTNPK","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:8260b77cec091627f56cc19818d5fdb4fdaf5d26cef7328a12da9f8d40dd2fe8","target":"graph","created_at":"2026-05-18T01:08:09Z","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 cost-effective low-rank techniques for designing robust adaptive beamforming (RAB) algorithms. The proposed algorithms are based on the exploitation of the cross-correlation between the array observation data and the output of the beamformer. Firstly, we construct a general linear equation considered in large dimensions whose solution yields the steering vector mismatch. Then, we employ the idea of the full orthogonalization method (FOM), an orthogonal Krylov subspace based method, to iteratively estimate the steering vector mismatch in a reduced-dimensional subspace, result","authors_text":"H. Ruan, R. C. de Lamare","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-06-04T00:44:35Z","title":"Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01313","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:c590208b6bd9e31c11d0f3fbecd021571e3b9ca6384a3ddabf9f0952385c5d49","target":"record","created_at":"2026-05-18T01:08:09Z","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":"4e9c0da69e36c3f73907ede24dcc9e332e72430cd0ab98fa7f3e8a6b677e46b3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-06-04T00:44:35Z","title_canon_sha256":"6166635e48ef13fbe46afc8d6bc0de0ee7f4e3b930ed8043b76aeeb67e9ce9cd"},"schema_version":"1.0","source":{"id":"1606.01313","kind":"arxiv","version":1}},"canonical_sha256":"573679b5ea33fa84ef34348cfeb918362e0162e51c6d25171c9ddf98287d5bb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"573679b5ea33fa84ef34348cfeb918362e0162e51c6d25171c9ddf98287d5bb3","first_computed_at":"2026-05-18T01:08:09.059715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:09.059715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G38T8M1laN0ZCrydmFaYRv8L49noEH2gNJz5VuEh5oDnLlzH08mhZPxKtVwMMoHoDhZaeBePtRlSlr9G/Do2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:09.060248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01313","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c590208b6bd9e31c11d0f3fbecd021571e3b9ca6384a3ddabf9f0952385c5d49","sha256:8260b77cec091627f56cc19818d5fdb4fdaf5d26cef7328a12da9f8d40dd2fe8"],"state_sha256":"8a5c6a76a9d854a8b58269adc3e59f4508d0cf60ab583a5041cbc97beecf4bf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dauMxvu1IlWCl3ZzTbX+LVMvaIgxw22vzoskuiXsbXCXNXWBo9VSkY9E9YMInCi1j3mLM8mG309bZTmpecgjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T10:49:20.300116Z","bundle_sha256":"0ff92ab1fb2217f10ef62746257a84b988525689babf7e1246b9f15c05c57040"}}