human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a supervised learning detector for multihop distributed reception systems"):
  Abstract: We consider a multihop distributed uplink reception system in which $K$ users transmit independent messages to one data center of $N_{\rm r} \geq K$ receive antennas, with the aid of multihop intermediate relays. In particular, each antenna of the data center is equipped with one-bit analog-to-digital converts (ADCs) for the sake of power-efficiency. In this system, it is extremely challenging to develop a low-complexity detector due to the non-linearity of an end-to-end channel transfer function (created by relays' operations and one-bit ADCs). Furthermore, there is no efficient way to estimate such complex function with a limited number of training data. Motivated by this, we propose a supervised-learning (SL) detector by introducing a novel Bernoulli-like model in which training data is directly used to design a detector rather than estimating a channel transfer function. It is shown that the proposed SL detector outperforms the existing SL detectors based on Gaussian model for one-bit quantized (binary observation) systems. Furthermore, we significantly reduce the complexity of the proposed SL detector using the fast kNN algorithm. Simulation results demonstrate that the proposed SL detector can yield an attractive performance with a significantly lower complexity.

Includes members:
  Member "one bit sphere decoding for uplink massive mimo systems with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "robust and efficient distributed compression for cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "compute and forward strategies for cooperative distributed antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private information retrieval over gaussian mac")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval over gaussian mac")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)