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 "on the expressive power of query languages for matrices"):
  Abstract: We investigate the expressive power of $\mathsf{MATLANG}$, a formal language for matrix manipulation based on common matrix operations and linear algebra. The language can be extended with the operation $\mathsf{inv}$ of inverting a matrix. In $\mathsf{MATLANG}+\mathsf{inv}$ we can compute the transitive closure of directed graphs, whereas we show that this is not possible without inversion. Indeed we show that the basic language can be simulated in the relational algebra with arithmetic operations, grouping, and summation. We also consider an operation $\mathsf{eigen}$ for diagonalizing a matrix, which is defined so that different eigenvectors returned for a same eigenvalue are orthogonal. We show that $\mathsf{inv}$ can be expressed in $\mathsf{MATLANG}+\mathsf{eigen}$. We put forward the open question whether there are boolean queries about matrices, or generic queries about graphs, expressible in $\mathsf{MATLANG} + \mathsf{eigen}$ but not in $\mathsf{MATLANG}+\mathsf{inv}$. The evaluation problem for $\mathsf{MATLANG} + \mathsf{eigen}$ is shown to be complete for the complexity class $\exists \mathbf{R}$.

Includes members:
  Member "on matrices and k relations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sql4ml a declarative end to end workflow for machine learning")
  Member "on the expressive power of linear algebra on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on matrices and k relations")
  Member "laradb a minimalist kernel for linear and relational algebra computation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards scalable dataframe systems")
  Member "embedding tarskian semantics in vector spaces":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tensor product representations of subregular formal languages")
  Member "towards linear algebra over normalized data":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi layer optimizations for end to end data analytics")
  Member "a linear algebraic approach to datalog evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a tensorized logic programming language for large scale data")
  Member "reachability is in dynfo":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "rank logic is dead long live rank logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximations of isomorphism and logics with linear algebraic operators")

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)