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: "dijkstra monads for free"
  Abstract: Dijkstra monads enable a dependent type theory to be enhanced with support for specifying and verifying effectful code via weakest preconditions. Together with their closely related counterparts, Hoare monads, they provide the basis on which verification tools like F*, Hoare Type Theory (HTT), and Ynot are built. #R##N#We show that Dijkstra monads can be derived "for free" by applying a continuation-passing style (CPS) translation to the standard monadic definitions of the underlying computational effects. Automatically deriving Dijkstra monads in this way provides a correct-by-construction and efficient way of reasoning about user-defined effects in dependent type theories. #R##N#We demonstrate these ideas in EMF*, a new dependently typed calculus, validating it via both formal proof and a prototype implementation within F*. Besides equipping F* with a more uniform and extensible effect system, EMF* enables a novel mixture of intrinsic and extrinsic proofs within F*.

Connected through hyperedge HE-1 (induced by source paper "dijkstra monads for all"):
  with members:
    - "signatures and induction principles for higher inductive inductive types"
    - "quantitative logics for equivalence of effectful programs"
    - "behavioural equivalence via modalities for algebraic effects"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"
    - "handling algebraic effects"
    - "exploring the boundaries of monad tensorability on set"

Connected through hyperedge HE-2 (induced by source paper "behavioural equivalence via modalities for algebraic effects"):
  with members:
    - "quantitative logics for equivalence of effectful programs"
    - "dijkstra monads for all"
    - "handling algebraic effects"
    - "abstract effects and proof relevant logical relations"
    - "a model of cooperative threads"
    - "on csp and the algebraic theory of effects"

Connected through hyperedge HE-3 (induced by source paper "mi cho coq a framework for certifying tezos smart contracts"):
  with members:
    - "scilla a smart contract intermediate level language"
    - "focalize inside an f ide"

Connected through hyperedge HE-4 (induced by source paper "verified low level programming embedded in f"):
  with members:
    - "mechanized semantics for the clight subset of the c language"

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)