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: "approximation algorithms for wireless link scheduling with flexible data rates"
  Abstract: We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise ratio (SINR). Each wireless link has a utility function mapping SINR values to the respective data rates. We have to decide which transmissions are performed simultaneously and (depending on the problem variant) also which transmission powers are used. #R##N#In the capacity-maximization problem, one strives to maximize the overall network throughput, i.e., the summed utility of all links. For arbitrary utility functions (not necessarily continuous ones), we present an O(log n)-approximation when having n communication requests. This algorithm is built on a constant-factor approximation for the special case of the respective problem where utility functions only consist of a single step. In other words, each link has an individual threshold and we aim at maximizing the number of links whose threshold is satisfied. On the way, this improves the result in [Kesselheim, SODA 2011] by not only extending it to individual thresholds but also showing a constant approximation factor independent of assumptions on the underlying metric space or the network parameters. #R##N#In addition, we consider the latency-minimization problem. Here, each link has a demand, e.g., representing an amount of data. We have to compute a schedule of shortest possible length such that for each link the demand is fulfilled, that is the overall summed utility (or data transferred) is at least as large as its demand. Based on the capacity-maximization algorithm, we show an O(log^2 n)-approximation for this problem.

Connected through hyperedge HE-1 (induced by source paper "wireless link capacity under shadowing and fading"):
  with members:
    - "3d channel model in 3gpp"
    - "beyond geometry towards fully realistic wireless models"
    - "a fully distributed algorithm for throughput performance in wireless networks"
    - "dynamic packet scheduling in wireless networks"
    - "algorithms for wireless capacity"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless connectivity and capacity"
    - "wireless capacity with oblivious power in general metrics"

Connected through hyperedge HE-2 (induced by source paper "wireless aggregation at nearly constant rate"):
  with members:
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "towards tight bounds for local broadcasting"
    - "percolation and connectivity on the signal to interference ratio graph"
    - "algorithms for wireless capacity"
    - "wireless connectivity and capacity"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

Connected through hyperedge HE-3 (induced by source paper "the price of local power control in wireless scheduling"):
  with members:
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "wireless scheduling algorithms in complex environments"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "the power of non uniform wireless power"
    - "towards tight bounds for local broadcasting"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "algorithms for wireless capacity"

Connected through hyperedge HE-4 (induced by source paper "beyond geometry towards fully realistic wireless models"):
  with members:
    - "wireless scheduling algorithms in complex environments"
    - "jamming resistant learning in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "distributed connectivity of wireless networks"
    - "mlls minimum length link scheduling under physical interference model"
    - "the power of non uniform wireless power"
    - "a fully distributed algorithm for throughput performance in wireless networks"

Connected through hyperedge HE-5 (induced by source paper "how well can graphs represent wireless interference"):
  with members:
    - "beyond geometry towards fully realistic wireless models"
    - "wireless scheduling algorithms in complex environments"
    - "dynamic packet scheduling in wireless networks"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "algorithms for wireless capacity"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless connectivity and capacity"

Connected through hyperedge HE-6 (induced by source paper "the power of non uniform wireless power"):
  with members:
    - "distributed connectivity of wireless networks"
    - "dynamic packet scheduling in wireless networks"
    - "wireless network stability in the sinr model"
    - "on the problem of wireless scheduling with linear power levels"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "the topology of wireless communication"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless connectivity and capacity"

Connected through hyperedge HE-7 (induced by source paper "dynamic packet scheduling in wireless networks"):
  with members:
    - "randomized communication in radio networks"
    - "a fully distributed algorithm for throughput performance in wireless networks"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "on a game theoretic approach to capacity maximization in wireless networks"
    - "approximation algorithms for secondary spectrum auctions"

Connected through hyperedge HE-8 (induced by source paper "algorithms for wireless capacity"):
  with members:
    - "the power of non uniform wireless power"
    - "a fully distributed algorithm for throughput performance in wireless networks"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless connectivity and capacity"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "on a game theoretic approach to capacity maximization in wireless networks"
    - "approximation algorithms for secondary spectrum auctions"

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)