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: "semantics and complexity of sparql"
  Abstract: SPARQL is the W3C candidate recommendation query language for RDF. In this paper we address systematically the formal study of SPARQL, concentrating in its graph pattern facility. We consider for this study a fragment without literals and a simple version of filters which encompasses all the main issues yet is simple to formalize. We provide a compositional semantics, prove there are normal forms, prove complexity bounds, among others that the evaluation of SPARQL patterns is PSPACE-complete, compare our semantics to an alternative operational semantics, give simple and natural conditions when both semantics coincide and discuss optimizations procedures.

Connected through hyperedge HE-1 (induced by source paper "functional programming in pattern match oriented programming style"):
  with members:
    - "non linear pattern matching with backtracking for non free data types"
    - "loop patterns extension of kleene star operator for more expressive pattern matching against arbitrary data structures"
    - "scalar and tensor parameters for importing tensor index notation including einstein summation notation"
    - "the gremlin graph traversal machine and language invited talk"
    - "extensible pattern matching in an extensible language"

Connected through hyperedge HE-2 (induced by source paper "rdfframes knowledge graph access for machine learning tools"):
  with members:
    - "mapping rdf graphs to property graphs"
    - "on multi relational link prediction with bilinear models"
    - "g core a core for future graph query languages"
    - "an overview of embedding models of entities and relationships for knowledge base completion"
    - "convolutional 2d knowledge graph embeddings"

Connected through hyperedge HE-3 (induced by source paper "dependently typed knowledge graphs"):
  with members:
    - "explainable reasoning over knowledge graphs for recommendation"
    - "kbqa learning question answering over qa corpora and knowledge bases"

Connected through hyperedge HE-4 (induced by source paper "star pattern fragments accessing knowledge graphs through star patterns"):
  with members:
    - "the odyssey approach for optimizing federated sparql queries"
    - "brtpf bindings restricted triple pattern fragments extended preprint"

Connected through hyperedge HE-5 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism"):
  with members:
    - "storing and querying large scale spatio temporal graphs with high throughput edge insertions"
    - "parallel batch dynamic graph connectivity"
    - "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"
    - "graph processing on fpgas taxonomy survey challenges"
    - "slim fly a cost effective low diameter network topology"
    - "red blue pebbling revisited near optimal parallel matrix matrix multiplication"
    - "dynamic algorithms for the massively parallel computation model"
    - "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"

Connected through hyperedge HE-6 (induced by source paper "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"):
  with members:
    - "graph processing on fpgas taxonomy survey challenges"
    - "slim fly a cost effective low diameter network topology"
    - "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"
    - "active access a mechanism for high performance distributed data centric computations"
    - "network accelerated non contiguous memory transfers"
    - "slim graph practical lossy graph compression for approximate graph processing storage and analytics"
    - "survey and taxonomy of lossless graph compression and space efficient graph representations"
    - "high level programming abstractions for distributed graph processing"

Connected through hyperedge HE-7 (induced by source paper "bas an answer selection method using bert language model"):
  with members:
    - "a compare aggregate model with latent clustering for answer selection"
    - "attention based pairwise multi perspective convolutional neural network for answer selection in question answering"
    - "albert a lite bert for self supervised learning of language representations"
    - "deep learning using rectified linear units relu"
    - "anmm ranking short answer texts with attention based neural matching model"
    - "bridging nonlinearities and stochastic regularizers with gaussian error linear units"
    - "recurrent additive networks"
    - "exploring the effectiveness of convolutional neural networks for answer selection in end to end question answering"

Connected through hyperedge HE-8 (induced by source paper "complexity bounds for relational algebra over document spanners"):
  with members:
    - "rational recurrences"
    - "constant delay enumeration for nondeterministic document spanners"
    - "constant delay algorithms for regular document spanners"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "extracting automata from recurrent neural networks using queries and counterexamples"
    - "enumeration complexity of conjunctive queries with functional dependencies"
    - "joining extractions of regular expressions"
    - "recursive programs for document spanners"

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)