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: "proving equivalence between imperative and mapreduce implementations using program transformations"
  Abstract: Distributed programs are often formulated in popular functional frameworks like MapReduce,#R##N#Spark and Thrill, but writing efficient algorithms for such frameworks is usually a non-trivial#R##N#task. As the costs of running faulty algorithms at scale can be severe, it is highly desirable#R##N#to verify their correctness.#R##N#We propose to employ existing imperative reference implementations as specifications#R##N#for MapReduce implementations. To this end, we present a novel verification approach in#R##N#which equivalence between an imperative and a MapReduce implementation is established#R##N#by a series of program transformations.#R##N#In this paper, we present how the equivalence framework can be used to prove equivalence#R##N#between an imperative implementation of the PageRank algorithm and its MapReduce#R##N#variant. The eight individual transformation steps are individually presented and explained.

Connected through hyperedge HE-1 (induced by source paper "relational equivalence proofs between imperative and mapreduce algorithms"):
  with members:
    - "an executable sequential specification for spark aggregation"
    - "the commutativity problem of the mapreduce framework a transducer based approach"
    - "thrill high performance algorithmic distributed batch data processing with c"

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)