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 "orthogonal transform multiplexing with memoryless nonlinearity a possible alternative to traditional coded modulation schemes"):
  Abstract: In this paper, we propose a novel joint coding-modulation technique based on serial concatenation of orthogonal linear transform, such as discrete Fourier transform (DFT) or Walsh-Hadamard transform (WHT), with memoryless nonlinearity. We demonstrate that such a simple signal construction may exhibit properties of a random code ensemble, as a result approaching channel capacity. Our computer simulations confirm that if the decoder relies on a modified approximate message passing algorithm, the proposed modulation technique exhibits performance on par with state-of-the-art coded modulation schemes that use capacity-approaching component codes. The proposed modulation scheme could be used directly or as a precoder for a conventional orthogonal frequency division multiplexing (OFDM) transmitter, resulting in a system possessing all benefits of OFDM along with reduced peak-to-average power ratio (PAPR).

Includes members:
  Member "detection of nonlinearly distorted ofdm signals via generalized approximate message passing":
    also connected through other hyperedges:
      (none)
  Member "on the convergence of approximate message passing with arbitrary matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convolutional approximate message passing")
  Member "generalized approximate message passing for estimation with random linear mixing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

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)