{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GIJ6OBMOHLQRMFQ7LJ2JTXGX6K","short_pith_number":"pith:GIJ6OBMO","canonical_record":{"source":{"id":"1106.0178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-01T13:36:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0751b3909e6d30971f0ceddd959a624abbd909a2a554a00f619fcaa636b0a8ee","abstract_canon_sha256":"ce5702627e238df61da225afbabf5554f8c585ae317f08b53c27e2ce53935b7f"},"schema_version":"1.0"},"canonical_sha256":"3213e7058e3ae116161f5a7499dcd7f29a3a8ed2698a5ed89792af8e8992be82","source":{"kind":"arxiv","id":"1106.0178","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0178","created_at":"2026-05-18T03:48:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0178v2","created_at":"2026-05-18T03:48:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0178","created_at":"2026-05-18T03:48:13Z"},{"alias_kind":"pith_short_12","alias_value":"GIJ6OBMOHLQR","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIJ6OBMOHLQRMFQ7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIJ6OBMO","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GIJ6OBMOHLQRMFQ7LJ2JTXGX6K","target":"record","payload":{"canonical_record":{"source":{"id":"1106.0178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-01T13:36:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0751b3909e6d30971f0ceddd959a624abbd909a2a554a00f619fcaa636b0a8ee","abstract_canon_sha256":"ce5702627e238df61da225afbabf5554f8c585ae317f08b53c27e2ce53935b7f"},"schema_version":"1.0"},"canonical_sha256":"3213e7058e3ae116161f5a7499dcd7f29a3a8ed2698a5ed89792af8e8992be82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:13.796353Z","signature_b64":"ONfFKb0npUEUvTRTx1WDMyDQXpgS2kF4raejEk+lurCkokAJk1KTOB5KSyPIgRdkP9SVcSqIMCCJgkroGRz/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3213e7058e3ae116161f5a7499dcd7f29a3a8ed2698a5ed89792af8e8992be82","last_reissued_at":"2026-05-18T03:48:13.795597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:13.795597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.0178","source_version":2,"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:48:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nO7bGqVdk8tnTyHIifQAdSMcw1fm26CsiMxeWjvTw2Sri76Sy8TypEG2jZl3r33DYKEmktrVWa0deqTxuME0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:23:23.369350Z"},"content_sha256":"1da0bac2f84e30494bfe3617005388eb07d1e019396aa6829dc5ae5141514d3b","schema_version":"1.0","event_id":"sha256:1da0bac2f84e30494bfe3617005388eb07d1e019396aa6829dc5ae5141514d3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GIJ6OBMOHLQRMFQ7LJ2JTXGX6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievable Rates of MIMO Systems with Linear Precoding and Iterative LMMSE Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aleksandar Kavcic, Chongbin Xu, Li Ping, Xiaojun Yuan","submitted_at":"2011-06-01T13:36:10Z","abstract_excerpt":"We establish area theorems for iterative detection over coded linear systems (including multiple-input multipleoutput (MIMO) channels, inter-symbol-interference (ISI) channels, and orthogonal frequency-division multiplexing (OFDM) systems). We propose a linear precoding technique that asymptotically ensures the Gaussianness of the messages passed in iterative detection, as the transmission block length tends to infinity. We show that the proposed linear precoding scheme with iterative linear minimum mean-square error (LMMSE) detection is potentially information lossless, under various assumpti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0178","kind":"arxiv","version":2},"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:48:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZfl8AeImmchuqEPaBRksmoBmcZrL1YghxLloEBFwrRE3U5V3Mlh0gJS6vh8zRyRMJoL3dOYmvPOy5fToeiSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:23:23.369695Z"},"content_sha256":"f71131bfe805ebeb7b7e901bfce84290148593be0c2ea5fe0ad7f68efe3a2d84","schema_version":"1.0","event_id":"sha256:f71131bfe805ebeb7b7e901bfce84290148593be0c2ea5fe0ad7f68efe3a2d84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIJ6OBMOHLQRMFQ7LJ2JTXGX6K/bundle.json","state_url":"https://pith.science/pith/GIJ6OBMOHLQRMFQ7LJ2JTXGX6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIJ6OBMOHLQRMFQ7LJ2JTXGX6K/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-05T10:23:23Z","links":{"resolver":"https://pith.science/pith/GIJ6OBMOHLQRMFQ7LJ2JTXGX6K","bundle":"https://pith.science/pith/GIJ6OBMOHLQRMFQ7LJ2JTXGX6K/bundle.json","state":"https://pith.science/pith/GIJ6OBMOHLQRMFQ7LJ2JTXGX6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIJ6OBMOHLQRMFQ7LJ2JTXGX6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GIJ6OBMOHLQRMFQ7LJ2JTXGX6K","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":"ce5702627e238df61da225afbabf5554f8c585ae317f08b53c27e2ce53935b7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-01T13:36:10Z","title_canon_sha256":"0751b3909e6d30971f0ceddd959a624abbd909a2a554a00f619fcaa636b0a8ee"},"schema_version":"1.0","source":{"id":"1106.0178","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0178","created_at":"2026-05-18T03:48:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0178v2","created_at":"2026-05-18T03:48:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0178","created_at":"2026-05-18T03:48:13Z"},{"alias_kind":"pith_short_12","alias_value":"GIJ6OBMOHLQR","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIJ6OBMOHLQRMFQ7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIJ6OBMO","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:f71131bfe805ebeb7b7e901bfce84290148593be0c2ea5fe0ad7f68efe3a2d84","target":"graph","created_at":"2026-05-18T03:48:13Z","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 establish area theorems for iterative detection over coded linear systems (including multiple-input multipleoutput (MIMO) channels, inter-symbol-interference (ISI) channels, and orthogonal frequency-division multiplexing (OFDM) systems). We propose a linear precoding technique that asymptotically ensures the Gaussianness of the messages passed in iterative detection, as the transmission block length tends to infinity. We show that the proposed linear precoding scheme with iterative linear minimum mean-square error (LMMSE) detection is potentially information lossless, under various assumpti","authors_text":"Aleksandar Kavcic, Chongbin Xu, Li Ping, Xiaojun Yuan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-01T13:36:10Z","title":"Achievable Rates of MIMO Systems with Linear Precoding and Iterative LMMSE Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0178","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:1da0bac2f84e30494bfe3617005388eb07d1e019396aa6829dc5ae5141514d3b","target":"record","created_at":"2026-05-18T03:48:13Z","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":"ce5702627e238df61da225afbabf5554f8c585ae317f08b53c27e2ce53935b7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-01T13:36:10Z","title_canon_sha256":"0751b3909e6d30971f0ceddd959a624abbd909a2a554a00f619fcaa636b0a8ee"},"schema_version":"1.0","source":{"id":"1106.0178","kind":"arxiv","version":2}},"canonical_sha256":"3213e7058e3ae116161f5a7499dcd7f29a3a8ed2698a5ed89792af8e8992be82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3213e7058e3ae116161f5a7499dcd7f29a3a8ed2698a5ed89792af8e8992be82","first_computed_at":"2026-05-18T03:48:13.795597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:13.795597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ONfFKb0npUEUvTRTx1WDMyDQXpgS2kF4raejEk+lurCkokAJk1KTOB5KSyPIgRdkP9SVcSqIMCCJgkroGRz/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:13.796353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0178","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1da0bac2f84e30494bfe3617005388eb07d1e019396aa6829dc5ae5141514d3b","sha256:f71131bfe805ebeb7b7e901bfce84290148593be0c2ea5fe0ad7f68efe3a2d84"],"state_sha256":"0f269852a5baf429edce13aaa0e2fbcc615771ea945c45ddae603538f2fb5df1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYf3heJOtro1PyHI6REoxZP48xSZW86JzpZWOVPi0fHngpc5yLFHDPnxKVbY/DBaurjtE3fSal5LwsxuEkdwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:23:23.371775Z","bundle_sha256":"d3eef025497b8d429a1aeec0dc81ff70059472c2953de077807f46969ed0bd9e"}}