{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4R3D2NA7MX56TRKAFI76WDNND2","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":"c99d5268653228c4ae14e7e688b187f0ed9c254434f09d41edb3ab30df32cfa0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-03-01T16:20:01Z","title_canon_sha256":"1f4d1d0f82eaf80e53b4a25efcf1a69031d805faab8d3bb344f88476d61692da"},"schema_version":"1.0","source":{"id":"2003.01586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.01586","created_at":"2026-07-05T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"2003.01586v1","created_at":"2026-07-05T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.01586","created_at":"2026-07-05T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"4R3D2NA7MX56","created_at":"2026-07-05T00:45:30Z"},{"alias_kind":"pith_short_16","alias_value":"4R3D2NA7MX56TRKA","created_at":"2026-07-05T00:45:30Z"},{"alias_kind":"pith_short_8","alias_value":"4R3D2NA7","created_at":"2026-07-05T00:45:30Z"}],"graph_snapshots":[{"event_id":"sha256:97a6d9b3179ac17e9431d963f0768fd36811cb3bd2c70ccead3600408d6ccb5c","target":"graph","created_at":"2026-07-05T00:45:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.01586/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper deals with joint source-relay-destination beamforming (BF) design for an amplify-and-forward (AF) relay network. Considering the channel state information (CSI) from the relay to the destination is imperfect, we first aim to maximize the worst case received SNR under per-antenna power constraints. The associated optimization problem is then solved in two steps. In the first step, by revealing the rank-one property of the optimal relay BF matrix, we establish the semi-closed form solution of the joint optimal BF design that only depends on a vector variable. Based on this result, in ","authors_text":"Hongying Tang, Jun Li, Wen Chen","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-03-01T16:20:01Z","title":"Robust Joint Source-Relay-Destination Design Under Per-antenna Power Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.01586","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:536f12faa8be5e092c56706782887053f13da0d37fcffd1a112804bb31403c84","target":"record","created_at":"2026-07-05T00:45:30Z","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":"c99d5268653228c4ae14e7e688b187f0ed9c254434f09d41edb3ab30df32cfa0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-03-01T16:20:01Z","title_canon_sha256":"1f4d1d0f82eaf80e53b4a25efcf1a69031d805faab8d3bb344f88476d61692da"},"schema_version":"1.0","source":{"id":"2003.01586","kind":"arxiv","version":1}},"canonical_sha256":"e4763d341f65fbe9c5402a3feb0dad1ebea0416b50ed21534b878f743821a8a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4763d341f65fbe9c5402a3feb0dad1ebea0416b50ed21534b878f743821a8a5","first_computed_at":"2026-07-05T00:45:30.159957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:45:30.159957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GQJ1v0gTQT0Qn7yiSRVHIO5wAojWK7lUAgaWa98aQdduemzVRih+/kKueDKQz2UXPGt4u4GZsWQuIxyuFS+2Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:45:30.160362Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.01586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:536f12faa8be5e092c56706782887053f13da0d37fcffd1a112804bb31403c84","sha256:97a6d9b3179ac17e9431d963f0768fd36811cb3bd2c70ccead3600408d6ccb5c"],"state_sha256":"92fcde1ef79ba091731bbd5551c7b960405f989dde640225b4fcace9f53e1225"}