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: "distributed spectrum access with spatial reuse"
  Abstract: Efficient distributed spectrum sharing mechanism is crucial for improving the spectrum utilization. The spatial aspect of spectrum sharing, however, is less understood than many other aspects. In this paper, we generalize a recently proposed spatial congestion game framework to design efficient distributed spectrum access mechanisms with spatial reuse. We first propose a spatial channel selection game to model the distributed channel selection problem with fixed user locations. We show that the game is a potential game, and develop a distributed learning mechanism that converges to a Nash equilibrium only based on users' local observations. We then formulate the joint channel and location selection problem as a spatial channel selection and mobility game, and show that it is also a potential game. We next propose a distributed strategic mobility algorithm, jointly with the distributed learning mechanism, that can converge to a Nash equilibrium.

Connected through hyperedge HE-1 (induced by source paper "game of ages"):
  with members:
    - "age optimal updates of multiple information flows"
    - "content based status updates"
    - "update or wait how to keep your data fresh"
    - "the age of information real time status updating by multiple sources"

Connected through hyperedge HE-2 (induced by source paper "private and truthful aggregative game for large scale spectrum sharing"):
  with members:
    - "private matchings and allocations"
    - "asymptotically truthful equilibrium selection in large congestion games"
    - "calibrating data to sensitivity in private data analysis"
    - "mechanism design in large games incentives and privacy"

Connected through hyperedge HE-3 (induced by source paper "efficient and scalable distributed autonomous spatial aloha networks via local leader election"):
  with members:
    - "aloha games with spatial reuse"
    - "a game theoretic approach to distributed opportunistic scheduling"
    - "on the stability of contention resolution diversity slotted aloha crdsa"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-4 (induced by source paper "a comprehensive survey of potential game approaches to wireless networks"):
  with members:
    - "centralized distributed spectrum access for small cell networks a cloud based game solution"
    - "decentralized computation offloading game for mobile cloud computing"
    - "database assisted spectrum access in dynamic networks a distributed learning solution"
    - "joint channel selection and power control in infrastructureless wireless networks a multiplayer multiarmed bandit framework"
    - "distributed learning algorithms for spectrum sharing in spatial random access wireless networks"
    - "spatial spectrum access game"
    - "joint access point selection and power allocation for uplink wireless networks"
    - "database assisted distributed spectrum sharing"

Connected through hyperedge HE-5 (induced by source paper "distributed learning algorithms for spectrum sharing in spatial random access wireless networks"):
  with members:
    - "fast responsive decentralised graph colouring"
    - "learning based constraint satisfaction with sensing restrictions"
    - "distributed game theoretic optimization and management of multichannel aloha networks"
    - "cooperative game theory and the gaussian interference channel"
    - "bargaining over the interference channel"

Connected through hyperedge HE-6 (induced by source paper "distributed spectrum access for cognitive small cell networks a robust graphical game approach"):
  with members:
    - "coalitional games with overlapping coalitions for interference management in small cell networks"

Connected through hyperedge HE-7 (induced by source paper "quality of service games for spectrum sharing"):
  with members:
    - "quality of service provisioning in decentralized networks a satisfaction equilibrium approach"
    - "evolutionarily stable spectrum access"
    - "adaptive channel recommendation for opportunistic spectrum access"

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)