human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "round robin streaming with generations"
  Abstract: We consider three types of application layer coding for streaming over lossy links: random linear coding, systematic random linear coding, and structured coding. The file being streamed is divided into sub-blocks (generations). Code symbols are formed by combining data belonging to the same generation, and transmitted in a round-robin fashion. We compare the schemes based on delivery packet count, net throughput, and energy consumption for a range of generation sizes. We determine these performance measures both analytically and in an experimental configuration. We find our analytical predictions to match the experimental results. We show that coding at the application layer brings about a significant increase in net data throughput, and thereby reduction in energy consumption due to reduced communication time. On the other hand, on devices with constrained computing resources, heavy coding operations cause packet drops in higher layers and negatively affect the net throughput. We find from our experimental results that low-rate MDS codes are best for small generation sizes, whereas systematic random linear coding has the best net throughput and lowest energy consumption for larger generation sizes due to its low decoding complexity.

Connected through hyperedge HE-1 (induced by source paper "optimal finite length coding rate of random linear network coding schemes"):
  with members:
    - "coding schemes for line networks"

Connected through hyperedge HE-2 (induced by source paper "layered constructions for low delay streaming codes"):
  with members:
    - "streaming codes for multicast over burst erasure channels"
    - "robust streaming erasure codes based on deterministic channel approximations"
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"
    - "linear error correcting codes with anytime reliability"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"
    - "rateless codes for single server streaming to diverse users"
    - "doped fountain coding for minimum delay data collection in circular networks"

Connected through hyperedge HE-3 (induced by source paper "the benefit of limited feedback to generation based random linear network coding in wireless broadcast"):
  with members:
    - "speeding multicast by acknowledgment reduction technique smart"
    - "overlapped chunked network coding"
    - "sparse network coding with overlapping classes"

Connected through hyperedge HE-4 (induced by source paper "on deterministic linear network coded broadcast and its relation to matroid theory"):
  with members:
    - "linear network coding linear index coding and representable discrete polymatroids"
    - "on throughput and decoding delay performance of instantly decodable network coding"
    - "an equivalence between network coding and index coding"
    - "generation of innovative and sparse encoding vectors for broadcast systems with feedback"
    - "online network coding for optimal throughput and delay the three receiver case"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (induced by source paper "robust streaming erasure codes based on deterministic channel approximations"):
  with members:
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"

Question: Please tell me which class the center node 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)