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 "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"):
  Abstract: This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary memoryless Bernoulli process, placed in a single-server queue and then transmitted over a wireless channel. A variable-length stop-feedback coding scheme---a general strategy that encompasses simple automatic repetition request (ARQ) and more sophisticated hybrid ARQ techniques as special cases---is used by the transmitter to convey the information packets to the receiver. By leveraging finite-blocklength results, the delay violation and the peak-age violation probabilities are characterized without resorting to approximations based on large-deviation theory as in previous literature. Numerical results illuminate the dependence of delay and peak-age violation probability on system parameters such as the frame size and the undetected error probability, and on the chosen packet-management policy. The guidelines provided by our analysis are particularly useful for the design of low-latency ultra-reliable communication systems.

Includes members:
  Member "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "low latency short packet transmissions fixed length or harq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "5g wireless network slicing for embb urllc and mmtc a communication theoretic view":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "overhead aware design of reconfigurable intelligent surfaces in smart radio environments")
  Member "delay and peak age violation probability in short packet transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "content based status updates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "short packets over block memoryless fading channels pilot assisted or noncoherent transmission":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "status updates through m g 1 1 queues with harq":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "who should google scholar update more often")
  Member "age optimal information updates in multihop networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")

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)