human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "delay and peak age violation probability in short packet transmissions"
  Abstract: This paper investigates the distribution of delay and peak age of information in a communication system where packets, generated according to an independent and identically distributed Bernoulli process, are placed in a single-server queue with first-come first-served discipline and transmitted over an additive white Gaussian noise (AWGN) channel. When a packet is correctly decoded, the sender receives an instantaneous error-free positive acknowledgment, upon which it removes the packet from the buffer. In the case of negative acknowledgment, the packet is retransmitted. By leveraging finite-blocklength results for the AWGN channel, we characterize the delay violation and the peak-age violation probability without resorting to approximations based on large deviation theory as in previous literature. Our analysis reveals that there exists an optimum blocklength that minimizes the delay violation and the peak-age violation probabilities. We also show that one can find two blocklength values that result in very similar average delay and average peak age but significantly different delay violation and peak-age violation probabilities, respectively. This highlights the importance of focusing on violation probabilities rather than on averages.

Connected through hyperedge HE-1 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "optimal control of status updates in a multiple access channel with stability constraints"
    - "average peak age of information minimization in uav assisted iot networks"
    - "saddlepoint approximations for rayleigh block fading channels"
    - "optimal status updating with a finite battery energy harvesting source"
    - "statistical guarantee optimization for aoi in single hop and two hop systems with periodic arrivals"
    - "a vision of 6g wireless systems applications trends technologies and open research problems"
    - "dynamic task offloading and resource allocation for ultra reliable low latency edge computing"

Connected through hyperedge HE-2 (induced by source paper "anti aging scheduling in single server queues a systematic and comparative study"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "age delay tradeoffs in single server systems"
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "optimal scheduling of multiple sensors with packet length constraint"
    - "optimizing data freshness throughput and delay in multi server information update systems"
    - "the age of information real time status updating by multiple sources"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-3 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "sampling for remote estimation through queues age of information and beyond"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "sampling for data freshness optimization non linear age functions"
    - "age of information in g g 1 1 systems"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"

Connected through hyperedge HE-4 (induced by source paper "benefits of coding on age of information in broadcast networks"):
  with members:
    - "sampling for remote estimation through queues age of information and beyond"
    - "optimal age over erasure channels"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "the age of information in networks moments distributions and sampling"
    - "online timely status updates with erasures for energy harvesting sensors"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "optimizing age of information in wireless networks with perfect channel state information"

Connected through hyperedge HE-5 (induced by source paper "using erasure feedback for online timely updating with an energy harvesting sensor"):
  with members:
    - "online timely status updates with erasures for energy harvesting sensors"
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "age of information minimization for an energy harvesting source with updating erasures with and without feedback"
    - "sending information through status updates"
    - "content based status updates"
    - "timely lossless source coding for randomly arriving symbols"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"

Connected through hyperedge HE-6 (induced by source paper "context aware information lapse for timely status updates in remote control systems"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "sampling for remote estimation through queues age of information and beyond"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "sampling for data freshness optimization non linear age functions"
    - "age of information in g g 1 1 systems"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"

Connected through hyperedge HE-7 (induced by source paper "age of information in random access channels"):
  with members:
    - "benefits of coding on age of information in broadcast networks"
    - "minimizing the age of information in wireless networks with stochastic arrivals"
    - "optimal age over erasure channels"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "age of information performance of multiaccess strategies with packet management"

Connected through hyperedge HE-8 (induced by source paper "on timely channel coding with hybrid arq"):
  with members:
    - "age optimal transmission of rateless codes in an erasure channel"
    - "optimal age over erasure channels"
    - "coded status updates in an energy harvesting erasure channel"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "average age of information with hybrid arq under a resource constraint"

Question: Please tell me which class the center node 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)