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: "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
  Abstract: In modern wireless networks, devices are able to set the power for each transmission carried out. Experimental but also theoretical results indicate that such power control can improve the network capacity significantly. We study this problem in the physical interference model using SINR constraints. #R##N#In the SINR capacity maximization problem, we are given n pairs of senders and receivers, located in a metric space (usually a so-called fading metric). The algorithm shall select a subset of these pairs and choose a power level for each of them with the objective of maximizing the number of simultaneous communications. This is, the selected pairs have to satisfy the SINR constraints with respect to the chosen powers. #R##N#We present the first algorithm achieving a constant-factor approximation in fading metrics. The best previous results depend on further network parameters such as the ratio of the maximum and the minimum distance between a sender and its receiver. Expressed only in terms of n, they are (trivial) Omega(n) approximations. #R##N#Our algorithm still achieves an O(log n) approximation if we only assume to have a general metric space rather than a fading metric. Furthermore, by using standard techniques the algorithm can also be used in single-hop and multi-hop scheduling scenarios. Here, we also get polylog(n) approximations.

Connected through hyperedge HE-1 (induced by source paper "reception capacity definitions game theory and hardness"):
  with members:
    - "how well can graphs represent wireless interference"
    - "algorithms for wireless capacity"
    - "wireless capacity with arbitrary gain matrix"
    - "wireless connectivity and capacity"
    - "wireless capacity with oblivious power in general metrics"
    - "on a game theoretic approach to capacity maximization in wireless networks"

Connected through hyperedge HE-2 (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-3 (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-4 (induced by source paper "scheduling wireless links in the physical interference model by fractional edge coloring"):
  with members:
    - "scheduling wireless links by vertex multicoloring in the physical interference model"
    - "scheduling links for heavy traffic on interfering routes in wireless mesh networks"
    - "algorithms for wireless capacity"

Connected through hyperedge HE-5 (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-6 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates"):
  with members:
    - "achieving dilution without knowledge of coordinates in the sinr model"
    - "deterministic backbone creation in an sinr network without knowledge of location"
    - "multi broadcasting under the sinr model"
    - "distributed communication in bare bones wireless networks"
    - "almost optimal cover free families"
    - "beyond geometry towards fully realistic wireless models"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"

Connected through hyperedge HE-7 (induced by source paper "deterministic digital clustering of wireless ad hoc networks"):
  with members:
    - "a local broadcast layer for the sinr network model"
    - "how well can graphs represent wireless interference"
    - "batched point location in sinr diagrams via algebraic tools"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "competitive mac under adversarial sinr"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "towards tight bounds for local broadcasting"
    - "deploying wireless networks with beeps"

Connected through hyperedge HE-8 (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"
    - "wireless scheduling with power control"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "opportunity cost algorithms for combinatorial 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)