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 "on timely channel coding with hybrid arq"):
  Abstract: A status updating communication system is examined, in which a transmitter communicates with a receiver over a noisy channel. The goal is to realize timely delivery of fresh data over time, which is assessed by an age-of-information (AoI) metric. Channel coding is used to combat the channel errors, and feedback is sent to acknowledge updates' reception. In case decoding is unsuccessful, a hybrid ARQ protocol is employed, in which incremental redundancy (IR) bits are transmitted to enhance the decoding ability. This continues for some amount of time in case decoding remains unsuccessful, after which a new (fresh) status update is transmitted instead. In case decoding is successful, the transmitter has the option to idly wait for a certain amount of time before sending a new update. A general problem is formulated that optimizes the codeword and IR lengths for each update, and the waiting times, such that the long term average AoI is minimized. Stationary deterministic policies are investigated, in which the codeword and IR lengths are fixed for each update, and the waiting time is a deterministic function of the AoI. The optimal waiting policy is then derived, and is shown to have a threshold structure, in which the transmitter sends a new update only if the AoI grows above a certain threshold that is a function of the codeword and IR lengths. Choosing the codeword and IR lengths is discussed in the context of binary symmetric channels.

Includes members:
  Member "age optimal transmission of rateless codes in an erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimum age of information in the internet of things with non uniform status packet sizes")
  Member "optimal age over erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "benefits of coding on age of information in broadcast networks")
  Member "coded status updates in an energy harvesting erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "joint status sampling and updating for minimizing age of information in the internet of things":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "age of information with gilbert elliot servers and samplers")
  Member "optimizing information freshness in wireless networks under general interference constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "delay and peak age violation probability in short packet transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "age minimal transmission for energy harvesting sensors with finite batteries online policies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")
  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)