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: "weighted popular matchings"
  Abstract: We study the problem of assigning jobs to applicants. Each applicant has a weight and provides a preference list ranking a subset of the jobs. A matching M is popular if there is no other matching M' such that the weight of the applicants who prefer M' over M exceeds the weight of those who prefer M over M'. This paper gives efficient algorithms to find a popular matching if one exists.

Connected through hyperedge HE-1 (induced by source paper "minimal envy and popular matchings"):
  with members:
    - "competitive division of a mixed manna"
    - "popular matchings with two sided preferences and one sided ties"
    - "counting popular matchings in house allocation problems"
    - "exact complexity of the winner problem for young elections"

Connected through hyperedge HE-2 (induced by source paper "unpopularity factor in the marriage and roommates problems"):
  with members:
    - "popular matching in roommates setting is np hard"
    - "popular matchings and limits to tractability"
    - "popular matchings in complete graphs"
    - "random popular matchings with incomplete preference lists"
    - "scaling algorithms for weighted matching in general graphs"

Connected through hyperedge HE-3 (induced by source paper "random popular matchings with incomplete preference lists"):
  with members:
    - "weighted random popular matchings"

Connected through hyperedge HE-4 (induced by source paper "random almost popular matchings"):
  with members:
    - "weighted random popular matchings"

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