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 "age of information in multihop multicast networks"):
  Abstract: We consider the age of information in a multihop multicast network where there is a single source node sending time-sensitive updates to $n^L$ end nodes, and $L$ denotes the number of hops. In the first hop, the source node sends updates to $n$ first-hop receiver nodes, and in the second hop each first-hop receiver node relays the update packets that it has received to $n$ further users that are connected to it. This network architecture continues in further hops such that each receiver node in hop $\ell$ is connected to $n$ further receiver nodes in hop $\ell+1$. We study the age of information experienced by the end nodes, and in particular, its scaling as a function of $n$. We show that, using an earliest $k$ transmission scheme in each hop, the age of information at the end nodes can be made a constant independent of $n$. In particular, the source node transmits each update packet to the earliest $k_1$ of the $n$ first-hop nodes, and each first-hop node that receives the update relays it to the earliest $k_2$ out of $n$ second-hop nodes that are connected to it and so on. We determine the optimum $k_\ell$ stopping value for each hop $\ell$ for arbitrary shifted exponential link delays.

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 for discrete time queues":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "age of information with gilbert elliot servers and samplers")
  Member "waiting before serving a companion to packet management in status update systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "the age of information in networks moments distributions and sampling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "online timely status updates with erasures for energy harvesting sensors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "who should google scholar update more often")
  Member "coded status updates in an energy harvesting erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age of information in g g 1 1 systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "who should google scholar update more often")
  Member "age minimal online policies for energy harvesting sensors with random battery recharges":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "who should google scholar update more often")

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)