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: "in order packet delivery in instantly decodable network coded systems over wireless broadcast"
  Abstract: In this paper, we study in-order packet delivery in instantly decodable network coded systems for wireless broadcast networks. We are interested in applications, in which the successful delivery of a packet depends on the correct reception of this packet and all its preceding packets. We formulate the problem of minimizing the number of undelivered packets to all receivers over all transmissions until completion as a stochastic shortest path (SSP) problem. Although finding the optimal packet selection policy using SSP is computationally complex, it allows us to systematically exploit the problem structure and draw guidelines for efficient packet selection policies that can reduce the number of undelivered packets to all receivers over all transmissions until completion. According to these guidelines, we design a simple heuristic packet selection algorithm. Simulation results illustrate that our proposed algorithm provides quicker packet delivery to the receivers compared to the existing algorithms in the literature.

Connected through hyperedge HE-1 (induced by source paper "delivery time reduction for order constrained applications using binary network codes"):
  with members:
    - "completion time reduction in instantly decodable network coding through decoding delay control"
    - "completion delay minimization for instantly decodable network codes"
    - "online network coding for optimal throughput and delay the three receiver case"
    - "random linear network coding a free cipher"

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.NI(Networking and Internet Architecture)