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: "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks"
  Abstract: Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent trade off between the gains in terms of probability of detection of the primary user (PU) and the costs in terms of false alarm probability. In this paper, we study the impact of this trade off on the topology and the dynamics of a network of SUs seeking to reduce the interference on the PU through collaborative sensing. Moreover, while existing literature mainly focused on centralized solutions for collaborative sensing, we propose distributed collaboration strategies through game theory. We model the problem as a non-transferable coalitional game, and propose a distributed algorithm for coalition formation through simple merge and split rules. Through the proposed algorithm, SUs can autonomously collaborate and self-organize into disjoint independent coalitions, while maximizing their detection probability taking into account the cooperation costs (in terms of false alarm). We study the stability of the resulting network structure, and show that a maximum number of SUs per formed coalition exists for the proposed utility model. Simulation results show that the proposed algorithm allows a reduction of up to 86.6% of the average missing probability per SU (probability of missing the detection of the PU) relative to the non-cooperative case, while maintaining a certain false alarm level. In addition, through simulations, we compare the performance of the proposed distributed solution with respect to an optimal centralized solution that minimizes the average missing probability per SU. Finally, the results also show how the proposed algorithm autonomously adapts the network topology to environmental changes such as mobility.

Connected through hyperedge HE-1 (induced by source paper "location privacy in cognitive radio networks a survey"):
  with members:
    - "preserving the location privacy of secondary users in cooperative spectrum sensing"
    - "an efficient technique for protecting location privacy of cooperative spectrum sensing users"
    - "securefind secure and privacy preserving object finding via mobile crowdsourcing"
    - "lpos location privacy for optimal sensing in cognitive radio networks"
    - "geo indistinguishability differential privacy for location based systems"
    - "security of spectrum learning in cognitive radios"
    - "channel assignment with access contention resolution for cognitive radio networks"
    - "towards practical oblivious ram"

Connected through hyperedge HE-2 (induced by source paper "a mood value for fair resource allocations"):
  with members:
    - "an axiomatic theory of fairness in network resource allocation"
    - "coalitions in cooperative wireless networks"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-3 (induced by source paper "a coalitional game for distributed inference in sensor networks with dependent observations"):
  with members:
    - "a cooperative bayesian nonparametric framework for primary user activity monitoring in cognitive radio networks"
    - "robust distributed maximum likelihood estimation with dependent quantized data"
    - "a generic approach to coalition formation"
    - "estimation diversity and energy efficiency in distributed sensing"
    - "stable partitions in coalitional games"

Connected through hyperedge HE-4 (induced by source paper "linearly constrained bimatrix games in wireless communications"):
  with members:
    - "on the performance of adaptive packetized wireless communication links under jamming"
    - "cbm a crypto coded modulation scheme for rate information concealing and robustness boosting"
    - "on the capacity of rate adaptive packetized wireless communication links under jamming"

Connected through hyperedge HE-5 (induced by source paper "overlapping coalition formation games for emerging communication networks"):
  with members:
    - "coalitional graph games for popular content distribution in cognitive radio vanets"
    - "what will 5g be"
    - "coalitional games with overlapping coalitions for interference management in small cell networks"
    - "hedonic coalition formation for distributed task allocation among wireless agents"
    - "cooperative games with overlapping coalitions"
    - "coalition formation games for distributed cooperation among roadside units in vehicular networks"
    - "physical layer security coalitional games for distributed cooperation"
    - "a distributed merge and split algorithm for fair cooperation in wireless networks"

Connected through hyperedge HE-6 (induced by source paper "self organizing networks of information gathering cognitive agents"):
  with members:
    - "social data offloading in d2d enhanced cellular networks by network formation games"
    - "conjoining speeds up information diffusion in overlaying social physical networks"
    - "dynamic network formation with incomplete information"
    - "a game theoretic analysis of incentives in content production and sharing over peer to peer networks"
    - "coalition formation games for distributed cooperation among roadside units in vehicular networks"
    - "minimum cost distributed source coding over a network"
    - "network information flow with correlated sources"

Connected through hyperedge HE-7 (induced by source paper "coalition formation game for cooperative cognitive radio using gibbs sampling"):
  with members:
    - "coalitional games in partition form for joint spectrum sensing and access in cognitive radio networks"
    - "optimal relay subset selection and time allocation in decode and forward cooperative networks"

Connected through hyperedge HE-8 (induced by source paper "coalitions in routing games a worst case perspective"):
  with members:
    - "how good is bargained routing"
    - "coalitions in nonatomic network congestion games"
    - "the effect of malice on the social optimum in linear load balancing games"

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.GT(Computer Science and Game Theory)