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: "average age of information for a multi source m m 1 queueing model with packet management"
  Abstract: We consider a status update system consisting of two independent sources, one server, and one sink. The packets of different sources are generated according to the Poisson process and the packets are served according to an exponentially distributed service time. We consider the following packet management policy. When the system is empty, any arriving packet immediately enters the server; when the server is busy, a packet of a source waiting in the queue is replaced if a new packet of the same source arrives. We derive the average age of information (AoI) of the considered M/M/1 queueing model by using the stochastic hybrid systems (SHS) technique. Numerical results are provided to show the effectiveness of the proposed policy.

Connected through hyperedge HE-1 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "on the age of information in multi source queueing models"
    - "age optimal updates of multiple information flows"
    - "the age of information in networks moments distributions and sampling"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "coded status updates in an energy harvesting erasure channel"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"

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)