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: "g core a core for future graph query languages"
  Abstract: We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity.

Connected through hyperedge HE-1 (induced by source paper "graph generators state of the art and open challenges"):
  with members:
    - "a survey on theoretical advances of community detection in networks"
    - "graphvae towards generation of small graphs using variational autoencoders"
    - "graphrnn generating realistic graphs with deep auto regressive models"
    - "learning deep generative models of graphs"
    - "gmark schema driven generation of graphs and queries"
    - "motifs in temporal networks"
    - "darwini generating realistic large scale social graphs"
    - "an introduction to temporal graphs an algorithmic perspective"

Connected through hyperedge HE-2 (induced by source paper "structural indexing for conjunctive path queries"):
  with members:
    - "the ubiquity of large graphs and surprising challenges of graph processing extended survey"
    - "survey and taxonomy of lossless graph compression and space efficient graph representations"
    - "gmark schema driven generation of graphs and queries"
    - "an analytical study of large sparql query logs"
    - "foundations of modern query languages for graph databases"
    - "taming subgraph isomorphism for rdf query processing"
    - "similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations"
    - "relative expressive power of navigational querying on graphs"

Connected through hyperedge HE-3 (induced by source paper "the ubiquity of large graphs and surprising challenges of graph processing extended survey"):
  with members:
    - "graph based preconditioning conjugate gradient algorithm for n 1 contingency analysis"
    - "foundations of modern query languages for graph databases"
    - "the gremlin graph traversal machine and language invited talk"
    - "graphvista interactive exploration of large graphs"
    - "querying knowledge graphs by example entity tuples"
    - "standards for graph algorithm primitives"

Connected through hyperedge HE-4 (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"
    - "an overview of embedding models of entities and relationships for knowledge base completion"
    - "convolutional 2d knowledge graph embeddings"
    - "semantics and complexity of sparql"

Connected through hyperedge HE-5 (induced by source paper "modular path queries with arithmetic"):
  with members:
    - "querying best paths in graph databases"
    - "expressive path queries on graph with data"
    - "reachability in two dimensional vector addition systems with states is pspace complete"
    - "on the freeze quantifier in constraint ltl decidability and complexity"

Connected through hyperedge HE-6 (induced by source paper "the ldbc social network benchmark"):
  with members:
    - "foundations of modern query languages for graph databases"
    - "the anatomy of the facebook social graph"

Connected through hyperedge HE-7 (induced by source paper "storage solutions for big data systems a qualitative study and comparison"):
  with members:
    - "a billion updates per second using 30 000 hierarchical in memory d4m databases"
    - "foundationdb record layer a multi tenant structured datastore"
    - "hadoop perfect file a fast access container for small files with direct in disc metadata access"
    - "decentralized search on decentralized web"
    - "effects of storage heterogeneity in distributed cache systems"
    - "database as a service current issues and its future"
    - "chain of trust can trusted hardware help scaling blockchains"
    - "towards scaling blockchain systems via sharding"

Connected through hyperedge HE-8 (induced by source paper "bivariate cluster and suitability analysis of nosql solutions for different application areas"):
  with members:
    - "a billion updates per second using 30 000 hierarchical in memory d4m databases"
    - "foundationdb record layer a multi tenant structured datastore"
    - "effects of storage heterogeneity in distributed cache systems"
    - "database as a service current issues and its future"
    - "polypus a big data self deployable architecture for microblogging text extraction and real time sentiment analysis"
    - "a stitch in time saves nine sparql querying of property graphs using gremlin traversals"
    - "blocktag design and applications of a tagging system for blockchain analysis"
    - "an introduction to graph data management"

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)