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 with gilbert elliot servers and samplers"):
  Abstract: We study age of information in a status updating system that consists of a single sampler, i.e., source node, that sends time-sensitive status updates to a single monitor node through a server node. We first consider a Gilbert-Elliot service profile at the server node. In this model, service times at the server node follow a finite state Markov chain with two states: ${bad}$ state $b$ and ${good}$ state $g$ where the server is faster in state $g$. We determine the time average age experienced by the monitor node and characterize the age-optimal state transition matrix $P$ with and without an average cost constraint on the service operation. Next, we consider a Gilbert-Elliot sampling profile at the source. In this model, the interarrival times follow a finite state Markov chain with two states: ${bad}$ state $b$ and ${good}$ state $g$ where samples are more frequent in state $g$. We find the time average age experienced by the monitor node and characterize the age-optimal state transition matrix $P$.

Includes members:
  Member "partial updates losing information for freshness":
    also connected through other hyperedges:
      (none)
  Member "optimal selective encoding for timely updates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "who should google scholar update more often":
    also connected through other hyperedges:
      (none)
  Member "age of information with prioritized streams when to buffer preempted packets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "age of information for discrete time queues":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non linear age of information in a discrete time queue stationary distribution and average performance analysis")
  Member "on timely channel coding with hybrid arq":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "partial updates losing information for freshness")
  Member "timely distributed computation with stragglers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "who should google scholar update more often")
  Member "age of information in multicast networks with multiple update streams":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)