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: "on parameterized complexity of group activity selection problems on social networks"
  Abstract: In Group Activity Selection Problem (GASP), players form coalitions to participate in activities and have preferences over pairs of the form (activity, group size). Recently, Igarashi et al. have initiated the study of group activity selection problems on social networks (gGASP): a group of players can engage in the same activity if the members of the group form a connected subset of the underlying communication structure. Igarashi et al. have primarily focused on Nash stable outcomes, and showed that many associated algorithmic questions are computationally hard even for very simple networks. In this paper we study the parameterized complexity of gGASP with respect to the number of activities as well as with respect to the number of players, for several solution concepts such as Nash stability, individual stability and core stability. The first parameter we consider in the number of activities. For this parameter, 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 classic 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 classic GASP and when the social network is a star. Another parameter we study is the number of players. While all solution concepts we consider become polynomial-time computable when this parameter is bounded by a constant, we prove W[1]-hardness results for cliques (i.e., for classic GASP).

Connected through hyperedge HE-1 (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"
    - "group activity selection 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-2 (induced by source paper "group activity selection on social networks"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "fair division of a graph"
    - "hedonic games with graph restricted communication"
    - "complexity results for rainbow matchings"
    - "group activity selection problem"
    - "core stability in hedonic coalition formation"

Connected through hyperedge HE-3 (induced by source paper "cooperative games with overlapping coalitions charting the tractability frontier"):
  with members:
    - "group activity selection 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)