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 "autoencoder based error correction coding for one bit quantization"):
  Abstract: This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in the receivers. Specifically, it is first shown that the optimum error correction code that minimizes the probability of bit error can be obtained by perfectly training a special autoencoder, in which "perfectly" refers to converging the global minima. However, perfect training is not possible in most cases. To approach the performance of a perfectly trained autoencoder with a suboptimum training, we propose utilizing turbo codes as an implicit regularization, i.e., using a concatenation of a turbo code and an autoencoder. It is empirically shown that this design gives nearly the same performance as to the hypothetically perfectly trained autoencoder, and we also provide a theoretical proof of why that is so. The proposed coding method is as bandwidth efficient as the integrated (outer) turbo code, since the autoencoder exploits the excess bandwidth from pulse shaping and packs signals more intelligently thanks to sparsity in neural networks. Our results show that the proposed coding scheme at finite block lengths outperforms conventional turbo codes even for QPSK modulation. Furthermore, the proposed coding method can make one-bit quantization operational even for 16-QAM.

Includes members:
  Member "one bit ofdm receivers via deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "golay layer limiting peak to average power ratio for ofdm based autoencoders")
  Member "learning a code machine learning for approximate non linear coded computation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a locality based approach for coded computation")
  Member "deepcode feedback codes via deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing the feedback capacity of finite state channels using reinforcement learning")
  Member "deep learning methods for improved decoding of linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "perm2vec graph permutation selection for decoding of error correction codes using self attention")
  Member "an introduction to deep learning for the physical layer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on machine learning based performance improvement of wireless networks phy mac and network layer")
  Member "throughput analysis of massive mimo uplink with low resolution adcs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "power of deep learning for channel estimation and signal detection in ofdm systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a deep learning framework for optimization of miso downlink beamforming")
  Member "on deep learning based channel decoding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "design of capacity approaching low density parity check codes using recurrent neural networks")

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)