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: "quantum entanglement analysis based on abstract interpretation"
  Abstract: Entanglement is a non local property of quantum states which has no classical counterpart and plays a decisive role in quantum information theory. Several protocols, like the teleportation, are based on quantum entangled states. Moreover, any quantum algorithm which does not create entanglement can be efficiently simulated on a classical computer. The exact role of the entanglement is nevertheless not well understood. Since an exact analysis of entanglement evolution induces an exponential slowdown, we consider approximative analysis based on the framework of abstract interpretation. In this paper, a concrete quantum semantics based on superoperators is associated with a simple quantum programming language. The representation of entanglement, i.e. the design of the abstract domain is a key issue. A representation of entanglement as a partition of the memory is chosen. An abstract semantics is introduced, and the soundness of the approximation is proven.

Connected through hyperedge HE-1 (induced by source paper "a system f accounting for scalars"):
  with members:
    - "semantics of a typed algebraic lambda calculus"
    - "a finiteness structure on resource terms"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "a computational definition of the notion of vectorial space"
    - "algebraic totality towards completeness"
    - "reasoning about entanglement and separability in quantum higher order functions"
    - "a lambda calculus for quantum computation with classical control"
    - "probabilistic asynchronous pi calculus"

Connected through hyperedge HE-2 (induced by source paper "completeness of algebraic cps simulations"):
  with members:
    - "semantics of a typed algebraic lambda calculus"
    - "a finiteness structure on resource terms"
    - "a computational definition of the notion of vectorial space"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-3 (induced by source paper "reasoning about entanglement and separability in quantum higher order functions"):
  with members:
    - "a lambda calculus for quantum computation with classical control"

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)