{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MQQLMJYGL4EBGMJ7JBEZZB4ZCT","short_pith_number":"pith:MQQLMJYG","canonical_record":{"source":{"id":"1411.2791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T13:02:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"044fa23e8285fbc74eb816a8407215679cd57d8f43a32803f8543e8472d87bf8","abstract_canon_sha256":"bcd01fbb3825deceb2f258b1824fdc7d20cc0ccb4cf22de071704eebb03d295e"},"schema_version":"1.0"},"canonical_sha256":"6420b627065f0813313f48499c879914dd19af32f657f85e06acb5c1b1ef40b5","source":{"kind":"arxiv","id":"1411.2791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2791","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2791v1","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2791","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"MQQLMJYGL4EB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MQQLMJYGL4EBGMJ7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MQQLMJYG","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MQQLMJYGL4EBGMJ7JBEZZB4ZCT","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T13:02:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"044fa23e8285fbc74eb816a8407215679cd57d8f43a32803f8543e8472d87bf8","abstract_canon_sha256":"bcd01fbb3825deceb2f258b1824fdc7d20cc0ccb4cf22de071704eebb03d295e"},"schema_version":"1.0"},"canonical_sha256":"6420b627065f0813313f48499c879914dd19af32f657f85e06acb5c1b1ef40b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:53.038348Z","signature_b64":"LFMi3wRg8bWMLcnop/jP2fd339mwiV3PojhQtwmcOTih7Ri/T5yGTOZz4MY9CPo9pRD+478eudiCxlxKDhg0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6420b627065f0813313f48499c879914dd19af32f657f85e06acb5c1b1ef40b5","last_reissued_at":"2026-05-18T02:37:53.037728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:53.037728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2791","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-18T02:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHG3xwvyU7X2xMAqfzQ+waa4yFiwARBrFIfHxA4VkzJdN4PGSoZIERB3DQkFPJDkg2ey9+IA1gCyhDoUu/e5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:29:51.986495Z"},"content_sha256":"f57d3d8278f33c46e52583f7bf6af815720c3485d9dd14f13122eb458a4ebab3","schema_version":"1.0","event_id":"sha256:f57d3d8278f33c46e52583f7bf6af815720c3485d9dd14f13122eb458a4ebab3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MQQLMJYGL4EBGMJ7JBEZZB4ZCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Soft-Output Signal Detection Based on Gauss-Seidel Method for Uplink Multi-User Large-Scale MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Lin I, Linglong Dai, Shuangfeng Han, Xin Su, Xinyu Gao, Zhaocheng Wang","submitted_at":"2014-11-11T13:02:28Z","abstract_excerpt":"For uplink large-scale MIMO systems, minimum mean square error (MMSE) algorithm is near-optimal but involves matrix inversion with high complexity. In this paper, we propose to exploit the Gauss-Seidel (GS) method to iteratively realize the MMSE algorithm without the complicated matrix inversion. To further accelerate the convergence rate and reduce the complexity, we propose a diagonal-approximate initial solution to the GS method, which is much closer to the final solution than the traditional zero-vector initial solution. We also propose a approximated method to compute log-likelihood ratio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2791","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-18T02:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9S8rw76rmfVwMeHNcZ/d4yaASJFF0Mbm17VzD4gWc1ou9NZw2WditydJnORXA9Te9Z2YVBR+AEuCHY2JuXz/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:29:51.986899Z"},"content_sha256":"e1784661334aba2bbeefa619b418b741f68eec0ae540907f5a11383ba591e976","schema_version":"1.0","event_id":"sha256:e1784661334aba2bbeefa619b418b741f68eec0ae540907f5a11383ba591e976"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQQLMJYGL4EBGMJ7JBEZZB4ZCT/bundle.json","state_url":"https://pith.science/pith/MQQLMJYGL4EBGMJ7JBEZZB4ZCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQQLMJYGL4EBGMJ7JBEZZB4ZCT/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-05-31T02:29:51Z","links":{"resolver":"https://pith.science/pith/MQQLMJYGL4EBGMJ7JBEZZB4ZCT","bundle":"https://pith.science/pith/MQQLMJYGL4EBGMJ7JBEZZB4ZCT/bundle.json","state":"https://pith.science/pith/MQQLMJYGL4EBGMJ7JBEZZB4ZCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQQLMJYGL4EBGMJ7JBEZZB4ZCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MQQLMJYGL4EBGMJ7JBEZZB4ZCT","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":"bcd01fbb3825deceb2f258b1824fdc7d20cc0ccb4cf22de071704eebb03d295e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T13:02:28Z","title_canon_sha256":"044fa23e8285fbc74eb816a8407215679cd57d8f43a32803f8543e8472d87bf8"},"schema_version":"1.0","source":{"id":"1411.2791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2791","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2791v1","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2791","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"MQQLMJYGL4EB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MQQLMJYGL4EBGMJ7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MQQLMJYG","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:e1784661334aba2bbeefa619b418b741f68eec0ae540907f5a11383ba591e976","target":"graph","created_at":"2026-05-18T02:37:53Z","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":"For uplink large-scale MIMO systems, minimum mean square error (MMSE) algorithm is near-optimal but involves matrix inversion with high complexity. In this paper, we propose to exploit the Gauss-Seidel (GS) method to iteratively realize the MMSE algorithm without the complicated matrix inversion. To further accelerate the convergence rate and reduce the complexity, we propose a diagonal-approximate initial solution to the GS method, which is much closer to the final solution than the traditional zero-vector initial solution. We also propose a approximated method to compute log-likelihood ratio","authors_text":"Chih-Lin I, Linglong Dai, Shuangfeng Han, Xin Su, Xinyu Gao, Zhaocheng Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T13:02:28Z","title":"Low-Complexity Soft-Output Signal Detection Based on Gauss-Seidel Method for Uplink Multi-User Large-Scale MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2791","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:f57d3d8278f33c46e52583f7bf6af815720c3485d9dd14f13122eb458a4ebab3","target":"record","created_at":"2026-05-18T02:37:53Z","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":"bcd01fbb3825deceb2f258b1824fdc7d20cc0ccb4cf22de071704eebb03d295e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T13:02:28Z","title_canon_sha256":"044fa23e8285fbc74eb816a8407215679cd57d8f43a32803f8543e8472d87bf8"},"schema_version":"1.0","source":{"id":"1411.2791","kind":"arxiv","version":1}},"canonical_sha256":"6420b627065f0813313f48499c879914dd19af32f657f85e06acb5c1b1ef40b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6420b627065f0813313f48499c879914dd19af32f657f85e06acb5c1b1ef40b5","first_computed_at":"2026-05-18T02:37:53.037728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:53.037728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LFMi3wRg8bWMLcnop/jP2fd339mwiV3PojhQtwmcOTih7Ri/T5yGTOZz4MY9CPo9pRD+478eudiCxlxKDhg0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:53.038348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f57d3d8278f33c46e52583f7bf6af815720c3485d9dd14f13122eb458a4ebab3","sha256:e1784661334aba2bbeefa619b418b741f68eec0ae540907f5a11383ba591e976"],"state_sha256":"6d570b7fe5a5477ba3744d51a92eb7be7a9382658752328d80bffbecc99f2d7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7M5VBdHWtv+hBkLD96o6ZL4j37AatSapdBxTK5F8J2MLUKkC1PZh01MUAc9phyvBwIFSG0ggmrZJoqFDAjLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:29:51.989342Z","bundle_sha256":"dde79695c6c142ce96a262914da62fb7ea7bd3e521e5fbdf2e772ae8d5362c56"}}