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 "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width"):
  Abstract: Marx (STOC~2010, J.~ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) and showed that for any class $\Phi$ of Boolean CQs of bounded submodular width, the model-checking problem for $\Phi$ on the class of all finite structures is fixed-parameter tractable (FPT). Note that for non-Boolean queries, the size of the query result may be far too large to be computed entirely within FPT time. We investigate the free-connex variant of submodular width and generalise Marx's result to non-Boolean queries as follows: For every class $\Phi$ of CQs of bounded free-connex submodular width, within FPT-preprocessing time we can build a data structure that allows to enumerate, without repetition and with constant delay, all tuples of the query result. Our proof builds upon Marx's splitting routine to decompose the query result into a union of results; but we have to tackle the additional technical difficulty to ensure that these can be enumerated efficiently.

Includes members:
  Member "enumeration on trees under relabelings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constant delay enumeration for nondeterministic document spanners")
  Member "answering fo mod queries under updates on bounded degree databases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ranked enumeration of conjunctive query results")
  Member "covers of query results":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal algorithms for ranked enumeration of answers to full conjunctive queries")
  Member "constraint solving via fractional edge covers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "optimal algorithms for ranked enumeration of answers to full conjunctive queries")
  Member "compressed representations of conjunctive query results":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fast join project query evaluation using matrix multiplication")
  Member "answering ucqs under updates and in the presence of integrity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "answering unions of conjunctive queries using random access and random order enumeration")
  Member "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal algorithms for ranked enumeration of answers to full conjunctive queries")

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)