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: "on throughput and decoding delay performance of instantly decodable network coding"
  Abstract: In this paper, a comprehensive study of packet-based instantly decodable network coding (IDNC) for single-hop wireless broadcast is presented. The optimal IDNC solution in terms of throughput is proposed and its packet decoding delay performance is investigated. Lower and upper bounds on the achievable throughput and decoding delay performance of IDNC are derived and assessed through extensive simulations. Furthermore, the impact of receivers' feedback frequency on the performance of IDNC is studied and optimal IDNC solutions are proposed for scenarios where receivers' feedback is only available after and IDNC round, composed of several coded transmissions. However, since finding these IDNC optimal solutions is computational complex, we further propose simple yet efficient heuristic IDNC algorithms. The impact of system settings and parameters such as channel erasure probability, feedback frequency, and the number of receivers is also investigated and simple guidelines for practical implementations of IDNC are proposed.

Connected through hyperedge HE-1 (induced by source paper "decoding and file transfer delay balancing in network coding broadcast"):
  with members:
    - "on minimizing the average packet decoding delay in wireless network coded broadcast"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "arq for network coding"

Connected through hyperedge HE-2 (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"
    - "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"
    - "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-3 (induced by source paper "from instantly decodable to random linear network coding"):
  with members:
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "informed network coding for minimum decoding delay"

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)