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: "the foundational cryptography framework"
  Abstract: We present the Foundational Cryptography Framework (FCF) for developing and checking complete proofs of security for cryptographic schemes within a proof assistant. This is a general-purpose framework that is capable of modeling and reasoning about a wide range of cryptographic schemes, security definitions, and assumptions. Security is proven in the computational model, and the proof provides concrete bounds as well as asymptotic conclusions. FCF provides a language for probabilistic programs, a theory that is used to reason about programs, and a library of tactics and definitions that are useful in proofs about cryptography. The framework is designed to leverage fully the existing theory and capabilities of the Coq proof assistant in order to reduce the effort required to develop proofs.

Connected through hyperedge HE-1 (induced by source paper "a formal proof of pac learnability for decision stumps"):
  with members:
    - "guiding high performance sat solvers with unsat core predictions"
    - "gamepad a learning environment for theorem proving"
    - "holstep a machine learning dataset for higher order logic theorem proving"
    - "developing bug free machine learning systems with formal mathematics"
    - "on the expressive power of deep learning a tensor analysis"

Connected through hyperedge HE-2 (induced by source paper "symbolic abstractions for quantum protocol verification"):
  with members:
    - "formal analysis of 5g authentication"
    - "automated verification of quantum protocols using mcmas"
    - "an automated analysis of the security of quantum key distribution"

Connected through hyperedge HE-3 (induced by source paper "a separation logic for concurrent randomized programs"):
  with members:
    - "relational reasoning for markov chains in a probabilistic guarded lambda calculus"
    - "quantitative separation logic"
    - "proving uniformity and independence by self composition and coupling"
    - "coupling proofs are probabilistic product programs"
    - "a higher order logic for concurrent termination preserving refinement"
    - "a program logic for union bounds"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "relational reasoning via probabilistic coupling"

Connected through hyperedge HE-4 (induced by source paper "computer aided proofs for multiparty computation with active security"):
  with members:
    - "how to simulate it in isabelle towards formal proof for secure multi party computation"
    - "verified low level programming embedded in f"
    - "wys a verified language extension for secure multi party computations"
    - "hol y hammer online atp service for hol light"

Connected through hyperedge HE-5 (induced by source paper "a monadic framework for relational verification applied to information security program equivalence and optimizations"):
  with members:
    - "proof relevant logical relations for name generation"
    - "hypercollecting semantics and its application to static analysis of information flow"
    - "lightdp towards automating differential privacy proofs"
    - "language integrated provenance"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "abstract effects and proof relevant logical relations"
    - "quantitative information flow as safety and liveness hyperproperties"
    - "logical step indexed logical relations"

Connected through hyperedge HE-6 (induced by source paper "computational soundness for dalvik bytecode"):
  with members:
    - "computational soundness results for stateful applied pi calculus"
    - "extracting and verifying cryptographic models from c protocol code by symbolic execution"

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)