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 "computing maximum matchings in temporal graphs"):
  Abstract: We study the computational complexity of finding maximum-cardinality temporal matchings in temporal graphs (where the edge set may change over time while the vertex set remains fixed). Our model of temporal matching (which seems to be slightly more general than a previous one due to Baste et al. [Theor. Comp. Sci., 2019]) allows capturing several real-world scenarios where (as e.g. in social networks) relations change over time and where one also has to model the duration of pairings between agents. In this paper we present several classic and approximation hardness results as well as approximation and exact fixed-parameter algorithms, thus improving several parts of previous work of Baste et al. We show hardness already for very restricted cases and introduce temporal line graphs as a concept of independent interest. Altogether, our results both show the various degrees of computational intractability of "temporal matching" and point to some islands of tractability which may give hope for efficient solutions in relevant special cases. Our work focuses on exploring the computational complexity landscape (tractable versus intractable) and mainly delivers classification results.

Includes members:
  Member "temporal matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multistage graph problems on a global budget")
  Member "how fast can we reach a target vertex in stochastic temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the computational complexity of finding temporal paths under waiting time constraints")
  Member "fixed parameter algorithms for maximum profit facility location under matroid constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the computational complexity of finding temporal paths under waiting time constraints")
  Member "tight competitive ratios of classic matching algorithms in the fully online model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models")
  Member "temporal vertex cover with a sliding time window":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximating multistage matching problems")
  Member "how to match when all vertices arrive online":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models")
  Member "sliding window temporal graph coloring":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "how fast can we reach a target vertex in stochastic temporal graphs")
  Member "efficient and adaptive parameterized algorithms on modular decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient parameterized algorithms for computing all pairs shortest paths")

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