{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FNK4LG6WWVIGL5WPXTFUQ7EMZJ","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":"ad1bcaecd7eec9d0536e23555a2be4baa742e5e5b50baf8fc29d7e2842b24604","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-12T09:57:20Z","title_canon_sha256":"3b18a875875dda7a006becb74be235283dbbd13707db386dc211bd201aafe3d5"},"schema_version":"1.0","source":{"id":"1303.2820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2820","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2820v1","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2820","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"FNK4LG6WWVIG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FNK4LG6WWVIGL5WP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FNK4LG6W","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:5e98eeb154cf02402cb3038cd8efc49f384e3ea343fc0eb7706e96d2069846dd","target":"graph","created_at":"2026-05-18T03:31:07Z","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 problem of minimizing the total power consumption while satisfying different quality-of-service (QoS) requirements in a two-hop multiple-input multiple-output network with a single non-regenerative relay is considered. As shown by Y. Rong in [1], the optimal processing matrices for both linear and non-linear transceiver architectures lead to the diagonalization of the source-relay-destination channel so that the power minimization problem reduces to properly allocating the available power over the established links. Unfortunately, finding the solution of this problem is numerically difficu","authors_text":"Antonio A. D'Amico, Luca Sanguinetti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-12T09:57:20Z","title":"Power Allocation in Two-Hop Amplify-and-Forward MIMO Relay Systems with QoS requirements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2820","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:6698e639c508c404bf04e1d4fe6788cf68119866436c2a9d99c36d0407363b1f","target":"record","created_at":"2026-05-18T03:31:07Z","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":"ad1bcaecd7eec9d0536e23555a2be4baa742e5e5b50baf8fc29d7e2842b24604","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-12T09:57:20Z","title_canon_sha256":"3b18a875875dda7a006becb74be235283dbbd13707db386dc211bd201aafe3d5"},"schema_version":"1.0","source":{"id":"1303.2820","kind":"arxiv","version":1}},"canonical_sha256":"2b55c59bd6b55065f6cfbccb487c8cca7ebe0ae86bf38638e6126e204e09c6a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b55c59bd6b55065f6cfbccb487c8cca7ebe0ae86bf38638e6126e204e09c6a6","first_computed_at":"2026-05-18T03:31:07.943092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:07.943092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hTW+GUnHc3OfDcN41IAQMW7kO+VkXTASsHTwkxKo6QIhJ9xxRQC7Q2AI2vaXR9kK2crc2ZAXrYB/DIzkS7fxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:07.943827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6698e639c508c404bf04e1d4fe6788cf68119866436c2a9d99c36d0407363b1f","sha256:5e98eeb154cf02402cb3038cd8efc49f384e3ea343fc0eb7706e96d2069846dd"],"state_sha256":"b50d510ab34f8bc0785efc063db7010f69fbb043c76128a6542b7784a82dc0db"}