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 "beyond the min cut bound deterministic network coding for asynchronous multirate broadcast"):
  Abstract: In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide multirate packet delivery outside of what is given by the network min-cut. This is achieved by using a deterministic non-block-based network coding scheme, which allows us to sidestep some of the limitations put in place by the block coding model used to determine the network capacity. #R##N#Under the network coding scheme we outline, the sender is able to transmit network coded packets above the channel rate of some receivers, while ensuring that they still experience nonzero delivery rates. Interestingly, in this generalised form of asynchronous network coded broadcast, receivers are not required to obtain knowledge of all packets transmitted so far. Instead, causal feedback from the receivers about packet erasures is used by the sender to determine a network coded transmission that will allow at least one, but often multiple receivers, to deliver their next needed packet. #R##N#Although the analysis of deterministic coding schemes is generally a difficult problem, by making some approximations we are able to obtain tractable estimates of the receivers' delivery rates, which are shown to match reasonably well with simulation. Using these estimates, we design a fairness algorithm that allocates the sender's resources so all receivers will experience fair delivery rate performance.

Includes members:
  Member "joint coding and scheduling optimization in wireless systems with varying delay sensitivities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive causal network coding with feedback")
  Member "throughput delay analysis of random linear network coding for wireless broadcasting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "delay complexity trade off of random linear network coding in wireless broadcast")
  Member "effective delay control in online network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reliability of multicast under random linear network coding")
  Member "arq for network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tiny codes for guaranteeable delay")
  Member "random linear network coding for time division duplexing when to stop talking and start listening":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks")
  Member "intermediate performance of rateless codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "low density majority codes and the problem of graceful degradation")
  Member "on coding for reliable communication over packet networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adaptive causal network coding with feedback")

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)