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 "balanced stable marriage how close is close enough"):
  Abstract: The Balanced Stable Marriage problem is a central optimization version of the classic Stable Marriage problem. Here, the output cannot be an arbitrary stable matching, but one that balances between the dissatisfaction of the two parties, men and women. We study Balanced Stable Marriage from the viewpoint of Parameterized Complexity. Our "above guarantee parameterizations" are arguably the most natural parameterizations of the problem at hand. Indeed, our parameterizations precisely fit the scenario where there exists a stable marriage that both parties would accept, that is, where the satisfaction of each party is "close" to the best it can hope for. Furthermore, our parameterizations accurately draw the line between tractability and intractability with respect to the target value.

Includes members:
  Member "stable marriage with groups of similar agents":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "on treewidth and stable marriage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stable matchings with diversity constraints affirmative action is beyond np")
  Member "how hard is it to satisfy almost all roommates":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "on parameterized complexity of group activity selection problems on social networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "group activity selection on social networks")
  Member "group activity selection on social networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robustness against agent failure in hedonic games")
  Member "stable marriage with covering constraints a complete computational trichotomy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "raising the bar for vertex cover fixed parameter tractability above a higher guarantee":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "elimination distances blocking sets and kernels for vertex cover")
  Member "parameterized algorithmics for computational social choice nine research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stable marriage with multi modal preferences")

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.DS(Data Structures and Algorithms)