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 the delay advantage of coding in packet erasure networks"):
  Abstract: We consider the delay of network coding compared to routing with retransmissions in packet erasure networks with probabilistic erasures. We investigate the sub-linear term in the block delay required for unicasting $n$ packets and show that there is an unbounded gap between network coding and routing. In particular, we show that delay benefit of network coding scales at least as $\sqrt{n}$. Our analysis of the delay function for the routing strategy involves a major technical challenge of computing the expectation of the maximum of two negative binomial random variables. This problem has been studied previously and we derive the first exact characterization which may be of independent interest. We also use a martingale bounded differences argument to show that the actual coding delay is tightly concentrated around its expectation.

Includes members:
  Member "coding delay analysis of chunked codes over line networks":
    also connected through other hyperedges:
      (none)
  Member "how fast can dense codes achieve the min cut capacity of line networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coding delay analysis of chunked codes over line networks")
  Member "on the delay of network coding over line networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "when queueing meets coding optimal latency data retrieving scheme in storage clouds")
  Member "wireless erasure networks with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity of 1 to k broadcast packet erasure channels with channel output feedback")
  Member "network coding capacity of random wireless networks under a sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the delay of network coding over line networks")
  Member "bounds on the network coding capacity for wireless random networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the delay of network coding over line networks")
  Member "coding schemes for line networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random linear network coding for 5g mobile video delivery")
  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)