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 "optimal algorithms for ranked enumeration of answers to full conjunctive queries"):
  Abstract: We study ranked enumeration of the results to a join query in order of decreasing importance, as imposed by an appropriate ranking function. Our main contribution is a framework for ranked enumeration over a class of Dynamic Programming problems that generalizes seemingly different problems that to date had been studied in isolation. To this end, we study and extend classic algorithms that find the k-shortest paths in a weighted graph. For full conjunctive queries, including cyclic ones, our approach is asymptotically optimal in terms of (1) time to return the top result, (2) delay between results, and (3) time until all results are returned in order. These optimality properties were derived for a complexity measure that has been widely used in the context of worst-case optimal join algorithms, but which abstracts away factors that only depend on query size and a polylogarithmic cost factor in input size. By performing a more detailed cost analysis, we are able to uncover a previously unknown tradeoff between two incomparable enumeration approaches: one has lower complexity when the number of returned results is small, the other when it is large. We demonstrate theoretically and empirically the superiority of our techniques to batch algorithms that produce the full result and then sort it. Interestingly, our technique is not only faster for returning the first few results, but even when all results are produced.

Includes members:
  Member "ranked enumeration of conjunctive query results":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "answering unions of conjunctive queries using random access and random order enumeration")
  Member "any k anytime top k tree pattern retrieval in labeled graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ranked enumeration of conjunctive query results")
  Member "on functional aggregate queries with additive inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning models over relational data a brief tutorial")
  Member "on the enumeration complexity of unions of conjunctive queries":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "answering unions of conjunctive queries using random access and random order enumeration")
  Member "size bounds and query plans for relational joins":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "covers of query results":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width")
  Member "constraint solving via fractional edge covers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "answering conjunctive queries under updates":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width")

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)