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 "throughput maximization for delay sensitive random access communication"):
  Abstract: We consider a single cell uplink in which many devices randomly transmit a data payload to the base station. Given a fixed latency constraint per device, we propose a time and frequency slotted random access scheme with retransmissions, which when necessary, are Chase combined at the receiver. We analyze the proposed setting at constant SNR. We characterize the scaling of random access throughput versus the latency, by optimizing the number of retransmissions and the number of frequency bins. For infinite block length (IBL), we conclude that at low SNR devices should completely share the time and frequency resources. For high SNR, however, the number of frequency bins should scale with altered load, and the slot duration for each retransmission is determined by the outage tolerance. Since infinite packet sizes are not possible, we extend our model to the finite block length (FBL) regime and characterize the gap versus the IBL regime. We also provide some new results for FBL capacity to bound the probability of outage. The proposed random access model gives an upper bound for the total uplink traffic that can be successfully decoded for a single receive antenna given the latency constraint, and provides insights for 5G cellular system design.

Includes members:
  Member "resource allocation and harq optimization for urllc traffic in 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "optimizing data aggregation for uplink machine to machine communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hybrid resource scheduling for aggregation in massive machine type communication networks")
  Member "wide area wireless communication challenges for the internet of things":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enabling urllc for low cost iot devices via diversity combining schemes")
  Member "optimum power control at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "fundamentals of throughput maximization with random arrivals for m2m communications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "power efficient system design for cellular based machine to machine communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")

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)