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: "on the distribution of aoi for the gi gi 1 1 and gi gi 1 2 systems exact expressions and bounds"
  Abstract: Since Age of Information (AoI) has been proposed as a metric that quantifies the freshness of information updates in a communication system, there has been a constant effort in understanding and optimizing different statistics of the AoI process for classical queueing systems. In addition to classical queuing systems, more recently, systems with no queue or a unit capacity queue storing the latest packet have been gaining importance as storing and transmitting older packets do not reduce AoI at the receiver. Following this line of research, we study the distribution of AoI for the GI/GI/1/1 and GI/GI/1/2* systems, under non-preemptive scheduling. For any single-source-single-server queueing system, we derive, using sample path analysis, a fundamental result that characterizes the AoI violation probability, and use it to obtain closed-form expressions for D/GI/1/1, M/GI/1/1 as well as systems that use zero-wait policy. Further, when exact results are not tractable, we present a simple methodology for obtaining upper bounds for the violation probability for both GI/GI/1/1 and GI/GI/1/2* systems. An interesting feature of the proposed upper bounds is that, if the departure rate is given, they overestimate the violation probability by at most a value that decreases with the arrival rate. Thus, given the departure rate and for a fixed average service, the bounds are tighter at higher utilization.

Connected through hyperedge HE-1 (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"
    - "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"
    - "age of information in a network of preemptive servers"
    - "the age of information in networks moments distributions and sampling"
    - "information aging through queues a mutual information perspective"

Connected through hyperedge HE-2 (induced by source paper "statistical guarantee optimization for aoi in single hop and two hop systems with periodic arrivals"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "optimal status updating with a finite battery energy harvesting source"
    - "age of information in g g 1 1 systems age expressions bounds special cases and optimization"
    - "status updates through m g 1 1 queues with harq"
    - "age optimal information updates in multihop networks"
    - "update or wait how to keep your data fresh"
    - "age of information in the presence of error"
    - "age of information the gamma awakening"

Connected through hyperedge HE-3 (induced by source paper "performance characterization using aoi in a single loop networked control system"):
  with members:
    - "remote estimation of the wiener process over a channel with random delay"
    - "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)