{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A3P47U3WO2JAOZCQSSU33GI2GC","short_pith_number":"pith:A3P47U3W","schema_version":"1.0","canonical_sha256":"06dfcfd376769207645094a9bd991a30b2c993b566a07a001596990d8aba3284","source":{"kind":"arxiv","id":"1709.04163","version":2},"attestation_state":"computed","paper":{"title":"One-Bit Sphere Decoding for Uplink Massive MIMO Systems with One-Bit ADCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Namyoon Lee, Robert W. Heath Jr, Song-Nam Hong, Yo-Seb Jeon","submitted_at":"2017-09-13T07:16:40Z","abstract_excerpt":"This paper presents a low-complexity near-maximum-likelihood-detection (near-MLD) algorithm called one-bit-sphere-decoding for an uplink massive multiple-input multiple-output (MIMO) system with one-bit analog-to-digital converters (ADCs). The idea of the proposed algorithm is to estimate the transmitted symbol vector sent by uplink users (a codeword vector) by searching over a sphere, which contains a collection of codeword vectors close to the received signal vector at the base station in terms of a weighted Hamming distance. To reduce the computational complexity for the construction of the"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1709.04163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-13T07:16:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"57f66620a675064de5f8a3b00b0d643baa19870c585cb7382c765ebb78f79b66","abstract_canon_sha256":"05f0e45832b34f14b259403058f2ce41c26d40bc27a70a207b4c70ac91051f72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:43.474167Z","signature_b64":"gZinV4KE5laOm/ivviJuSyGdKhFeo4xyqGwf4ydHjRdaWu6tdMRCBFx0uEZW1N0prw8EURNzobUWRILlftL/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06dfcfd376769207645094a9bd991a30b2c993b566a07a001596990d8aba3284","last_reissued_at":"2026-05-18T00:27:43.473487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:43.473487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-Bit Sphere Decoding for Uplink Massive MIMO Systems with One-Bit ADCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Namyoon Lee, Robert W. Heath Jr, Song-Nam Hong, Yo-Seb Jeon","submitted_at":"2017-09-13T07:16:40Z","abstract_excerpt":"This paper presents a low-complexity near-maximum-likelihood-detection (near-MLD) algorithm called one-bit-sphere-decoding for an uplink massive multiple-input multiple-output (MIMO) system with one-bit analog-to-digital converters (ADCs). The idea of the proposed algorithm is to estimate the transmitted symbol vector sent by uplink users (a codeword vector) by searching over a sphere, which contains a collection of codeword vectors close to the received signal vector at the base station in terms of a weighted Hamming distance. To reduce the computational complexity for the construction of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04163","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.04163","created_at":"2026-05-18T00:27:43.473574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04163v2","created_at":"2026-05-18T00:27:43.473574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04163","created_at":"2026-05-18T00:27:43.473574+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3P47U3WO2JA","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3P47U3WO2JAOZCQ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3P47U3W","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC","json":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC.json","graph_json":"https://pith.science/api/pith-number/A3P47U3WO2JAOZCQSSU33GI2GC/graph.json","events_json":"https://pith.science/api/pith-number/A3P47U3WO2JAOZCQSSU33GI2GC/events.json","paper":"https://pith.science/paper/A3P47U3W"},"agent_actions":{"view_html":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC","download_json":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC.json","view_paper":"https://pith.science/paper/A3P47U3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04163&json=true","fetch_graph":"https://pith.science/api/pith-number/A3P47U3WO2JAOZCQSSU33GI2GC/graph.json","fetch_events":"https://pith.science/api/pith-number/A3P47U3WO2JAOZCQSSU33GI2GC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC/action/storage_attestation","attest_author":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC/action/author_attestation","sign_citation":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC/action/citation_signature","submit_replication":"https://pith.science/pith/A3P47U3WO2JAOZCQSSU33GI2GC/action/replication_record"}},"created_at":"2026-05-18T00:27:43.473574+00:00","updated_at":"2026-05-18T00:27:43.473574+00:00"}