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: "refinement reflection complete verification with smt"
  Abstract: We introduce Refinement Reflection, a new framework for building SMT-based deductive verifiers. The key idea is to reflect the code implementing a user-defined function into the function’s (output) refinement type. As a consequence, at uses of the function, the function definition is instantiated in the SMT logic in a precise fashion that permits decidable verification. Reflection allows the user to write equational proofs of programs just by writing other programs using pattern-matching and recursion to perform case-splitting and induction. Thus, via the propositions-as-types principle, we show that reflection permits the specification of arbitrary functional correctness properties. Finally, we introduce a proof-search algorithm called Proof by Logical Evaluation that uses techniques from model checking and abstract interpretation, to completely automate equational reasoning. We have implemented reflection in Liquid Haskell and used it to verify that the widely used instances of the Monoid, Applicative, Functor, and Monad typeclasses actually satisfy key algebraic laws required to make the clients safe, and have used reflection to build the first library that actually verifies assumptions about associativity and ordering that are crucial for safe deterministic parallelism.

Connected through hyperedge HE-1 (induced by source paper "system fr as foundations for stainless"):
  with members:
    - "type based termination inflationary fixed points and mixed inductive coinductive types"
    - "miniagda integrating sized and dependent types"
    - "semi continuous sized types and termination"

Connected through hyperedge HE-2 (induced by source paper "lweb information flow security for multi tier web applications"):
  with members:
    - "cryptographically secure information flow control on key value stores"
    - "build it break it fix it contesting secure development"
    - "precise dynamic information flow for database backed applications"

Connected through hyperedge HE-3 (induced by source paper "gradual liquid type inference"):
  with members:
    - "learning to blame localizing novice type errors with data driven diagnosis"
    - "soft contract verification for higher order stateful programs"
    - "dynamic witnesses for static type errors or ill typed programs usually go wrong"
    - "soft contract verification"
    - "higher order symbolic execution via contracts"

Connected through hyperedge HE-4 (induced by source paper "meta f proof automation with smt tactics and metaprograms"):
  with members:
    - "recalling a witness foundations and applications of monotonic state"
    - "mizar 40 for mizar 40"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-5 (induced by source paper "smtlink 2 0"):
  with members:
    - "meta extract using existing facts in meta reasoning"
    - "extending acl2 with smt solvers"

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)