human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "stable marriage with groups of similar agents"):
  Abstract: Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems which will allow us to design efficient algorithms using elementary techniques. We focus on the setting in which all agents involved in some matching problem can be partitioned into k different types, where the type of an agent determines his or her preferences, and agents have preferences over types (which may be refined by more detailed preferences within a single type). This situation would arise in practice if agents form preferences solely based on some small collection of agents’ attributes. We also consider a generalisation in which each agent may consider some small collection of other agents to be exceptional, and rank these in a way that is not consistent with their types; this could happen in practice if agents have prior contact with a small number of candidates. We show that (for the case without exceptions), the well-known NP-hard matching problem Max SMTI (that of finding the maximum cardinality stable matching in an instance of stable marriage with ties and incomplete lists) belongs to the parameterised complexity class FPT when parameterised by the number of different types of agents needed to describe the instance. This tractability result can be extended to the setting in which each agent promotes at most one “exceptional” candidate to the top of his/her list (when preferences within types are not refined), but the problem remains NP-hard if preference lists can contain two or more exceptions and the exceptional candidates can be placed anywhere in the preference lists.

Includes members:
  Member "on treewidth and stable marriage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stable matchings with diversity constraints affirmative action is beyond np")
  Member "balanced stable marriage how close is close enough":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "stable marriage with covering constraints a complete computational trichotomy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "parameterized integer quadratic programming variables and coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exact crossing number parameterized by vertex cover")
  Member "the complexity of approximately counting stable roommate assignments":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fptas for bis with degree bounds on one side")
  Member "the complexity of approximately counting stable matchings":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algorithms for bis hard problems on expander graphs")
  Member "complexity of coalition structure generation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stable outcomes in modified fractional hedonic games")

Question: Please tell me which class the source paper 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)