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: "popular edges and dominant matchings"
  Abstract: Given a bipartite graph G = (A u B, E) with strict preference lists and and edge e*, we ask if there exists a popular matching in G that contains the edge e*. We call this the popular edge problem. A matching M is popular if there is no matching M' such that the vertices that prefer M' to M outnumber those that prefer M to M'. It is known that every stable matching is popular; however G may have no stable matching with the edge e* in it. In this paper we identify another natural subclass of popular matchings called "dominant matchings" and show that if there is a popular matching that contains the edge e*, then there is either a stable matching that contains e* or a dominant matching that contains e*. This allows us to design a linear time algorithm for the popular edge problem. We also use dominant matchings to efficiently test if every popular matching in G is stable or not.

Connected through hyperedge HE-1 (induced by source paper "understanding popular matchings via stable matchings"):
  with members:
    - "max size popular matchings and extensions"
    - "popular matching in roommates setting is np hard"
    - "popular matchings and limits to tractability"
    - "popular matchings with two sided preferences and one sided ties"

Connected through hyperedge HE-2 (induced by source paper "quasi popular matchings optimality and extended formulations"):
  with members:
    - "understanding popular matchings via stable matchings"
    - "unpopularity factor in the marriage and roommates problems"
    - "popular matching in roommates setting is np hard"
    - "popular matchings and limits to tractability"
    - "extension complexity of independent set polytopes"
    - "the matching polytope has exponential extension complexity"

Connected through hyperedge HE-3 (induced by source paper "popular branchings and their dual certificates"):
  with members:
    - "the convergence of iterative delegations in liquid democracy in a social network"
    - "popular matching in roommates setting is np hard"
    - "popular matchings and limits to tractability"
    - "the fluid mechanics of liquid democracy"
    - "binary voting with delegable proxy an analysis of liquid democracy"
    - "popular matchings with two sided preferences and one sided ties"

Connected through hyperedge HE-4 (induced by source paper "how good are popular matchings"):
  with members:
    - "envy free matchings with lower quotas"
    - "popular matching with lower quotas"
    - "popularity in the generalized hospital residents setting"
    - "popular matchings with multiple partners"
    - "almost stable matchings in the hospitals residents problem with couples"

Connected through hyperedge HE-5 (induced by source paper "popularity stability and the dominant matching polytope"):
  with members:
    - "max size popular matchings and extensions"
    - "popular matching in roommates setting is np hard"
    - "popular matchings and limits to tractability"
    - "popular matchings with two sided preferences and one sided ties"

Connected through hyperedge HE-6 (induced by source paper "popular matchings and limits to tractability"):
  with members:
    - "max size popular matchings and extensions"
    - "popular matching in roommates setting is np hard"
    - "the popular roommates problem"

Connected through hyperedge HE-7 (induced by source paper "the popular roommates problem"):
  with members:
    - "max size popular matchings and extensions"
    - "popular matching in roommates setting is np hard"
    - "popular matchings with two sided preferences and one sided ties"

Connected through hyperedge HE-8 (induced by source paper "max size popular matchings and extensions"):
  with members:
    - "popular matchings with multiple partners"
    - "popular matchings with two sided preferences and one sided ties"

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.DM(Discrete Mathematics)