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 "multiple relay slotted aloha performance analysis and bounds"):
  Abstract: Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple receivers has recently emerged as a promising option. We study the potential of this approach considering a population of users that transmit data packets following a simple slotted ALOHA policy to a set of non-cooperative receivers or relays (uplink phase). These, in turn, independently forward - part of - what decoded towards a collecting sink (downlink phase). For an on-off fading channel model, we provide exact expressions for uplink throughput and packet loss rate for an arbitrary number of relays, characterising the benefits of multi-receiver schemes. Moreover, a lower bound on the minimum amount of downlink resources needed to deliver all information collected on the uplink is provided. The bound is proven to be achievable via random linear coding when no constraints in terms of latency are set. We complement our study discussing a family of simple forwarding policies that require no packet-level coding, and optimising their performance based on the amount of available downlink resources. The behaviour of both random linear coding and simplified policies is also characterised when receivers are equipped with finite buffers, revealing non-trivial tradeoffs.

Includes members:
  Member "enhancing contention resolution aloha using combining techniques":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "protograph ldpc code design for asynchronous random access")
  Member "cooperative slotted aloha for massive m2m random access using directional antennas":
    also connected through other hyperedges:
      (none)
  Member "coded slotted aloha a graph based method for uncoordinated multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "phase transition analysis for covariance based massive random access with massive mimo")
  Member "cooperative slotted aloha for multi base station systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")

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)