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: "partially blind instantly decodable network codes for lossy feedback environment"
  Abstract: In this paper, we study the multicast completion and decoding delay minimization problems of instantly decodable network coding (IDNC) in the case of lossy feedback. In such environments, the sender falls into uncertainties about packet reception at the different receivers, which forces it to perform partially blind selections of packet combinations in subsequent transmissions. To determine efficient partially blind policies that handle the completion and decoding delays of IDNC in such environment, we first extend the perfect feedback formulation in [2], [3] to the lossy feedback environment, by incorporating the uncertainties resulting from unheard feedback events in these formulations. For the completion delay problem, we use this formulation to identify the maximum likelihood state of the network in events of unheard feedback, and employ it to design a partially blind graph update extension to the multicast IDNC algorithm in [3]. For the decoding delay problem, we derive an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to derive the optimal policy to reduce the decoding delay in such lossy feedback environment. Results show that our proposed solution both outperforms other approaches and achieves a tolerable degradation even at relatively high feedback loss rates.

Connected through hyperedge HE-1 (induced by source paper "data dissemination using instantly decodable binary codes in fog radio access networks"):
  with members:
    - "bandwidth management vms live migration in wireless fog computing for 5g networks"
    - "fog computing based radio access networks issues and challenges"
    - "rate aware instantly decodable network codes"
    - "on minimizing the maximum broadcast decoding delay for instantly decodable network coding"
    - "a survey on device to device communication in cellular networks"
    - "delay reduction in multi hop device to device communication using network coding"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "instantly decodable network coding for real time scalable video broadcast over wireless networks"):
  with members:
    - "resource allocation frameworks for network coded layered multimedia multicast services"
    - "adaptive prioritized random linear coding and scheduling for layered data delivery from multiple servers"
    - "fulcrum network codes a code for fluid allocation of complexity"
    - "coding based data broadcasting for time critical applications with rate adaptation"
    - "random linear network coding for wireless layered video broadcast general design methods for adaptive feedback free transmission"
    - "network coding meets multimedia a review"
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "completion delay minimization for instantly decodable network codes"

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 "delay reduction in multi hop device to device communication using network coding"):
  with members:
    - "fundamental green tradeoffs progresses challenges and impacts on 5g networks"
    - "data dissemination using instantly decodable binary codes in fog radio access networks"
    - "an overview of sustainable green 5g networks"
    - "rate aware instantly decodable network codes"
    - "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"
    - "completion time reduction in instantly decodable network coding through decoding delay control"

Connected through hyperedge HE-5 (induced by source paper "a game theoretic framework for decentralized cooperative data exchange using network coding"):
  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"
    - "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"
    - "delay minimization for instantly decodable network coding in persistent channels with feedback intermittence"
    - "reinforcement learning a survey"

Connected through hyperedge HE-6 (induced by source paper "a game theoretic approach to minimize the completion time of network coded cooperative data exchange"):
  with members:
    - "on minimizing the maximum broadcast decoding delay for instantly decodable network coding"
    - "completion time reduction in instantly decodable network coding through decoding delay control"
    - "a lossy graph model for delay reduction in generalized instantly decodable network coding"
    - "exchanging third party information with minimum transmission cost"
    - "joint rate selection and wireless network coding for time critical applications"

Connected through hyperedge HE-7 (induced by source paper "on minimizing the maximum broadcast decoding delay for instantly decodable network coding"):
  with members:
    - "a lossy graph model for delay reduction in generalized instantly decodable network coding"

Connected through hyperedge HE-8 (induced by source paper "decoding delay controlled reduction of completion time in instantly decodable network coding"):
  with members:
    - "completion time reduction in instantly decodable network coding through decoding delay control"

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)