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 "popular matchings with multiple partners"):
  Abstract: Our input is a bipartite graph $G = (R \cup H,E)$ where each vertex in $R \cup H$ has a preference list strictly ranking its neighbors. The vertices in $R$ (similarly, in $H$) are called residents (resp., hospitals): each resident seeks to be matched to a hospital while each hospital $h$ seeks $\mathsf{cap}(h) \ge 1$ many residents to be matched to it. The Gale-Shapley algorithm computes a stable matching in $G$ in linear time. We consider the problem of computing a popular matching in $G$ - a matching $M$ is popular if $M$ cannot lose an election to any other matching where vertices cast votes for one matching versus another. Our main contribution is to show that a max-size popular matching in $G$ can be computed by the 2-level Gale-Shapley algorithm in linear time. This is a simple extension of the classical Gale-Shapley algorithm and we prove its correctness via linear programming.

Includes members:
  Member "popularity in the generalized hospital residents setting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how good are popular matchings")
  Member "popular matchings with two sided preferences and one sided ties":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "understanding popular matchings via stable matchings")
  Member "popular edges and dominant matchings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "understanding popular matchings via stable matchings")
  Member "socially stable matchings in the hospitals residents problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the stable marriage problem with ties and restricted edges")

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)