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 "coding for network coded slotted aloha"):
  Abstract: Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming a system of linear equations. Different systems of linear equations are recovered in different timeslots. A message decoder then recovers the original packets of all the users by jointly solving multiple systems of linear equations obtained over different timeslots. We propose the batched BP decoding algorithm that combines belief propagation (BP) and local Gaussian elimination. Compared with pure Gaussian elimination decoding, our algorithm reduces the decoding complexity from cubic to linear function of the number of users. Compared with the ordinary BP decoding algorithm for low-density generator-matrix codes, our algorithm has better performance and the same order of computational complexity. We analyze the performance of the batched BP decoding algorithm by generalizing the tree-based approach and provide an approach to optimize the system performance.

Includes members:
  Member "linearly coupled fountain codes":
    also connected through other hyperedges:
      (none)
  Member "batched sparse codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "upper bound scalability on achievable rates of batched codes for line networks")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "network coded multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access for massive machine type communications")
  Member "frameless aloha protocol for wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "high throughput random access via codes on graphs coded slotted aloha":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random access for massive machine type communications")
  Member "physical layer network coding tutorial survey and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random access for massive machine type communications")
  Member "channel coding and decoding in a relay system operated with physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep learning based constellation optimization for physical network coding in two way relay 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)