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 "timely updates by multiple sources the m m 1 queue revisited"):
  Abstract: Multiple sources submit updates to a monitor through an M/M/1 queue. A stochastic hybrid system (SHS) approach is used to derive the average age of information (AoI) for an individual source as a function of the offered load of that source and the competing update traffic offered by other sources. This work corrects an error in a prior analysis. By numerical evaluation, this error is observed to be small and qualitatively insignificant.

Includes members:
  Member "average age of information for a multi source m m 1 queueing model with packet management":
    also connected through other hyperedges:
      (none)
  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 "urgency of information for context aware timely status updates in remote control systems")
  Member "on the age of information in multi source queueing models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "average age of information for a multi source m m 1 queueing model with packet management")
  Member "age optimal updates of multiple information flows":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "the age of information in networks moments distributions and sampling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timely status updating through intermittent sensing and transmission")
  Member "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")
  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 synchronization with sporadic status changes")
  Member "coded status updates in an energy harvesting erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "information freshness for timely detection of status changes")

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)