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: "wave style token machines and quantum lambda calculi"
  Abstract: Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those of a simple quantum l -calculus with implicit qubits. This, however, requires generalising the concept of a token machine to one in which more than one particle travel around the term at the same time. The presence of multiple tokens is intimately related to entanglement and allows us to give a simple operational semantics to the calculus, coherently with the principles of quantum computation.

Connected through hyperedge HE-1 (induced by source paper "quantum programming made easy"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "qpcf higher order languages and quantum circuits"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "probabilistic operational semantics for the lambda calculus"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-2 (induced by source paper "qpcf higher order languages and quantum circuits"):
  with members:
    - "quantum programming made easy"
    - "formalization of metatheory of the quipper quantum programming language in a linear logic"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "full abstraction for probabilistic pcf"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "probabilistic operational semantics for the lambda calculus"

Connected through hyperedge HE-3 (induced by source paper "quantum b uchi automata"):
  with members:
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-4 (induced by source paper "quantum turing machines computations and measurements"):
  with members:
    - "towards a theory of quantum computability"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-5 (induced by source paper "semantics of higher order quantum computation via geometry of interaction"):
  with members:
    - "quantum alternation prospects and problems"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "on multiplicative linear logic modality and quantum circuits"
    - "confluence results for a quantum lambda calculus with measurements"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-6 (induced by source paper "the geometry of parallelism classical probabilistic and quantum effects"):
  with members:
    - "semantics of higher order quantum computation via geometry of interaction"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-7 (induced by source paper "towards a theory of quantum computability"):
  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)