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 "reduced complexity detection for network coded slotted aloha using sphere decoding"):
  Abstract: Network-coded slotted ALOHA (NCSA) is a re- finement to the classic slotted ALOHA protocol which im- proves throughput by enabling multiple source transmissions per ALOHA slot using physical-layer network coding (PNC). The receiver detects the network-coded combination of bits during every slot and recovers information bits by solving a system of linear equations. This work develops a receiver capable of detecting the network-coded combination of bits during a slot considering an arbitrary number of sources, orthogonal modulation, and a block fading channel. Maximum-likelihood detection of the network-coded symbol at the receiver becomes complex as the number of sources is increased. To reduce this complexity, sphere decoding is applied at the receiver to limit the number of constellation symbols the receiver must consider for detection. The system is simulated for two modulation orders and two through five sources, and error-rate performance results are provided.

Includes members:
  Member "coded slotted aloha a graph based method for uncoordinated multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "phase transition analysis for covariance based massive random access with massive mimo")
  Member "coding for network coded slotted aloha":
    also connected through other hyperedges:
      (none)
  Member "an iterative noncoherent relay receiver for the two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "noncoherent ldpc coded physical layer network coding using multitone fsk")
  Member "physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implementation of uplink network coded modulation for two hop 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)