human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "the age of information in networks moments distributions and sampling"):
  Abstract: We examine a source providing status updates to monitors through a network with state defined by a continuous-time finite Markov chain. Using an age of information metric, we characterize timeliness by the vector of ages tracked by the monitors. Based on a stochastic hybrid systems approach, we derive first order linear differential equations for the temporal evolution of both the age moments and a moment generating function (MGF) of the age vector components. We show that the existence of a non-negative fixed point for the first moment guarantees convergence of all higher order moments as well as a convergence region for the stationary MGF vector of the age. The stationary MGF vector is then found for the age on a line network of preemptive memoryless servers. It is found that the age at a node is identical in distribution to the sum of independent exponential service times. This observation is then generalized to linear status sampling networks in which each node receives samples of the update process at each preceding node according to a renewal point process. For each node, the age is shown to be identical in distribution to a sum of independent renewal process age random variables.

Includes members:
  Member "a general formula for the stationary distribution of the age of information and its application to single server queues":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age of information in a network of preemptive servers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis on computation intensive status update in mobile edge computing")
  Member "age optimal updates of multiple information flows":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "minimizing content staleness in dynamo style replicated storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "age of information for updates with distortion constant and age dependent distortion constraints")
  Member "to skip or to switch minimizing age of information under link capacity constraint":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "coded status updates in an energy harvesting erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "distributed scheduling algorithms for optimizing information freshness in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")

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