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 multicast networks with multiple update streams"):
  Abstract: We consider the age of information in a multicast network where there is a single source node that sends time-sensitive updates to $n$ receiver nodes. Each status update is one of two kinds: type I or type II. To study the age of information experienced by the receiver nodes for both types of updates, we consider two cases: update streams are generated by the source node at-will and update streams arrive exogenously to the source node. We show that using an earliest $k_1$ and $k_2$ transmission scheme for type I and type II updates, respectively, the age of information of both update streams at the receiver nodes can be made a constant independent of $n$. In particular, the source node transmits each type I update packet to the earliest $k_1$ and each type II update packet to the earliest $k_2$ of $n$ receiver nodes. We determine the optimum $k_1$ and $k_2$ stopping thresholds for arbitrary shifted exponential link delays to individually and jointly minimize the average age of both update streams and characterize the pareto optimal curve for the two ages.

Includes members:
  Member "online timely status updates with erasures for energy harvesting sensors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "status updates in a multi stream m g 1 1 preemptive queue":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "who should google scholar update more often")
  Member "sending information through status updates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "age of information with gilbert elliot servers and samplers")
  Member "age of information in multihop multicast networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who should google scholar update more often")
  Member "content based status updates":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "optimal status update for age of information minimization with an energy harvesting source":
    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)