{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X4YQ2L6CBS5POQKDBPSRO2F2QC","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":"92044125877b39516408d978db86a49bbaa65a63f440bfa7d023c17eb12238d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-07T03:22:16Z","title_canon_sha256":"d975cb9f471447c5c2d6b3ec42fa3efd13c749e3b353e49553d87b820a2d4905"},"schema_version":"1.0","source":{"id":"1101.1345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1345","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1345v2","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1345","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"X4YQ2L6CBS5P","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X4YQ2L6CBS5POQKD","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X4YQ2L6C","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:2485248028075211f5f6bbe733506fd888d534ca98de018ec4988cf9bc4eeb28","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"In this paper, we investigate the optimal precoding scheme for relay networks with finite-alphabet constraints. We show that the previous work utilizing various design criteria to maximize either the diversity order or the transmission rate with the Gaussian-input assumption may lead to significant loss for a practical system with finite constellation set constraint. A linear precoding scheme is proposed to maximize the mutual information for relay networks. We exploit the structure of the optimal precoding matrix and develop a unified two-step iterative algorithm utilizing the theory of conve","authors_text":"Chengshan Xiao, Jianhua Lu, Mingxi Wang, Weiliang Zeng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-07T03:22:16Z","title":"Linear Precoding for Relay Networks with Finite-Alphabet Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1345","kind":"arxiv","version":2},"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:85739448d2ce4cdd4d0dcac136256e8d3aeb3ca8e4643cb16a9fe1f4246e45d0","target":"record","created_at":"2026-05-18T00:58:19Z","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":"92044125877b39516408d978db86a49bbaa65a63f440bfa7d023c17eb12238d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-07T03:22:16Z","title_canon_sha256":"d975cb9f471447c5c2d6b3ec42fa3efd13c749e3b353e49553d87b820a2d4905"},"schema_version":"1.0","source":{"id":"1101.1345","kind":"arxiv","version":2}},"canonical_sha256":"bf310d2fc20cbaf741430be51768ba80a252321e64883a1a7212f90731efebf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf310d2fc20cbaf741430be51768ba80a252321e64883a1a7212f90731efebf4","first_computed_at":"2026-05-18T00:58:19.185880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.185880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9LtOTd3MdC3AgFImfwd0tGS2sLZeLqXGFz9/IMYNm2T1h2qPFGfqAkb7S6EGsbmdiwwTvQmSvAPytdlIn9o9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.186685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85739448d2ce4cdd4d0dcac136256e8d3aeb3ca8e4643cb16a9fe1f4246e45d0","sha256:2485248028075211f5f6bbe733506fd888d534ca98de018ec4988cf9bc4eeb28"],"state_sha256":"3bf01b2199adf53582bf62fa6380e4c31bcb170e1dddebd5f96bf891e7dd2037"}