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: "parallel instantiation of asp programs techniques and experiments"
  Abstract: Answer Set Programming (ASP) is a powerful logic-based programming language, which is enjoying increasing interest within the scientific community and (very recently) in industry. The evaluation of ASP programs is traditionally carried out in two steps. At the first step an input program P undergoes the so-called instantiation (or grounding) process, which produces a program P' semantically equivalent to P, but not containing any variable; in turn, P' is evaluated by using a backtracking search algorithm in the second step. It is well-known that instantiation is important for the efficiency of the whole evaluation, might become a bottleneck in common situations, is crucial in several realworld applications, and is particularly relevant when huge input data has to be dealt with. At the time of this writing, the available instantiator modules are not able to exploit satisfactorily the latest hardware, featuring multi-core/multi-processor SMP (Symmetric MultiProcessing) technologies. This paper presents some parallel instantiation techniques, including load-balancing and granularity control heuristics, which allow for the effective exploitation of the processing power offered by modern SMP machines. This is confirmed by an extensive experimental analysis herein reported. #R##N#To appear in Theory and Practice of Logic Programming (TPLP). #R##N#KEYWORDS: Answer Set Programming, Instantiation, Parallelism, Heuristics

Connected through hyperedge HE-1 (induced by source paper "optimizing answer set computation via heuristic based decomposition"):
  with members:
    - "the power of non ground rules in answer set programming"
    - "lpopt a rule optimization tool for answer set programming"
    - "asperix a first order forward chaining approach for answer set computing"
    - "clingo asp control preliminary report"
    - "the dlv system for knowledge representation and reasoning"
    - "unfolding partiality and disjunctions in stable model semantics"

Connected through hyperedge HE-2 (induced by source paper "bigsr an empirical study of real time expressive rdf stream reasoning on modern big data platforms"):
  with members:
    - "ticker a system for incremental asp based stream reasoning"
    - "strider a hybrid adaptive distributed rdf stream processing engine"
    - "expressive stream reasoning with laser"
    - "clingo asp control preliminary report"

Connected through hyperedge HE-3 (induced by source paper "efficient computation of the well founded semantics over big data"):
  with members:
    - "transformation based bottom up computation of the well founded model"

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.PL(Programming Languages)