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: "throughput of rateless codes over broadcast erasure channels"
  Abstract: In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov modulated erasure channel that is i.i.d. across users, but can be correlated in time. We characterize the system throughput asymptotically in n. Specifically, we explicitly show how the throughput behaves for different values of the coding block size K as a function of n, as n approaches infinity. For finite values of K and n, under the more restrictive assumption of Gilbert-Elliott channels, we are able to provide a lower bound on the maximum achievable throughput. Using simulations we show the tightness of the bound with respect to system parameters n and K, and find that its performance is significantly better than the previously known lower bounds.

Connected through hyperedge HE-1 (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"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "feedback based online network coding"
    - "arq for network coding"

Connected through hyperedge HE-2 (induced by source paper "delay optimal scheduling for chunked random linear network coding broadcast"):
  with members:
    - "optimal control for network coding broadcast"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "sparse network coding with overlapping classes"

Connected through hyperedge HE-3 (induced by source paper "delay on broadcast erasure channels under random linear combinations"):
  with members:
    - "on the delay advantage of coding in packet erasure networks"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-4 (induced by source paper "to motivate social grouping in wireless networks"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "incentivizing sharing in realtime d2d streaming networks a mean field game perspective"
    - "dynamic index coding for wireless broadcast networks"
    - "femtocaching wireless video content delivery through distributed caching helpers"

Connected through hyperedge HE-5 (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"
    - "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"
    - "effective delay control in online network coding"

Connected through hyperedge HE-6 (induced by source paper "scheduling of multicast and unicast services under limited feedback by using rateless codes"):
  with members:
    - "network control without csi using rateless codes for downlink cellular systems"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "de randomizing shannon the design and analysis of a capacity achieving rateless code"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "zero rate feedback can achieve the empirical capacity"

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)