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: "arq for network coding"
  Abstract: A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with link-by-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion of a node ldquoseeingrdquo a packet is introduced. In terms of this idea, our algorithm may be viewed as a natural extension of ARQ schemes to coded networks. Our approach, known as the drop-when-seen algorithm, is compared with a baseline queuing approach called drop-when-decoded. It is shown that the expected queue size for our approach is O[(1)/(1-rho)] as opposed to Omega[(1)/(1-rho)2] for the baseline approach, where rho is the load factor.

Connected through hyperedge HE-1 (induced by source paper "tiny codes for guaranteeable delay"):
  with members:
    - "resource allocation and harq optimization for urllc traffic in 5g wireless networks"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "the sky is not the limit lte for unmanned aerial vehicles"
    - "arq with cumulative feedback to compensate for burst errors"
    - "complete mdp convolutional codes"
    - "throughput maximization for delay sensitive random access communication"
    - "analysis of feedback error in automatic repeat request"
    - "low delay random linear coding over a stream"

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"
    - "feedback based online network coding"

Connected through hyperedge HE-3 (induced by source paper "arq with cumulative feedback to compensate for burst errors"):
  with members:
    - "what will 5g be"
    - "coding schemes for line networks"

Connected through hyperedge HE-4 (induced by source paper "throughput region of spatially correlated interference packet networks"):
  with members:
    - "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit"
    - "optimal sum dof of the k user miso bc with current and delayed feedback"
    - "optimal dof of the k user broadcast channel with delayed and imperfect current csit"
    - "when does spatial correlation add value to delayed channel state information"
    - "two user erasure interference channels with local delayed csit"
    - "transmit beamforming for miso broadcast channels with statistical and delayed csit"
    - "informational bottlenecks in two unicast wireless networks with delayed csit"
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"

Connected through hyperedge HE-5 (induced by source paper "multirate packet delivery in heterogeneous broadcast networks"):
  with members:
    - "network coded multiple access"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "completion delay minimization for instantly decodable network codes"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"
    - "online network coding for optimal throughput and delay the three receiver case"
    - "intermediate performance of rateless codes"

Connected through hyperedge HE-6 (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"
    - "on throughput and decoding delay performance of instantly decodable network coding"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"

Connected through hyperedge HE-7 (induced by source paper "arq for physical layer network coding"):
  with members:
    - "network codes for real time applications"
    - "joint channel estimation and channel decoding in physical layer network coding systems an em bp factor graph framework"
    - "asynchronous convolutional coded physical layer network coding"
    - "asynchronous physical layer network coding with quasi cyclic codes"
    - "building blocks of physical layer network coding"
    - "distributed mac protocol supporting physical layer network coding"
    - "asynchronous physical layer network coding"
    - "reliable physical layer network coding"

Connected through hyperedge HE-8 (induced by source paper "streaming codes for multicast over burst erasure channels"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "robust streaming erasure codes based on deterministic channel approximations"
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"
    - "linear error correcting codes with anytime reliability"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"
    - "rateless codes for single server streaming to diverse users"
    - "doped fountain coding for minimum delay data collection in circular networks"

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)