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: "a natural generalization of stable matching solved via new insights into ideal cuts"
  Abstract: We study a natural generalization of stable matching to the maximum weight stable matching problem and we obtain a combinatorial polynomial time algorithm for it by reducing it to the problem of finding a maximum weight ideal cut in a DAG. We give the first polynomial time algorithm for the latter problem; this algorithm is also combinatorial. #R##N#The combinatorial nature of our algorithms not only means that they are efficient but also that they enable us to obtain additional structural and algorithmic results: #R##N#- We show that the set, $\cal M'$, of maximum weight stable matchings forms a sublattice $\cal L'$ of the lattice $\cal L$ of all stable matchings. #R##N#- We give an efficient algorithm for finding boy-optimal and girl-optimal matchings in $\cal M'$. #R##N#- We generalize the notion of rotation, a central structural notion in the context of the stable matching problem, to macro-rotation. Just as rotations help traverse the lattice of all stable matchings, macro-rotations help traverse the sublattice over $\cal M'$.

Connected through hyperedge HE-1 (induced by source paper "stable fractional matchings"):
  with members:
    - "random matching under priorities stability and no envy concepts"
    - "the stable roommates problem with short lists"

Connected through hyperedge HE-2 (induced by source paper "stable matchings robust solutions and distributive lattices"):
  with members:
    - "finding stable matchings that are robust to errors in the input"
    - "finding robust solutions to stable marriage"
    - "on the complexity of robust stable marriage"
    - "stable matching with uncertain linear preferences"

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)