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: "open bisimulation for quantum processes"
  Abstract: Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open bisimulation for quantum processes and show that it provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between quantum processes. We also give a modal characterisation of open bisimulation, by extending the Hennessy-Milner logic to a quantum setting.

Connected through hyperedge HE-1 (induced by source paper "probabilistic process algebra to unifying quantum and classical computing in closed systems"):
  with members:
    - "entanglement in quantum process algebra"
    - "an axiomatization for quantum processes to unifying quantum and classical computing"
    - "symbolic bisimulation for quantum processes"

Connected through hyperedge HE-2 (induced by source paper "applicative bisimulation and quantum λ calculi long version"):
  with members:
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-3 (induced by source paper "entanglement in quantum process algebra"):
  with members:
    - "an axiomatization for quantum processes to unifying quantum and classical computing"
    - "symbolic bisimulation for quantum processes"

Connected through hyperedge HE-4 (induced by source paper "observational equivalence using schedulers for quantum processes"):
  with members:
    - "analysis of a quantum error correcting code using quantum process calculus"

Connected through hyperedge HE-5 (induced by source paper "an axiomatization for quantum processes to unifying quantum and classical computing"):
  with members:
    - "symbolic bisimulation for quantum processes"

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)