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: "online network coding for optimal throughput and delay the three receiver case"
  Abstract: For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an asymptotically optimal average decoding delay at the receivers. We consider heavy traffic asymptotics, where the load factor \rho approaches 1 from below with either the arrival rate (\lambda) or the channel parameter (\mu) being fixed at a number less than 1. We verify through simulations that our algorithm achieves an asymptotically optimal decoding delay of O(1/(1-\rho)).

Connected through hyperedge HE-1 (induced by source paper "multirate packet delivery in heterogeneous broadcast networks"):
  with members:
    - "network coded multiple access"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "completion delay minimization for instantly decodable network codes"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"
    - "arq for network coding"
    - "intermediate performance of rateless codes"

Connected through hyperedge HE-2 (induced by source paper "delivery time reduction for order constrained applications using binary network codes"):
  with members:
    - "in order packet delivery in instantly decodable network coded systems over wireless broadcast"
    - "completion time reduction in instantly decodable network coding through decoding delay control"
    - "completion delay minimization for instantly decodable network codes"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-3 (induced by source paper "rate aware instantly decodable network codes"):
  with members:
    - "on minimizing the maximum broadcast decoding delay for instantly decodable network coding"
    - "decoding delay controlled reduction of completion time in instantly decodable network coding"
    - "a game theoretic framework for decentralized cooperative data exchange using network coding"
    - "delay reduction in multi hop device to device communication using network coding"
    - "coding based data broadcasting for time critical applications with rate adaptation"
    - "completion time reduction in instantly decodable network coding through decoding delay control"
    - "a game theoretic approach to minimize the completion time of network coded cooperative data exchange"
    - "a lossy graph model for delay reduction in generalized instantly decodable network coding"

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"
    - "round robin streaming with generations"
    - "generation of innovative and sparse encoding vectors for broadcast systems with feedback"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (induced by source paper "throughput smoothness trade offs in multicasting of an ordered packet stream"):
  with members:
    - "the effect of block wise feedback on the throughput delay trade off in streaming"
    - "effective delay control in online network coding"

Connected through hyperedge HE-6 (induced by source paper "completion time reduction in instantly decodable network coding through decoding delay control"):
  with members:
    - "partially blind instantly decodable network codes for lossy feedback environment"

Connected through hyperedge HE-7 (induced by source paper "delay minimization for instantly decodable network coding in persistent channels with feedback intermittence"):
  with members:
    - "partially blind instantly decodable network codes for lossy feedback environment"
    - "completion delay minimization for instantly decodable network codes"

Connected through hyperedge HE-8 (induced by source paper "partially blind instantly decodable network codes for lossy feedback environment"):
  with members:
    - "completion delay minimization for instantly decodable network codes"

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)