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: "database assisted distributed spectrum sharing"
  Abstract: According to FCC's ruling for white-space spectrum access, white-space devices are required to query a database to determine the spectrum availability. In this paper, we study the database-assisted distributed white-space access point (AP) network design. We first model the cooperative and non-cooperative channel selection problems among the APs as the system-wide throughput optimization and non-cooperative AP channel selection games, respectively, and design distributed AP channel selection algorithms that achieve system optimal point and Nash equilibrium, respectively. We then propose a state-based game formulation for the distributed AP association problem of the secondary users by taking the cost of mobility into account. We show that the state-based distributed AP association game has the finite improvement property, and design a distributed AP association algorithm that can converge to a state-based Nash equilibrium. Numerical results show that the algorithm is robust to the perturbation by secondary users' dynamical leaving and entering the system.

Connected through hyperedge HE-1 (induced by source paper "follow me at the edge mobility aware dynamic service placement for mobile edge computing"):
  with members:
    - "edge intelligence on demand deep learning model co inference with device edge synergy"
    - "efficient resource allocation for on demand mobile edge cloud computing"
    - "exploiting massive d2d collaboration for energy efficient mobile edge computing"
    - "emm energy aware mobility management for mobile edge computing in ultra dense networks"
    - "mobile edge computing a survey on architecture and computation offloading"
    - "toward hierarchical mobile edge computing an auction based profit maximization approach"
    - "dynamic service placement for mobile micro clouds with predicted future costs"
    - "a non stochastic learning approach to energy efficient mobility management"

Connected through hyperedge HE-2 (induced by source paper "distributed energy efficient cross layer optimization for multihop mimo cognitive radio networks with primary user rate protection"):
  with members:
    - "outage constrained robust transmit optimization for multiuser miso downlinks tractable approximations by conic optimization"
    - "dynamic resource allocation in cognitive radio networks"
    - "optimal spectrum sharing in mimo cognitive radio networks via semidefinite programming"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "cognitive mimo radio"

Connected through hyperedge HE-3 (induced by source paper "exploiting social tie structure for cooperative wireless networking a social group utility maximization framework"):
  with members:
    - "adaptive channel recommendation for opportunistic spectrum access"
    - "stable nash equilibria of medium access games under symmetric socially altruistic behavior"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "altruism in atomic congestion games"

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"
    - "cooperative topology control with adaptation for improved lifetime in wireless sensor networks"

Connected through hyperedge HE-5 (induced by source paper "database assisted spectrum access in dynamic networks a distributed learning solution"):
  with members:
    - "a game theoretic perspective on self organizing optimization for cognitive small cells"
    - "a hybrid pricing framework for tv white space database"

Connected through hyperedge HE-6 (induced by source paper "imitation based social spectrum sharing"):
  with members:
    - "dynamic profit maximization of cognitive mobile virtual network operator"
    - "investment and pricing with spectrum uncertainty a cognitive operator s perspective"
    - "let cognitive radios imitate imitation based spectrum access for cognitive radio networks"
    - "adaptive channel allocation spectrum etiquette for cognitive radio networks"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-7 (induced by source paper "flexauc serving dynamic demands in a spectrum trading market with flexible auction"):
  with members:
    - "competition with dynamic spectrum leasing"

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)