{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PCWQFEZ25QFUB6GPLDHTI3RBZT","short_pith_number":"pith:PCWQFEZ2","schema_version":"1.0","canonical_sha256":"78ad02933aec0b40f8cf58cf346e21cceccaf1b046854cae878280439f8d2062","source":{"kind":"arxiv","id":"1904.03805","version":1},"attestation_state":"computed","paper":{"title":"Supervised-Learning for Multi-Hop MU-MIMO Communications with One-Bit Transceivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daeun Kim, Namyoon Lee, Song-Nam Hong","submitted_at":"2019-04-08T02:45:36Z","abstract_excerpt":"This paper considers a nonlinear multi-hop multi-user multiple-input multiple-output (MU-MIMO) relay channel, in which multiple users send information symbols to a multi-antenna base station (BS) with one-bit analog-to-digital converters via intermediate relays, each with one-bit transceiver. To understand the fundamental limit of the detection performance, the optimal maximum-likelihood (ML) detector is proposed with the assumption of perfect and global channel state information (CSI) at the BS. This multi-user detector, however, is not practical due to the unrealistic CSI assumption and 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":"1904.03805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-08T02:45:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5de7cf10bea7c1c4b348b444f92b72a7c40d7c104037f3def961df692d9d8caf","abstract_canon_sha256":"c66bcc40bb6f787d21389f0ce08da43843567040a50cfb170c79f9ad371086d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:08.112288Z","signature_b64":"vMLH+ZcF543U3OZSKhOU3/ET3d3v4MxRT5GqF31bnAA8LnG+/Bt/XTE7cTX0IymhjAVsmw1VNaLX0JVvvBlFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78ad02933aec0b40f8cf58cf346e21cceccaf1b046854cae878280439f8d2062","last_reissued_at":"2026-05-17T23:49:08.111602Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:08.111602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supervised-Learning for Multi-Hop MU-MIMO Communications with One-Bit Transceivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daeun Kim, Namyoon Lee, Song-Nam Hong","submitted_at":"2019-04-08T02:45:36Z","abstract_excerpt":"This paper considers a nonlinear multi-hop multi-user multiple-input multiple-output (MU-MIMO) relay channel, in which multiple users send information symbols to a multi-antenna base station (BS) with one-bit analog-to-digital converters via intermediate relays, each with one-bit transceiver. To understand the fundamental limit of the detection performance, the optimal maximum-likelihood (ML) detector is proposed with the assumption of perfect and global channel state information (CSI) at the BS. This multi-user detector, however, is not practical due to the unrealistic CSI assumption and the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03805","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.03805","created_at":"2026-05-17T23:49:08.111729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03805v1","created_at":"2026-05-17T23:49:08.111729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03805","created_at":"2026-05-17T23:49:08.111729+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCWQFEZ25QFU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCWQFEZ25QFUB6GP","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCWQFEZ2","created_at":"2026-05-18T12:33:24.271573+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/PCWQFEZ25QFUB6GPLDHTI3RBZT","json":"https://pith.science/pith/PCWQFEZ25QFUB6GPLDHTI3RBZT.json","graph_json":"https://pith.science/api/pith-number/PCWQFEZ25QFUB6GPLDHTI3RBZT/graph.json","events_json":"https://pith.science/api/pith-number/PCWQFEZ25QFUB6GPLDHTI3RBZT/events.json","paper":"https://pith.science/paper/PCWQFEZ2"},"agent_actions":{"view_html":"https://pith.science/pith/PCWQFEZ25QFUB6GPLDHTI3RBZT","download_json":"https://pith.science/pith/PCWQFEZ25QFUB6GPLDHTI3RBZT.json","view_paper":"https://pith.science/paper/PCWQFEZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03805&json=true","fetch_graph":"https://pith.science/api/pith-number/PCWQFEZ25QFUB6GPLDHTI3RBZT/graph.json","fetch_events":"https://pith.science/api/pith-number/PCWQFEZ25QFUB6GPLDHTI3RBZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCWQFEZ25QFUB6GPLDHTI3RBZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCWQFEZ25QFUB6GPLDHTI3RBZT/action/storage_attestation","attest_author":"https://pith.science/pith/PCWQFEZ25QFUB6GPLDHTI3RBZT/action/author_attestation","sign_citation":"https://pith.science/pith/PCWQFEZ25QFUB6GPLDHTI3RBZT/action/citation_signature","submit_replication":"https://pith.science/pith/PCWQFEZ25QFUB6GPLDHTI3RBZT/action/replication_record"}},"created_at":"2026-05-17T23:49:08.111729+00:00","updated_at":"2026-05-17T23:49:08.111729+00:00"}