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 updates in a simple relay network"):
  Abstract: In this paper, we examine a system where status updates are generated by a source and are forwarded in a First-Come-First-Served (FCFS) manner to the monitor. We consider the case where the server has other tasks to fulfill, a simple example being relaying the packets of another stream. Due to the server's necessity to go on vacations, the age process of the stream of interest becomes complicated to evaluate. By leveraging specific queuing theory tools, we provide a closed form of the average age for both streams which enables us to optimize the generation rate of packets belonging to each stream to achieve the minimum possible average age. The tools used can be further adopted to provide insights on more general multi-hop scenarios. Numerical results are provided to corroborate the theoretical findings and highlight the interaction between the two streams.

Includes members:
  Member "age of information in a network of preemptive servers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis on computation intensive status update in mobile edge computing")
  Member "status updates in a multi stream m g 1 1 preemptive queue":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "who should google scholar update more often")
  Member "multicast with prioritized delivery how fresh is your data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "partial updates losing information for freshness")
  Member "content based status updates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "scheduling status updates to minimize age of information with an energy harvesting sensor":
    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 "age optimal information updates in multihop networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "energy efficient and throughput optimal csma scheme":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimizing the age of information in a csma environment")
  Member "the age of information real time status updating by multiple sources":
    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)