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 geometry of parallelism classical probabilistic and quantum effects"
  Abstract: We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its adequacy for a full quantum programming language in which entanglement, duplication, and recursion are all available. Our model comes with a multi-token machine, a proof net system, and a PCF-style language. The approach we develop is not specific to quantum computation, and our model is an instance of a new framework whose main feature is the ability to model commutative effects in a parallel setting. Being based on a multi-token machine equipped with a memory, it has a concrete nature which makes it well suited for building low-level operational descriptions of higher-order languages.

Connected through hyperedge HE-1 (induced by source paper "the abstract machinery of interaction long version"):
  with members:
    - "crumbling abstract machines"
    - "proof nets and the linear substitution calculus"
    - "leftmost outermost beta reduction is invariant indeed"
    - "on the relative usefulness of fireballs"
    - "abstract machines for dialogue games"

Connected through hyperedge HE-2 (induced by source paper "decomposing probabilistic lambda calculi"):
  with members:
    - "lambda calculus and probabilistic computation"
    - "a probabilistic and non deterministic call by push value language"
    - "probabilistic call by push value"
    - "full abstraction for probabilistic pcf"
    - "probabilistic operational semantics for the lambda calculus"

Connected through hyperedge HE-3 (induced by source paper "lambda calculus and probabilistic computation"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "confluence in probabilistic rewriting"
    - "on probabilistic term rewriting"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "toward general analysis of recursive probability models"
    - "church a language for generative models"
    - "probabilistic operational semantics for the lambda calculus"
    - "confluence results for a quantum lambda calculus with measurements"

Connected through hyperedge HE-4 (induced by source paper "the geometry of bayesian programming"):
  with members:
    - "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization"
    - "a domain theory for statistical probabilistic programming"
    - "measurable cones and stable measurable functions a model for probabilistic higher order programming"
    - "a convenient category for higher order probability theory"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "full abstraction for probabilistic pcf"
    - "church a language for generative models"

Connected through hyperedge HE-5 (induced by source paper "quantum programming with inductive datatypes causality and affine type theory"):
  with members:
    - "mixed linear and non linear recursive types"
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "von neumann algebras form a model for the quantum lambda calculus"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "semantics for a quantum programming language by operator algebras"

Connected through hyperedge HE-6 (induced by source paper "transparent synchronous dataflow"):
  with members:
    - "the dynamic geometry of interaction machine a call by need graph rewriter"
    - "the complexity of abstract machines"
    - "tensorflow a system for large scale machine learning"

Connected through hyperedge HE-7 (induced by source paper "probabilistic rewriting on normalization termination and unique normal forms"):
  with members:
    - "lambda calculus and probabilistic computation"
    - "confluence in probabilistic rewriting"
    - "on probabilistic term rewriting"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "probabilistic operational semantics for the lambda calculus"
    - "confluence results for a quantum lambda calculus with measurements"

Connected through hyperedge HE-8 (induced by source paper "the dynamic geometry of interaction machine a token guided graph rewriter"):
  with members:
    - "efficient implementation of evaluation strategies via token guided graph rewriting"
    - "the dynamic geometry of interaction machine a call by need graph rewriter"
    - "the complexity of abstract machines"
    - "leftmost outermost beta reduction is invariant indeed"
    - "linear dependent types and relative completeness"

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.LO(Logic in Computer Science)