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: "on the expressive power of linear algebra on graphs"
  Abstract: Most graph query languages are rooted in logic. By contrast, in this paper we consider graph query languages rooted in linear algebra. More specifically, we consider MATLANG, a matrix query language recently introduced, in which some basic linear algebra functionality is supported. We investigate the problem of characterising equivalence of graphs, represented by their adjacency matrices, for various fragments of MATLANG. A complete picture is painted of the impact of the linear algebra operations in MATLANG on their ability to distinguish graphs.

Connected through hyperedge HE-1 (induced by source paper "on matrices and k relations"):
  with members:
    - "laradb a minimalist kernel for linear and relational algebra computation"
    - "on the expressive power of query languages for matrices"
    - "polystore mathematics of relational algebra"
    - "juggling functions inside a database"
    - "faq questions asked frequently"

Connected through hyperedge HE-2 (induced by source paper "on the expressiveness of lara a unified language for linear and relational algebra"):
  with members:
    - "research directions for principles of data management dagstuhl perspectives workshop 16151"
    - "laradb a minimalist kernel for linear and relational algebra computation"
    - "on the expressive power of query languages for matrices"

Connected through hyperedge HE-3 (induced by source paper "on the expressive power of query languages for matrices"):
  with members:
    - "on matrices and k relations"
    - "laradb a minimalist kernel for linear and relational algebra computation"
    - "embedding tarskian semantics in vector spaces"
    - "towards linear algebra over normalized data"
    - "a linear algebraic approach to datalog evaluation"
    - "reachability is in dynfo"
    - "rank logic is dead long live rank logic"
    - "faq questions asked frequently"

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)