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: "on a game theoretic approach to capacity maximization in wireless networks"
  Abstract: We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless networks where a transmission is successful only if the signal-to-interference-plus-noise ratio at the receiver is greater than some threshold. We study a game theoretic approach towards capacity maximization introduced by Andrews and Dinitz (INFOCOM 2009) and Dinitz (INFOCOM 2010). We prove vastly improved bounds for the game theoretic algorithm. In doing so, we achieve the first distributed constant factor approximation algorithm for capacity maximization for the uniform power assignment. When compared to the optimum where links may use an arbitrary power assignment, we prove a $O(\log \Delta)$ approximation, where $\Delta$ is the ratio between the largest and the smallest link in the network. This is an exponential improvement of the approximation factor compared to existing results for distributed algorithms. All our results work for links located in any metric space. In addition, we provide simulation studies clarifying the picture on distributed algorithms for capacity maximization.

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"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

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 "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 "reception capacity through perfect domination"):
  with members:
    - "how well can graphs represent wireless interference"
    - "braess s paradox in wireless networks the danger of improved technology"
    - "algorithms for wireless capacity"
    - "wireless capacity with arbitrary gain matrix"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "smoothness for simultaneous composition of mechanisms with admission"):
  with members:
    - "learning and efficiency in games with dynamic population"
    - "no regret learning in bayesian games"
    - "learning in auctions regret is hard envy is easy"
    - "on the complexity of computing an equilibrium in combinatorial auctions"
    - "jamming resistant learning in wireless networks"
    - "tight bounds for the price of anarchy of simultaneous first price auctions"
    - "bounding the inefficiency of outcomes in generalized second price auctions"
    - "composable and efficient mechanisms"

Connected through hyperedge HE-6 (induced by source paper "an online approach to dynamic channel access and transmission scheduling"):
  with members:
    - "optimal exploration exploitation in a multi armed bandit problem with non stationary rewards"
    - "sufficient conditions on the optimality of myopic sensing in opportunistic channel access a unifying framework"
    - "jamming resistant learning in wireless networks"
    - "to stay or to switch multiuser dynamic channel access"
    - "performance and convergence of multi user online learning"

Connected through hyperedge HE-7 (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"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "distributed connectivity of wireless networks"
    - "mlls minimum length link scheduling under physical interference model"
    - "the power of non uniform wireless power"

Connected through hyperedge HE-8 (induced by source paper "on spatial capacity of wireless ad hoc networks with threshold based scheduling"):
  with members:
    - "spatial throughput characterization in cognitive radio networks with threshold based opportunistic spectrum access"
    - "exploiting regional differences a spatially adaptive random access"
    - "adaptive spatial aloha fairness and stochastic geometry"
    - "analytical modeling of uplink cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "an overview of the transmission capacity of wireless networks"
    - "fractional power control for decentralized wireless networks"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc 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.DS(Data Structures and Algorithms)