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 "scaling up reasoning and advanced analytics on bigdata"):
  Abstract: BigDatalog is an extension of Datalog that achieves performance and scalability on both Apache Spark and multicore systems to the point that its graph analytics outperform those written in GraphX. Looking back, we see how this realizes the ambitious goal pursued by deductive database researchers beginning forty years ago: this is the goal of combining the rigor and power of logic in expressing queries and reasoning with the performance and scalability by which relational databases managed Big Data. This goal led to Datalog which is based on Horn Clauses like Prolog but employs implementation techniques, such as Semi-naive Fixpoint and Magic Sets, that extend the bottom-up computation model of relational systems, and thus obtain the performance and scalability that relational systems had achieved, as far back as the 80s, using data-parallelization on shared-nothing architectures. But this goal proved difficult to achieve because of major issues at (i) the language level and (ii) at the system level. The paper describes how (i) was addressed by simple rules under which the fixpoint semantics extends to programs using count, sum and extrema in recursion, and (ii) was tamed by parallel compilation techniques that achieve scalability on multicore systems and Apache Spark. This paper is under consideration for acceptance in Theory and Practice of Logic Programming (TPLP).

Includes members:
  Member "vicious circle principle and logic programs with aggregates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an asp semantics for constraints involving conditional aggregates")
  Member "clingo asp control preliminary report":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the external interface for extending wasp")
  Member "efficient computation of the well founded semantics over big data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rethinking defeasible reasoning a scalable approach")
  Member "scaling datalog for machine learning on big data":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "pregelix big ger graph analytics on a dataflow engine")
  Member "multi core processors an overview":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adabatch efficient gradient aggregation rules for sequential and parallel stochastic gradient methods")
  Member "relational transducers for declarative networking":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "keeping calm when distributed consistency is easy")
  Member "xsb extending prolog with tabled logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tabled typeclass resolution")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the seventh answer set programming competition design and results")

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)