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 of information in a network of preemptive servers"
  Abstract: A source submits status updates to a network for delivery to a destination monitor. Updates follow a route through a series of network nodes. Each node is a last-come-first-served queue supporting preemption in service. We characterize the average age of information at the input and output of each node in the route induced by the updates passing through. For Poisson arrivals to a line network of preemptive memoryless servers, we show that average age accumulates through successive network nodes.

Connected through hyperedge HE-1 (induced by source paper "analysis on computation intensive status update in mobile edge computing"):
  with members:
    - "trading off computation with transmission in status update systems"
    - "age of information for computation intensive messages in mobile edge computing"
    - "timely cloud computing preemption and waiting"
    - "the age of information in networks moments distributions and sampling"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "joint information freshness and completion time optimization for vehicular networks"
    - "a survey on mobile edge computing the communication perspective"
    - "the age of information in multihop networks"

Connected through hyperedge HE-2 (induced by source paper "non linear age of information in a discrete time queue stationary distribution and average performance analysis"):
  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"
    - "age of information for discrete time queues"
    - "on the distribution of aoi for the gi gi 1 1 and gi gi 1 2 systems exact expressions and bounds"
    - "age of information in g g 1 1 systems age expressions bounds special cases and optimization"
    - "the distribution of age of information performance measures for message processing systems"
    - "the age of information in networks moments distributions and sampling"
    - "information aging through queues a mutual information perspective"

Connected through hyperedge HE-3 (induced by source paper "optimizing information freshness in computing enabled iot networks"):
  with members:
    - "on peak age of information in data preprocessing enabled iot networks"
    - "age optimal updates of multiple information flows"
    - "age of information in g g 1 1 systems"
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "a survey on mobile edge computing the communication perspective"
    - "status updates through m g 1 1 queues with harq"
    - "age optimal information updates in multihop networks"
    - "age minimal transmission in energy harvesting two hop networks"

Connected through hyperedge HE-4 (induced by source paper "joint transmission and computing scheduling for status update with mobile edge computing"):
  with members:
    - "trading off computation with transmission in status update systems"
    - "age of information for computation intensive messages in mobile edge computing"
    - "reducing age of information for computation intensive messages via packet replacement"
    - "timely cloud computing preemption and waiting"
    - "joint information freshness and completion time optimization for vehicular networks"
    - "a survey on mobile edge computing the communication perspective"
    - "age optimal information updates in multihop networks"
    - "age minimal transmission in energy harvesting two hop networks"

Connected through hyperedge HE-5 (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 delay tradeoffs in single server systems"
    - "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-6 (induced by source paper "minimizing the age of information noma or oma"):
  with members:
    - "noma an information theoretic perspective"
    - "minimizing the age of information in a csma environment"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "the age of updates in a simple relay network"
    - "multicast with prioritized delivery how fresh is your data"
    - "content based status updates"
    - "on the foundation of noma and its application to 5g cellular networks"
    - "age optimal information updates in multihop networks"

Connected through hyperedge HE-7 (induced by source paper "minimizing the age of information in a csma environment"):
  with members:
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "the age of updates in a simple relay network"
    - "multicast with prioritized delivery how fresh is your data"
    - "content based status updates"
    - "age optimal information updates in multihop networks"
    - "energy efficient and throughput optimal csma scheme"

Connected through hyperedge HE-8 (induced by source paper "age of information with prioritized streams when to buffer preempted packets"):
  with members:
    - "minimizing the age of information noma or oma"
    - "minimizing the age of information in a csma environment"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "the age of updates in a simple relay network"
    - "multicast with prioritized delivery how fresh is your data"
    - "content based status updates"
    - "age optimal information updates in multihop networks"
    - "update or wait how to keep your data fresh"

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)