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: "description and optimization of abstract machines in a dialect of prolog"
  Abstract: In order to achieve competitive performance, abstract machines for Prolog and related languages#R##N#end up being large and intricate, and incorporate sophisticated optimizations, both at the design#R##N#and at the implementation levels. At the same time, efficiency considerations make it necessary#R##N#to use low-level languages in their implementation. This makes them laborious to code, optimize,#R##N#and, especially, maintain and extend. Writing the abstract machine (and ancillary code) in a#R##N#higher-level language can help tame in part this inherent complexity. In this paper we show#R##N#how the semantics of most basic components of an efficient virtual machine for Prolog can be#R##N#described using (a variant of) Prolog which retains much of its semantics. These descriptions#R##N#are then compiled to C and assembled to build a complete bytecode emulator. Thanks to the#R##N#high level of the language used and its closeness to Prolog, the abstract machine description can#R##N#be manipulated using standard Prolog compilation and optimization techniques with relative#R##N#ease. We also show how, by applying program transformations selectively, we obtain abstract#R##N#machine implementations whose performance can match and even exceed that of state-of-theart, highly-tuned, hand-crafted emulators.

Connected through hyperedge HE-1 (induced by source paper "i2kit a tool for immutable infrastructure deployments based on lightweight virtual machines specialized to run containers"):
  with members:
    - "loophole timing attacks on shared event loops in chrome"

Connected through hyperedge HE-2 (induced by source paper "horn clauses as an intermediate representation for program analysis and transformation"):
  with members:
    - "the octagon abstract domain"

Connected through hyperedge HE-3 (induced by source paper "an overview of ciao and its design philosophy"):
  with members:
    - "on the generation of test data for prolog by partial evaluation"
    - "distributed www programming using ciao prolog and the pillow library"
    - "more precise yet efficient type inference for logic programs"

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)