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: "age delay tradeoffs in single server systems"
  Abstract: Information freshness and low latency communication is important to many emerging applications. While Age of Information (AoI) serves as a metric of information freshness, packet delay is a traditional metric of communication latency. We prove that there is a natural tradeoff between the AoI and packet delay. We consider a single server system, in which at most one update packet can be serviced at a time. The system designer controls the order in which the packets get serviced and the service time distribution, with a given service rate. We analyze two tradeoff problems that minimize packet delay and the variance in packet delay, respectively, subject to an average age constraint. We prove a strong age-delay and age-delay variance tradeoff, wherein, as the average age approaches its minimum, the delay and its variance approach infinity. We show that the service time distribution that mininizes average age, must necessarily have an unbounded-second moment.

Connected through hyperedge HE-1 (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"
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "delay and peak age violation probability in short packet transmissions"
    - "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-2 (induced by source paper "age delay tradeoffs in queueing systems"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "age of information for discrete time queues"
    - "delay optimal and energy efficient communications with markovian arrivals"
    - "age of information in a network of preemptive servers"
    - "the age of information in networks moments distributions and sampling"
    - "age of information in g g 1 1 systems"
    - "can determinacy minimize age of information"
    - "optimizing information freshness in wireless networks under general interference constraints"

Connected through hyperedge HE-3 (induced by source paper "age of information for discrete time queues"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "age optimal information gathering and dissemination on graphs"
    - "age of information in g g 1 1 systems"
    - "can determinacy minimize age of information"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "the age of updates in a simple relay network"
    - "minimizing the age of the information through queues"
    - "age of information in the presence of error"

Connected through hyperedge HE-4 (induced by source paper "can determinacy minimize age of information"):
  with members:
    - "age of information in a network of preemptive servers"
    - "the age of information in networks moments distributions and sampling"
    - "age of information in g g 1 1 systems"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "minimizing the age of the information through queues"
    - "age of information in the presence of error"
    - "optimizing data freshness throughput and delay in multi server information update systems"

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)