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 "random access with physical layer network coding"):
  Abstract: Leveraging recent progress in physical-layer network coding we propose a new approach to random access: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission, the receiver can thus obtain many linear combinations and eventually recover all original packets. This is by contrast to slotted ALOHA where packet collisions lead to complete erasures. The throughput of the proposed strategy is derived and shown to be significantly superior to the best known strategies, including multipacket reception.

Includes members:
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private information retrieval over gaussian mac")
  Member "sliding window based contention resolution diversity slotted aloha":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enhancing contention resolution aloha using combining techniques")
  Member "random access an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interference prediction in wireless networks stochastic geometry meets recursive filtering")
  Member "a network coded diversity protocol for collision recovery in slotted aloha networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prioritized random mac optimization via graph based analysis")
  Member "frameless aloha protocol for wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "reliable physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards massive connectivity support for scalable mmtc communications in 5g networks")
  Member "high throughput random access via codes on graphs coded slotted aloha":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "random access for massive machine type communications")
  Member "an enhanced multiple random access scheme for satellite communications":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "estimation of timing offsets and phase shifts between packet replicas in marsala random access")

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)