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: "wireless scheduling with power control"
  Abstract: We consider the scheduling of arbitrary wireless links in the physical model of interference to minimize the time for satisfying all requests. We study here the combined problem of scheduling and power control, where we seek both an assignment of power settings and a partition of the links so that each set satisfies the signal-to-interference-plus-noise (SINR) constraints. #R##N#We give an algorithm that attains an approximation ratio of $O(\log n \cdot \log\log \Delta)$, where $n$ is the number of links and $\Delta$ is the ratio between the longest and the shortest link length. Under the natural assumption that lengths are represented in binary, this gives the first approximation ratio that is polylogarithmic in the size of the input. The algorithm has the desirable property of using an oblivious power assignment, where the power assigned to a sender depends only on the length of the link. We give evidence that this dependence on $\Delta$ is unavoidable, showing that any reasonably-behaving oblivious power assignment results in a $\Omega(\log\log \Delta)$-approximation. #R##N#These results hold also for the (weighted) capacity problem of finding a maximum (weighted) subset of links that can be scheduled in a single time slot. In addition, we obtain improved approximation for a bidirectional variant of the scheduling problem, give partial answers to questions about the utility of graphs for modeling physical interference, and generalize the setting from the standard 2-dimensional Euclidean plane to doubling metrics. Finally, we explore the utility of graph models in capturing wireless interference.

Connected through hyperedge HE-1 (induced by source paper "effective wireless scheduling via hypergraph sketches"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "jamming resistant learning in wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "dynamic packet scheduling in wireless networks"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"

Connected through hyperedge HE-2 (induced by source paper "spanning trees with edge conflicts and wireless connectivity"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "dynamic packet scheduling in wireless networks"
    - "algorithms for wireless capacity"
    - "graph products revisited tight approximation hardness of induced matching poset dimension and more"

Connected through hyperedge HE-3 (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"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "universal framework for wireless scheduling problems"):
  with members:
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "opportunity cost algorithms for combinatorial auctions"

Connected through hyperedge HE-5 (induced by source paper "data dissemination in unified dynamic wireless networks"):
  with members:
    - "leveraging multiple channels in ad hoc networks"
    - "distributed bare bones communication in wireless networks"
    - "a local broadcast layer for the sinr network model"
    - "distributed communication in bare bones wireless networks"
    - "multi message broadcast with abstract mac layers and unreliable links"
    - "randomized broadcast in radio networks with collision detection"
    - "beyond geometry towards fully realistic wireless models"
    - "radio network lower bounds made easy"

Connected through hyperedge HE-6 (induced by source paper "leveraging multiple channels in ad hoc networks"):
  with members:
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "distributed connectivity of wireless networks"
    - "towards tight bounds for local broadcasting"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "wireless connectivity and capacity"

Connected through hyperedge HE-7 (induced by source paper "maximal packing with interference constraints"):
  with members:
    - "how well can graphs represent wireless interference"
    - "algorithms for wireless capacity"
    - "wireless capacity with arbitrary gain matrix"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

Connected through hyperedge HE-8 (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"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "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"

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)