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 "how hard is it to satisfy almost all roommates"):
  Abstract: The classic Stable Roommates problem (which is the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set of agents, i.e. a partitioning of the agents into disjoint pairs such that no two agents induce a blocking pair. Herein, each agent has a preference list denoting who it prefers to have as a partner, and two agents are blocking if they prefer to be with each other rather than with their assigned partners. Since stable matchings may not be unique, we study an NP-hard optimization variant of Stable Roommates, called Egal Stable Roommates, which seeks to find a stable matching with a minimum egalitarian cost {\gamma}, i.e. the sum of the dissatisfaction of the agents is minimum. The dissatisfaction of an agent is the number of agents that this agent prefers over its partner if it is matched; otherwise it is the length of its preference list. We also study almost stable matchings, called Min-Block-Pair Stable Roommates, which seeks to find a matching with a minimum number {\beta} of blocking pairs. Our main result is that Egal Stable Roommates parameterized by {\gamma} is fixed-parameter tractable, while Min-Block-Pair Stable Roommates parameterized by {\beta} is W[1]-hard, even if the length of each preference list is at most five.

Includes members:
  Member "stable marriage with multi modal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "stable marriage with groups of similar agents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "balanced stable marriage how close is close enough":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "the stable roommates problem with short lists":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computational complexity of stable marriage and stable roommates and their variants")
  Member "stable marriage with covering constraints a complete computational trichotomy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "almost optimal cover free families":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exact learning from an honest teacher that answers membership queries")
  Member "linear time constructions of some d restriction problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning erd h o s r enyi random graphs via edge detecting queries")
  Member "designing fpt algorithms for cut problems using randomized contractions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "grundy coloring friends half graphs bicliques")

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.CC(Computational Complexity)