{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KF5JZFIOSR4CYYVDFHOU7Q4ONR","short_pith_number":"pith:KF5JZFIO","canonical_record":{"source":{"id":"1805.04656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-12T05:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"a6b5c73aae4ba86237b3453e03292a4efe4e08213b43ed517fd531904bae51ee","abstract_canon_sha256":"8082c9194da1137a23d12035c96df9a3afd9b38ed1e2f6a75b1d76e14003b6de"},"schema_version":"1.0"},"canonical_sha256":"517a9c950e94782c62a329dd4fc38e6c6fffb2c9164f35e9930b23348e1a6c1d","source":{"kind":"arxiv","id":"1805.04656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04656","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04656v1","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04656","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"KF5JZFIOSR4C","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KF5JZFIOSR4CYYVD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KF5JZFIO","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KF5JZFIOSR4CYYVDFHOU7Q4ONR","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-12T05:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"a6b5c73aae4ba86237b3453e03292a4efe4e08213b43ed517fd531904bae51ee","abstract_canon_sha256":"8082c9194da1137a23d12035c96df9a3afd9b38ed1e2f6a75b1d76e14003b6de"},"schema_version":"1.0"},"canonical_sha256":"517a9c950e94782c62a329dd4fc38e6c6fffb2c9164f35e9930b23348e1a6c1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:06.786608Z","signature_b64":"WsQtHR7NfcGE6pEm8PGPyUZUl8zTZckEP6Y79CJSUigIZelVNd6QyR9fA6WsZgtcLZYHtr9Tu2PFTv7myAA/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"517a9c950e94782c62a329dd4fc38e6c6fffb2c9164f35e9930b23348e1a6c1d","last_reissued_at":"2026-05-18T00:16:06.786025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:06.786025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04656","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:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0T0LS8xHfC/6Wbnq3i/IdPnOK7bpz41+BCzyxCjNfbVRqOp9FiVyhYLlmXzLdwf8FNtfY4oAacA1eRbmnA+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:26:20.458815Z"},"content_sha256":"992142364e629c1ac662e48808b65aa03b8480693b0d0e923961d930859f0ebf","schema_version":"1.0","event_id":"sha256:992142364e629c1ac662e48808b65aa03b8480693b0d0e923961d930859f0ebf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KF5JZFIOSR4CYYVDFHOU7Q4ONR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Inner SOCP Approximate Algorithm for Robust Adaptive Beamforming for General-Rank Signal Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Sergiy A. Vorobyov, Yongwei Huang","submitted_at":"2018-05-12T05:18:35Z","abstract_excerpt":"The worst-case robust adaptive beamforming problem for general-rank signal model is considered. Its formulation is to maximize the worst-case signal-to-interference-plus-noise ratio (SINR), incorporating a positive semidefinite constraint on the actual covariance matrix of the desired signal. In the literature, semidefinite program (SDP) techniques, together with others, have been applied to approximately solve this problem. Herein an inner second-order cone program (SOCP) approximate algorithm is proposed to solve it. In particular, a sequence of SOCPs are constructed and solved, while the SO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04656","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:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMvT+i3wY/e6yBMmEBIE/lChYkUnLDTtgWDKoGSCSE6o2uHIaGNq5E+nhGDZzk2G/6wfiWzS4Gb1V9XQmlhcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:26:20.459582Z"},"content_sha256":"1ea1b6052c8403e128412f33244589d7b3b89e3d87fa0c2b9ae70e6105dda96b","schema_version":"1.0","event_id":"sha256:1ea1b6052c8403e128412f33244589d7b3b89e3d87fa0c2b9ae70e6105dda96b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KF5JZFIOSR4CYYVDFHOU7Q4ONR/bundle.json","state_url":"https://pith.science/pith/KF5JZFIOSR4CYYVDFHOU7Q4ONR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KF5JZFIOSR4CYYVDFHOU7Q4ONR/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-09T07:26:20Z","links":{"resolver":"https://pith.science/pith/KF5JZFIOSR4CYYVDFHOU7Q4ONR","bundle":"https://pith.science/pith/KF5JZFIOSR4CYYVDFHOU7Q4ONR/bundle.json","state":"https://pith.science/pith/KF5JZFIOSR4CYYVDFHOU7Q4ONR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KF5JZFIOSR4CYYVDFHOU7Q4ONR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KF5JZFIOSR4CYYVDFHOU7Q4ONR","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":"8082c9194da1137a23d12035c96df9a3afd9b38ed1e2f6a75b1d76e14003b6de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-12T05:18:35Z","title_canon_sha256":"a6b5c73aae4ba86237b3453e03292a4efe4e08213b43ed517fd531904bae51ee"},"schema_version":"1.0","source":{"id":"1805.04656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04656","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04656v1","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04656","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"KF5JZFIOSR4C","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KF5JZFIOSR4CYYVD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KF5JZFIO","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:1ea1b6052c8403e128412f33244589d7b3b89e3d87fa0c2b9ae70e6105dda96b","target":"graph","created_at":"2026-05-18T00:16:06Z","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":"The worst-case robust adaptive beamforming problem for general-rank signal model is considered. Its formulation is to maximize the worst-case signal-to-interference-plus-noise ratio (SINR), incorporating a positive semidefinite constraint on the actual covariance matrix of the desired signal. In the literature, semidefinite program (SDP) techniques, together with others, have been applied to approximately solve this problem. Herein an inner second-order cone program (SOCP) approximate algorithm is proposed to solve it. In particular, a sequence of SOCPs are constructed and solved, while the SO","authors_text":"Sergiy A. Vorobyov, Yongwei Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-12T05:18:35Z","title":"An Inner SOCP Approximate Algorithm for Robust Adaptive Beamforming for General-Rank Signal Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04656","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:992142364e629c1ac662e48808b65aa03b8480693b0d0e923961d930859f0ebf","target":"record","created_at":"2026-05-18T00:16:06Z","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":"8082c9194da1137a23d12035c96df9a3afd9b38ed1e2f6a75b1d76e14003b6de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-12T05:18:35Z","title_canon_sha256":"a6b5c73aae4ba86237b3453e03292a4efe4e08213b43ed517fd531904bae51ee"},"schema_version":"1.0","source":{"id":"1805.04656","kind":"arxiv","version":1}},"canonical_sha256":"517a9c950e94782c62a329dd4fc38e6c6fffb2c9164f35e9930b23348e1a6c1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"517a9c950e94782c62a329dd4fc38e6c6fffb2c9164f35e9930b23348e1a6c1d","first_computed_at":"2026-05-18T00:16:06.786025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:06.786025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WsQtHR7NfcGE6pEm8PGPyUZUl8zTZckEP6Y79CJSUigIZelVNd6QyR9fA6WsZgtcLZYHtr9Tu2PFTv7myAA/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:06.786608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:992142364e629c1ac662e48808b65aa03b8480693b0d0e923961d930859f0ebf","sha256:1ea1b6052c8403e128412f33244589d7b3b89e3d87fa0c2b9ae70e6105dda96b"],"state_sha256":"6feda56c2815f1c59d51bbc7ebd621ce82959ad8df187cd314b663da31cdf7f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+4JRkS4r/GfIjE8/ZN7n3TX8O4ma/ul+Zj+2P16FdTNONTKdbDkxpl20hgVjpk2nmNskLhKlSlSX8kMba9oBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:26:20.463368Z","bundle_sha256":"099884b3a006978a8ef0d7d69f8965cdedb33199d54f9542ec2ce2ed5d4671ec"}}