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: "beyond worst case analysis for joins with minesweeper"
  Abstract: We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially, `beyond worst-case guarantees') for data in indexed search trees. Our first contribution is developing a framework to measure this stronger notion of complexity, which we call {\it certificate complexity}, that extends notions of Barbay et al. and Demaine et al.; a certificate is a set of propositional formulae that certifies that the output is correct. This notion captures a natural class of join algorithms. In addition, the certificate allows us to define a strictly stronger notion of runtime complexity than traditional worst-case guarantees. Our second contribution is to develop a dichotomy theorem for the certificate-based notion of complexity. Roughly, we show that Minesweeper evaluates $\beta$-acyclic queries in time linear in the certificate plus the output size, while for any $\beta$-cyclic query there is some instance that takes superlinear time in the certificate (and for which the output is no larger than the certificate size). We also extend our certificate-complexity analysis to queries with bounded treewidth and the triangle query.

Connected through hyperedge HE-1 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins"):
  with members:
    - "size bounds and query plans for relational joins"
    - "constraint solving via fractional edge covers"
    - "answering conjunctive queries under updates"
    - "worst case optimal algorithms for parallel query processing"
    - "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"
    - "it s all a matter of degree using degree information to optimize multiway joins"
    - "the input output complexity of triangle enumeration"
    - "skew in parallel query processing"

Connected through hyperedge HE-2 (induced by source paper "optimal joins using compact data structures"):
  with members:
    - "worst case optimal join algorithms techniques results and open problems"
    - "size bounds and query plans for relational joins"
    - "compressed representation of dynamic binary relations with applications"
    - "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"
    - "join processing for graph patterns an old dog with new tricks"
    - "faq questions asked frequently"
    - "joins via geometric resolutions worst case and beyond"
    - "faster compressed quadtrees"

Connected through hyperedge HE-3 (induced by source paper "box covers and domain orderings for beyond worst case join processing"):
  with members:
    - "worst case optimal join algorithms techniques results and open problems"
    - "size bounds and query plans for relational joins"
    - "constraint solving via fractional edge covers"
    - "computing join queries with functional dependencies"
    - "it s all a matter of degree using degree information to optimize multiway joins"
    - "joins via geometric resolutions worst case and beyond"
    - "worst case optimal join algorithms"

Connected through hyperedge HE-4 (induced by source paper "the triejax architecture accelerating graph operations through relational joins"):
  with members:
    - "size bounds and query plans for relational joins"
    - "the ubiquity of large graphs and surprising challenges of graph processing"
    - "flexible caching in trie joins"
    - "join processing for graph patterns an old dog with new tricks"
    - "faq questions asked frequently"
    - "skew strikes back new developments in the theory of join algorithms"

Connected through hyperedge HE-5 (induced by source paper "worst case optimal join algorithms techniques results and open problems"):
  with members:
    - "ac dc in database learning thunderstruck"
    - "distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows"
    - "size bounds and query plans for relational joins"
    - "constraint solving via fractional edge covers"
    - "in database learning with sparse tensors"
    - "juggling functions inside a database"
    - "worst case optimal algorithms for parallel query processing"
    - "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"

Connected through hyperedge HE-6 (induced by source paper "answering conjunctive queries under updates"):
  with members:
    - "answering fo mod queries under updates on bounded degree databases"
    - "size bounds and query plans for relational joins"
    - "dynamic conjunctive queries"
    - "faster online matrix vector multiplication"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "joins via geometric resolutions worst case and beyond"
    - "a trichotomy in the complexity of counting answers to conjunctive queries"
    - "structural tractability of counting of solutions to conjunctive queries"

Connected through hyperedge HE-7 (induced by source paper "faq questions asked frequently"):
  with members:
    - "size bounds and query plans for relational joins"
    - "constraint solving via fractional edge covers"
    - "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"
    - "computing join queries with functional dependencies"
    - "general and fractional hypertree decompositions hard and easy cases"
    - "join processing for graph patterns an old dog with new tricks"
    - "emptyheaded boolean algebra based graph processing"
    - "joins via geometric resolutions worst case and beyond"

Connected through hyperedge HE-8 (induced by source paper "sharesskew an algorithm to handle skew for joins in mapreduce"):
  with members:
    - "worst case optimal algorithms for parallel query processing"
    - "it s all a matter of degree using degree information to optimize multiway joins"
    - "α k minimal sorting and skew join in mpi and mapreduce"
    - "skew in parallel query processing"
    - "gym a multiround join algorithm in mapreduce"
    - "the family of mapreduce and large scale data processing systems"
    - "skew strikes back new developments in the theory of join algorithms"
    - "communication steps for parallel query processing"

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