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: "group activity selection on social networks"
  Abstract: We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups (gGASP). We show that if multiple groups can simultaneously engage in the same activity, finding a stable outcome is easy as long as the network is acyclic. In contrast, if each activity can be assigned to a single group only, finding stable outcomes becomes computationally intractable, even if the underlying network is very simple: the problem of determining whether a given instance of a gGASP admits a Nash stable outcome turns out to be NP-hard when the social network is a path or a star, or if the size of each connected component is bounded by a constant. We then study the parameterized complexity of finding outcomes of gGASP that are Nash stable, individually stable or core stable. For the parameter `number of activities', we propose an FPT algorithm for Nash stability for the case where the social network is acyclic and obtain a W[1]-hardness result for cliques (i.e., for standard GASP); similar results hold for individual stability. In contrast, finding a core stable outcome is hard even if the number of activities is bounded by a small constant, both for standard GASP and when the social network is a star. For the parameter `number of players', all problems we consider are in XP for arbitrary social networks; on the other hand, we prove W[1]-hardness results with respect to the parameter `number of players' for the case where the social network is a clique.

Connected through hyperedge HE-1 (induced by source paper "robustness against agent failure in hedonic games"):
  with members:
    - "hedonic games with graph restricted communication"
    - "learning cooperative games"
    - "group activity selection problem"
    - "solving cooperative reliability games"

Connected through hyperedge HE-2 (induced by source paper "balanced stable marriage how close is close enough"):
  with members:
    - "stable marriage with groups of similar agents"
    - "on treewidth and stable marriage"
    - "how hard is it to satisfy almost all roommates"
    - "on parameterized complexity of group activity selection problems on social networks"
    - "stable marriage with covering constraints a complete computational trichotomy"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "parameterized algorithmics for computational social choice nine research challenges"
    - "faster parameterized algorithms using linear programming"

Connected through hyperedge HE-3 (induced by source paper "on parameterized complexity of group activity selection problems on social networks"):
  with members:
    - "hedonic games with graph restricted communication"
    - "group activity selection problem"

Connected through hyperedge HE-4 (induced by source paper "cooperative games with overlapping coalitions charting the tractability frontier"):
  with members:
    - "on parameterized complexity of group activity selection problems on social networks"
    - "hedonic games with graph restricted communication"
    - "coalition games on interaction graphs a horticultural perspective"
    - "the authorship dilemma alphabetical or contribution"
    - "on the complexity of core kernel and bargaining set"
    - "cooperative games with overlapping coalitions"
    - "an anytime algorithm for optimal coalition structure generation"
    - "the cost of stability in coalitional 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)