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: "a finite equational base for ccs with left merge and communication merge"
  Abstract: Using the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and $\omega$-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabelling. Our equational base is finite if the set of actions is finite.

Connected through hyperedge HE-1 (induced by source paper "unique parallel decomposition for the π calculus"):
  with members:
    - "unique parallel decomposition in branching and weak bisimulation semantics"
    - "a distribution law for ccs and a new congruence result for the p calculus"

Connected through hyperedge HE-2 (induced by source paper "honesty by typing"):
  with members:
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"
    - "using higher order contracts to model session types"
    - "choreography synthesis as contract agreement"
    - "on the realizability of contracts in dishonest systems"
    - "contracts in distributed systems"

Connected through hyperedge HE-3 (induced by source paper "unique parallel decomposition in branching and weak bisimulation semantics"):
  with members:
    - "a geometric approach to the problem of unique decomposition of processes"
    - "a distribution law for ccs and a new congruence result for the p calculus"

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)