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 "sign compute resolve for random access"):
  Abstract: We present an approach to random access that is based on three elements: physical-layer network coding, signature codes and tree splitting. Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum of the information that was transmitted by the individual users. For each user this information consists of the data that the user wants to communicate as well as the user's signature. As long as no more than $K$ users collide, their identities can be recovered from the sum of their signatures. A splitting protocol is used to deal with the case that more than $K$ users collide. We measure the performance of the proposed method in terms of user resolution rate as well as overall throughput of the system. The results show that our approach significantly increases the performance of the system even compared to coded random access, where collisions are not wasted, but are reused in successive interference cancellation.

Includes members:
  Member "coded random access how coding theory helps to build random access protocols":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless access in ultra reliable low latency communication urllc")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "coded splitting tree protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a random access protocol for pilot allocation in crowded massive mimo systems")
  Member "spatially coupled random access on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "bounded contention coding for wireless networks in the high snr regime":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cross sender bit mixing coding")
  Member "random access with physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random access for massive machine type communications")
  Member "a network coded diversity protocol for collision recovery in slotted aloha networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")

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)