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 multihop networks"):
  Abstract: The problem of minimizing the age-of-information has been extensively studied in single-hop networks. In this paper, we minimize the age of a single information flow in multihop networks. If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy. In addition, for arbitrary distributions of packet transmission times, the non-preemptive LGFS policy is shown to minimize the age processes at all nodes among all non-preemptive work-conserving policies (again in a stochastic ordering sense). Interestingly, these simple policies can achieve optimality of the joint distribution of the age processes at all nodes even under arbitrary network topologies, as well as arbitrary packet generation and arrival times. These optimality results not only hold for the age processes, but also for any non-decreasing functional of the age processes. Finally, we investigate the class of New-Better-than-Used (NBU) packet transmission time distributions and show that the non-preemptive LGFS policy is within a constant age gap from the optimum average age, and that the gap is independent of system parameters.

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 "the age of information in networks moments distributions and sampling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age optimal sampling and transmission scheduling in multi source systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely status updating through intermittent sensing and transmission")
  Member "acp an end to end transport protocol for delivering fresh updates in the internet of things":
    also connected through other hyperedges:
      (none)
  Member "age optimal information updates in multihop networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age minimal transmission in energy harvesting two hop networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "who should google scholar update more often")
  Member "remote estimation of the wiener process over a channel with random delay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who should google scholar update more often")
  Member "on delay optimal scheduling in queueing systems with replications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")

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)