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 "adaptive coding for information freshness in a two user broadcast erasure channel"):
  Abstract: In this paper, we investigate the impact of coding on the Age of Information (AoI) in a two-user broadcast symbol erasure channel with feedback. We assume each update consists of $K$ symbols and the source is able to broadcast one symbol in each time slot. Due to random channel noise, the intended symbol at each user will be erased according to an independent and identically distributed (i.i.d.) Bernoulli process. A user is able to successfully decode an update if it accumulates sufficient information and successfully decodes the $K$ symbols of the update. Assuming prefect feedback information at the source right after the transmission of each symbol, our objective is to design an adaptive coding scheme to achieve small AoI at both users. We propose a novel coding scheme to judiciously combine symbols from different updates together, and analyze the AoI at both users. Compared with a baseline greedy scheme, the proposed adaptive coding scheme improves the AoI at the weak user by orders of magnitude without compromising the AoI at the strong user.

Includes members:
  Member "benefits of coding on age of information in broadcast networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "age of information in random access channels")
  Member "age optimal transmission of rateless codes in an erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "benefits of coding on age of information in broadcast networks")
  Member "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "controlling packet drops to improve freshness of information":
    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 minimization for an energy harvesting source with updating erasures with and without feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "information freshness for timely detection of status changes")
  Member "when to preempt age of information minimization under link capacity constraint":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "information freshness for timely detection of status changes")

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)