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: "entanglement in quantum process algebra"
  Abstract: We explicitly model entanglement in quantum processes by treating entanglement as a kind of parallelism. We introduce a shadow constant quantum operation and a so-called entanglement merge into quantum process algebra qACP. The transition rules of the shadow constant quantum operation and entanglement merge are designed. We also do a sound and complete axiomatization modulo the so-called quantum bisimularity for the shadow constant quantum operation and entanglement merge. Then, this new type entanglement merge is extended into the full qACP. The new qACP has wide use in verification for quantum protocols, since most quantum protocols have mixtures with classical and quantum information, and also there are many quantum protocols adopting entanglement.

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

Connected through hyperedge HE-2 (induced by source paper "an algebra of reversible quantum computing"):
  with members:
    - "an algebra of reversible computation"
    - "an axiomatization for quantum processes to unifying quantum and classical computing"
    - "a structural approach to reversible computation"

Connected through hyperedge HE-3 (induced by source paper "entanglement in reversible quantum computing"):
  with members:
    - "algebraic laws for true concurrency"
    - "an algebra of reversible quantum computing"
    - "an algebra of reversible computation"

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)