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: "algorithms for wireless capacity"
  Abstract: In this paper we address two basic questions in wireless communication: First, how long does it take to schedule an arbitrary set of communication requests? Second, given a set of communication requests, how many of them can be scheduled concurrently? Our results are derived in an interference model with geometric path loss and consist of efficient algorithms that find a constant approximation for the second problem and a logarithmic approximation for the first problem. In addition, we analyze some important properties of the interference model and show that it is robust to various factors that can influence the signal attenuation. More specifically, we prove that as long as such influences on the signal attenuation are constant, they affect the capacity only by a constant factor.

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"
    - "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"
    - "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"
    - "graph products revisited tight approximation hardness of induced matching poset dimension and more"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"

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

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"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless connectivity and capacity"
    - "wireless capacity with oblivious power in general metrics"

Connected through hyperedge HE-6 (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"
    - "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"
    - "on a game theoretic approach to capacity maximization in wireless networks"

Connected through hyperedge HE-7 (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"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "towards tight bounds for local broadcasting"
    - "percolation and connectivity on the signal to interference ratio graph"
    - "wireless connectivity and capacity"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

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

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)