{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PCWQFEZ25QFUB6GPLDHTI3RBZT","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":"c66bcc40bb6f787d21389f0ce08da43843567040a50cfb170c79f9ad371086d1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-08T02:45:36Z","title_canon_sha256":"5de7cf10bea7c1c4b348b444f92b72a7c40d7c104037f3def961df692d9d8caf"},"schema_version":"1.0","source":{"id":"1904.03805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03805","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03805v1","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03805","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"PCWQFEZ25QFU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PCWQFEZ25QFUB6GP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PCWQFEZ2","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:76a596e50ea26d6e62c2d13a4422a0c26ef6f07d654610aeef14144e9f5b0aa1","target":"graph","created_at":"2026-05-17T23:49:08Z","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":"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 ","authors_text":"Daeun Kim, Namyoon Lee, Song-Nam Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-08T02:45:36Z","title":"Supervised-Learning for Multi-Hop MU-MIMO Communications with One-Bit Transceivers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03805","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:408fd05de0a3a4743bedcafa2d0552cef1eeaa08e560fc5064ac4b683547e122","target":"record","created_at":"2026-05-17T23:49:08Z","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":"c66bcc40bb6f787d21389f0ce08da43843567040a50cfb170c79f9ad371086d1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-08T02:45:36Z","title_canon_sha256":"5de7cf10bea7c1c4b348b444f92b72a7c40d7c104037f3def961df692d9d8caf"},"schema_version":"1.0","source":{"id":"1904.03805","kind":"arxiv","version":1}},"canonical_sha256":"78ad02933aec0b40f8cf58cf346e21cceccaf1b046854cae878280439f8d2062","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78ad02933aec0b40f8cf58cf346e21cceccaf1b046854cae878280439f8d2062","first_computed_at":"2026-05-17T23:49:08.111602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:08.111602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vMLH+ZcF543U3OZSKhOU3/ET3d3v4MxRT5GqF31bnAA8LnG+/Bt/XTE7cTX0IymhjAVsmw1VNaLX0JVvvBlFAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:08.112288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:408fd05de0a3a4743bedcafa2d0552cef1eeaa08e560fc5064ac4b683547e122","sha256:76a596e50ea26d6e62c2d13a4422a0c26ef6f07d654610aeef14144e9f5b0aa1"],"state_sha256":"a6703dc3a2146d51e3a4c5c3602dc004f7099c62e3ddcfebd5f2bc3ff175a1f8"}