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 "delay on broadcast erasure channels under random linear combinations"):
  Abstract: We consider a transmitter broadcasting random linear combinations (over a field of size    $d$   ) formed from a block of    $c$    packets to a collection of    $n$    receivers, where the channels between the transmitter and each receiver are independent erasure channels with reception probabilities    $ \mathrm {q}= (q_{1},\ldots ,q_{n})$   . We establish several properties of the random delay until all    $n$    receivers have recovered all    $c$    packets, denoted    $Y_{n:n}^{(c)}$   . First, we provide lower and upper bounds, exact expressions, and a recurrence for the moments of    $Y_{n:n}^{(c)}$   . Second, we study the delay per packet    $Y_{n:n}^{(c)}/c$    as a function of    $c$   , including the asymptotic delay (as    $c \to \infty $   ) and monotonicity (in    $c$   ) properties of the delay per packet. Third, we employ extreme value theory to investigate    $Y_{n:n}^{(c)}$    as a function of    $n$    (as    $n \to \infty $   ). Several results are new, some results are extensions of existing results, and some results are the proofs of known results using new (probabilistic) proof techniques.

Includes members:
  Member "on the delay advantage of coding in packet erasure networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive causal network coding with feedback")
  Member "throughput of rateless codes over broadcast erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "high throughput low delay wireless multicast via multi channel moving window codes")
  Member "throughput delay analysis of random linear network coding for wireless broadcasting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "delay complexity trade off of random linear network coding in wireless broadcast")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")

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)