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: "matchings with lower quotas algorithms and complexity"
  Abstract: We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph $G= (A \cup P, E)$ with weights on the edges in $E$, and with lower and upper quotas on the vertices in $P$. We seek a maximum weight many-to-one matching satisfying two sets of constraints: vertices in $A$ are incident to at most one matching edge, while vertices in $P$ are either unmatched or they are incident to a number of matching edges between their lower and upper quota. This problem, which we call maximum weight many-to-one matching with lower and upper quotas (WMLQ), has applications to the assignment of students to projects within university courses, where there are constraints on the minimum and maximum numbers of students that must be assigned to each project. #R##N#In this paper, we provide a comprehensive analysis of the complexity of WMLQ from the viewpoints of classic polynomial time algorithms, fixed-parameter tractability, as well as approximability. We draw the line between NP-hard and polynomially tractable instances in terms of degree and quota constraints and provide efficient algorithms to solve the tractable ones. We further show that the problem can be solved in polynomial time for instances with bounded treewidth; however, the corresponding runtime is exponential in the treewidth with the maximum upper quota $u_{max}$ as basis, and we prove that this dependence is necessary unless FPT = W[1]. The approximability of WMLQ is also discussed: we present an approximation algorithm for the general case with performance guarantee $u_{\max}+1$, which is asymptotically best possible unless P = NP. Finally, we elaborate on how most of our positive results carry over to matchings in arbitrary graphs with lower quotas.

Connected through hyperedge HE-1 (induced by source paper "what is known about vertex cover kernelization"):
  with members:
    - "smaller parameters for vertex cover kernelization"
    - "vertex cover structural parameterization revisited"
    - "deleting edges to restrict the size of an epidemic a new application for treewidth"
    - "efficient classification for metric data"
    - "kernelization lower bounds by cross composition"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "vertex cover kernelization revisited upper and lower bounds for a refined parameter"

Connected through hyperedge HE-2 (induced by source paper "a general dichotomy of evolutionary algorithms on monotone functions"):
  with members:
    - "fast genetic algorithms"
    - "optimal parameter settings for the 1 lambda lambda genetic algorithm"
    - "a tight runtime analysis of the 1 lambda lambda genetic algorithm on onemax"
    - "optimal parameter choices through self adjustment applying the 1 5 th rule in discrete settings"
    - "multiplicative drift analysis"
    - "optimizing monotone functions can be difficult"

Connected through hyperedge HE-3 (induced by source paper "on conceptually simple algorithms for variants of online bipartite matching"):
  with members:
    - "an experimental study of algorithms for online bipartite matching"
    - "on the limitations of deterministic de randomizations for online bipartite matching and max sat"
    - "computing maximum flow with augmenting electrical flows"
    - "on the power of advice and randomization for online bipartite matching"
    - "new algorithms better bounds and a novel model for online stochastic matching"
    - "deterministic algorithms for submodular maximization problems"
    - "greedy matching guarantees and limitations"
    - "greedy algorithms make efficient mechanisms"

Connected through hyperedge HE-4 (induced by source paper "stable project allocation under distributional constraints"):
  with members:
    - "almost stable matchings in the hospitals residents problem with couples"
    - "the hospitals residents problem with couples complexity and integer programming models"
    - "classified stable matching"

Connected through hyperedge HE-5 (induced by source paper "envy free matchings with lower quotas"):
  with members:
    - "stable marriage with covering constraints a complete computational trichotomy"
    - "classified stable matching"

Connected through hyperedge HE-6 (induced by source paper "stable marriage with covering constraints a complete computational trichotomy"):
  with members:
    - "envy free matchings with lower quotas"
    - "on the susceptibility of the deferred acceptance algorithm"
    - "many to one matchings with lower quotas algorithms and complexity"
    - "stable marriage and roommates problems with restricted edges complexity and approximability"
    - "classified stable matching"

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)