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: "galois transformers and modular abstract interpreters reusable metatheory for program analysis"
  Abstract: The design and implementation of static analyzers has become increasingly systematic. Yet for a given language or analysis feature, it often requires tedious and error prone work to implement an analyzer and prove it sound. In short, static analysis features and their proofs of soundness do not compose well, causing a dearth of reuse in both implementation and metatheory. We solve the problem of systematically constructing static analyzers by introducing Galois transformers: monad transformers that transport Galois connection properties. In concert with a monadic interpreter, we define a library of monad transformers that implement building blocks for classic analysis parameters like context, path, and heap (in)sensitivity. Moreover, these can be composed together independent of the language being analyzed. Significantly, a Galois transformer can be proved sound once and for all, making it a reusable analysis component. As new analysis features and abstractions are developed and mixed in, soundness proofs need not be reconstructed, as the composition of a monad transformer stack is sound by virtue of its constituents. Galois transformers provide a viable foundation for reusable and composable metatheory for program analysis. Finally, these Galois transformers shift the level of abstraction in analysis design and implementation to a level where non-specialists have the ability to synthesize sound analyzers over a number of parameters.

Connected through hyperedge HE-1 (induced by source paper "reusing static analysis across different domain specific languages using reference attribute grammars"):
  with members:
    - "one tool many languages language parametrictransformation with incremental parametric syntax"
    - "monticore a framework for compositional development of domain specific languages"

Connected through hyperedge HE-2 (induced by source paper "abstracting definitional interpreters functional pearl"):
  with members:
    - "pushdown control flow analysis for free"
    - "soft contract verification"
    - "pushdown flow analysis with abstract garbage collection"
    - "simulation of two way pushdown automata revisited"
    - "abstracting abstract control extended"
    - "introspective pushdown analysis of higher order programs"
    - "systematic abstraction of abstract machines"
    - "cfa2 a context free approach to control flow analysis"

Connected through hyperedge HE-3 (induced by source paper "calculational design of information flow monitors extended version"):
  with members:
    - "generalizing permissive upgrade in dynamic information flow analysis"
    - "a survey on product operators in abstract interpretation"
    - "epistemic temporal logic for information flow security"
    - "attacker control and impact for confidentiality and integrity"

Connected through hyperedge HE-4 (induced by source paper "constructive galois connections taming the galois connection framework for mechanized metatheory"):
  with members:
    - "formal verification of a c value analysis based on abstract interpretation"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "mechanically verified calculational abstract interpretation"):
  with members:
    - "formal verification of a c value analysis based on abstract interpretation"

Connected through hyperedge HE-6 (induced by source paper "running probabilistic programs backwards"):
  with members:
    - "measure transformer semantics for bayesian machine learning"
    - "church a language for generative models"
    - "monolingual probabilistic programming using generalized coroutines"

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)