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 "greedy awakens efficient and provable multi query optimization"):
  Abstract: Complex queries for massive data analysis jobs have become increasingly commonplace. Many such queries contain common sub-expressions, either within a single query or among multiple queries submitted as a batch. Conventional query optimizers do not exploit these common sub-expressions and produce sub-optimal plans. The problem of multi-query optimization (MQO) is to generate an optimal \textit{combined} evaluation plan by computing common sub-expressions once and reusing them. Exhaustive algorithms for MQO explore an $\mathcal{O}(n^n)$ search space. Thus, this problem has primarily been tackled using various heuristic algorithms, without providing any theoretical guarantees on the quality of the solution obtained. #R##N#In this paper, instead of the conventional cost minimization problem, we treat the problem as maximizing a linear transformation of the cost function. We propose a greedy algorithm for this transformed formulation of the problem, which under weak, intuitive assumptions, gives an approximation factor with respect to the optimal solution of this formulation. We go on to show that this factor is optimal, unless $\mathsf{P} = \mathsf{NP}$. Another noteworthy point about our algorithm is that it can be easily incorporated into existing transformation-based optimizers. We finally propose optimizations which can be used to improve the efficiency of our algorithm.

Includes members:
  Member "constrained submodular maximization beyond 1 e":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "analytical approach to parallel repetition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an improved algorithm for dynamic set cover")

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.DB(Databases)