{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Q6JIETMUOTYE5YYD57TI2QBZ5K","short_pith_number":"pith:Q6JIETMU","canonical_record":{"source":{"id":"1301.4729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:06:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be092cab3d380e4613e5084fa33362fc19f94877063c6791e85ca49aee5d89ed","abstract_canon_sha256":"02930e29be8ee276fc118a96d4e4ced5ee1509cd7282f5d5add1d3dfca6fa4b5"},"schema_version":"1.0"},"canonical_sha256":"8792824d9474f04ee303efe68d4039ea8e57b8b9c7f742ea9ad6717884218242","source":{"kind":"arxiv","id":"1301.4729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4729","created_at":"2026-05-18T03:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4729v1","created_at":"2026-05-18T03:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4729","created_at":"2026-05-18T03:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q6JIETMUOTYE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q6JIETMUOTYE5YYD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q6JIETMU","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Q6JIETMUOTYE5YYD57TI2QBZ5K","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:06:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be092cab3d380e4613e5084fa33362fc19f94877063c6791e85ca49aee5d89ed","abstract_canon_sha256":"02930e29be8ee276fc118a96d4e4ced5ee1509cd7282f5d5add1d3dfca6fa4b5"},"schema_version":"1.0"},"canonical_sha256":"8792824d9474f04ee303efe68d4039ea8e57b8b9c7f742ea9ad6717884218242","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:22.304467Z","signature_b64":"IAxnq+38xvG0G2P5foVDpTTzVs0VKMak9zZmcLtZgJ1TaLY3+/lYasW0btaNX7wM80qxxkDbaMc1dhc9k3DnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8792824d9474f04ee303efe68d4039ea8e57b8b9c7f742ea9ad6717884218242","last_reissued_at":"2026-05-18T03:06:22.303639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:22.303639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4729","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-18T03:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHiciU1GaelKuuBj4oX/Po7A/BBZv3LaVqXjOk7AVgHRxg64BLiVCGF3vdnbsE0DGuBVaxRGeCBhHD9nIi5yCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:10:26.013740Z"},"content_sha256":"e7dc73bb3d43658aabd5a1281cfc4711ef28b1dce59566f923af475a8c792b82","schema_version":"1.0","event_id":"sha256:e7dc73bb3d43658aabd5a1281cfc4711ef28b1dce59566f923af475a8c792b82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Q6JIETMUOTYE5YYD57TI2QBZ5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Duality and Optimization for Generalized Multi-hop MIMO Amplify-and-Forward Relay Networks with Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"An Liu, Vincent K. N. Lau, Youjian Liu","submitted_at":"2013-01-21T02:06:53Z","abstract_excerpt":"We consider a generalized multi-hop MIMO amplify-and-forward (AF) relay network with multiple sources/destinations and arbitrarily number of relays. We establish two dualities and the corresponding dual transformations between such a network and its dual, respectively under single network linear constraint and per-hop linear constraint. The result is a generalization of the previous dualities under different special cases and is proved using new techniques which reveal more insight on the duality structure that can be exploited to optimize MIMO precoders. A unified optimization framework is pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4729","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-18T03:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQxxLec+4dNaCTmHlQNjzEC5n+ctoKm9g65n9SmmU5fDbsynooIQ+jt2BeASuNTaCrAp746ncYHYyRt57JWHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:10:26.014396Z"},"content_sha256":"50fca9417f942b98ae2a9585cf77fa171a42183dff5c9dd03c41afe2512d8073","schema_version":"1.0","event_id":"sha256:50fca9417f942b98ae2a9585cf77fa171a42183dff5c9dd03c41afe2512d8073"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6JIETMUOTYE5YYD57TI2QBZ5K/bundle.json","state_url":"https://pith.science/pith/Q6JIETMUOTYE5YYD57TI2QBZ5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6JIETMUOTYE5YYD57TI2QBZ5K/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-04T06:10:26Z","links":{"resolver":"https://pith.science/pith/Q6JIETMUOTYE5YYD57TI2QBZ5K","bundle":"https://pith.science/pith/Q6JIETMUOTYE5YYD57TI2QBZ5K/bundle.json","state":"https://pith.science/pith/Q6JIETMUOTYE5YYD57TI2QBZ5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6JIETMUOTYE5YYD57TI2QBZ5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q6JIETMUOTYE5YYD57TI2QBZ5K","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":"02930e29be8ee276fc118a96d4e4ced5ee1509cd7282f5d5add1d3dfca6fa4b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:06:53Z","title_canon_sha256":"be092cab3d380e4613e5084fa33362fc19f94877063c6791e85ca49aee5d89ed"},"schema_version":"1.0","source":{"id":"1301.4729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4729","created_at":"2026-05-18T03:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4729v1","created_at":"2026-05-18T03:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4729","created_at":"2026-05-18T03:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q6JIETMUOTYE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q6JIETMUOTYE5YYD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q6JIETMU","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:50fca9417f942b98ae2a9585cf77fa171a42183dff5c9dd03c41afe2512d8073","target":"graph","created_at":"2026-05-18T03:06:22Z","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":"We consider a generalized multi-hop MIMO amplify-and-forward (AF) relay network with multiple sources/destinations and arbitrarily number of relays. We establish two dualities and the corresponding dual transformations between such a network and its dual, respectively under single network linear constraint and per-hop linear constraint. The result is a generalization of the previous dualities under different special cases and is proved using new techniques which reveal more insight on the duality structure that can be exploited to optimize MIMO precoders. A unified optimization framework is pr","authors_text":"An Liu, Vincent K. N. Lau, Youjian Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:06:53Z","title":"Duality and Optimization for Generalized Multi-hop MIMO Amplify-and-Forward Relay Networks with Linear Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4729","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:e7dc73bb3d43658aabd5a1281cfc4711ef28b1dce59566f923af475a8c792b82","target":"record","created_at":"2026-05-18T03:06:22Z","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":"02930e29be8ee276fc118a96d4e4ced5ee1509cd7282f5d5add1d3dfca6fa4b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:06:53Z","title_canon_sha256":"be092cab3d380e4613e5084fa33362fc19f94877063c6791e85ca49aee5d89ed"},"schema_version":"1.0","source":{"id":"1301.4729","kind":"arxiv","version":1}},"canonical_sha256":"8792824d9474f04ee303efe68d4039ea8e57b8b9c7f742ea9ad6717884218242","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8792824d9474f04ee303efe68d4039ea8e57b8b9c7f742ea9ad6717884218242","first_computed_at":"2026-05-18T03:06:22.303639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:22.303639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IAxnq+38xvG0G2P5foVDpTTzVs0VKMak9zZmcLtZgJ1TaLY3+/lYasW0btaNX7wM80qxxkDbaMc1dhc9k3DnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:22.304467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7dc73bb3d43658aabd5a1281cfc4711ef28b1dce59566f923af475a8c792b82","sha256:50fca9417f942b98ae2a9585cf77fa171a42183dff5c9dd03c41afe2512d8073"],"state_sha256":"8d336859889fbc926197303b9e6db59fb4b4052cd80a139f0bb068afecec6b6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVlhfOFZyMFME/fIify/Elhs/ZVb8iBOH5n9z3EQFtvyel9jXnvsqWuyoSaWpW6TNTvikXmByNSCwwt8uKgSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:10:26.017704Z","bundle_sha256":"6686cb229fa604add45695cfb857a426e9bf58c35e758b9f3e23447ea9c80239"}}