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: "feedback based online network coding"
  Abstract: Current approaches to the practical implementation of network coding are batch-based, and often do not use feedback, except possibly to signal completion of a file download. In this paper, the various benefits of using feedback in a network coded system are studied. It is shown that network coding can be performed in a completely online manner, without the need for batches or generations, and that such online operation does not affect the throughput. Although these ideas are presented in a single-hop packet erasure broadcast setting, they naturally extend to more general lossy networks which employ network coding in the presence of feedback. The impact of feedback on queue size at the sender and decoding delay at the receivers is studied. Strategies for adaptive coding based on feedback are presented, with the goal of minimizing the queue size and delay. The asymptotic behavior of these metrics is characterized, in the limit of the traffic load approaching capacity. Different notions of decoding delay are considered, including an order-sensitive notion which assumes that packets are useful only when delivered in order. Our work may be viewed as a natural extension of Automatic Repeat reQuest (ARQ) schemes to coded networks.

Connected through hyperedge HE-1 (induced by source paper "on the probability of partial decoding in sparse network coding"):
  with members:
    - "reliability of broadcast communications under sparse random linear network coding"
    - "analysis and optimization of sparse random linear network coding for reliable multicast services"
    - "probability of partially decoding network coded messages"
    - "binary systematic network coding for progressive packet decoding"
    - "intermediate performance of rateless codes"

Connected through hyperedge HE-2 (induced by source paper "high throughput low delay wireless multicast via multi channel moving window codes"):
  with members:
    - "throughput optimal broadcast in wireless networks with dynamic topology"
    - "analysis and optimization of sparse random linear network coding for reliable multicast services"
    - "constant delay and constant feedback moving window network coding for wireless multicast design and asymptotic analysis"
    - "throughput of rateless codes over broadcast erasure channels"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "arq for network coding"

Connected through hyperedge HE-3 (induced by source paper "constant delay and constant feedback moving window network coding for wireless multicast design and asymptotic analysis"):
  with members:
    - "scheduling of multicast and unicast services under limited feedback by using rateless codes"
    - "network control without csi using rateless codes for downlink cellular systems"
    - "the effect of block wise feedback on the throughput delay trade off in streaming"
    - "throughput of rateless codes over broadcast erasure channels"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "three schemes for wireless coded broadcast to heterogeneous users"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "network coding meets tcp"

Connected through hyperedge HE-4 (induced by source paper "completion delay minimization for instantly decodable network codes"):
  with members:
    - "on the complexity of solving markov decision problems"
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "coding opportunity densification strategies for instantly decodable network coding"
    - "capacity of 1 to k broadcast packet erasure channels with channel output feedback"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "effective delay control in online network coding"
    - "informed network coding for minimum decoding delay"
    - "arq for network coding"

Connected through hyperedge HE-5 (induced by source paper "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"):
  with members:
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"
    - "arq for network coding"
    - "random linear network coding for time division duplexing when to stop talking and start listening"

Connected through hyperedge HE-6 (induced by source paper "instantly decodable versus random linear network coding a comparative framework for throughput and decoding delay performance"):
  with members:
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"
    - "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.NI(Networking and Internet Architecture)