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 logic for true concurrency"
  Abstract: We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be identified which correspond to other true concurrent behavioural equivalences in the literature: step, pomset and history preserving bisimilarity. Standard Hennessy-Milner logic, and thus (interleaving) bisimilarity, is also recovered as a fragment. We also propose an extension of the logic with fixpoint operators, thus allowing to describe causal and concurrency properties of infinite computations. We believe that this work contributes to a rational presentation of the true concurrent spectrum and to a deeper understanding of the relations between the involved behavioural equivalences.

Connected through hyperedge HE-1 (induced by source paper "conflict vs causality in event structures"):
  with members:
    - "on characterising distributability"
    - "practical graph isomorphism ii"

Connected through hyperedge HE-2 (induced by source paper "an algebra of actors based on true concurrency"):
  with members:
    - "a calculus for true concurrency"
    - "algebraic laws for true concurrency"
    - "weakly true concurrency and its logic"
    - "a logic with reverse modalities for history preserving bisimulations"

Connected through hyperedge HE-3 (induced by source paper "a calculus for true concurrency"):
  with members:
    - "weakly true concurrency and its logic"
    - "a logic with reverse modalities for history preserving bisimulations"

Connected through hyperedge HE-4 (induced by source paper "algebraic laws for true concurrency"):
  with members:
    - "weakly true concurrency and its logic"
    - "a logic with reverse modalities for history preserving bisimulations"
    - "reverse bisimulations on stable configuration structures"

Connected through hyperedge HE-5 (induced by source paper "weakly true concurrency and its logic"):
  with members:
    - "a logic with reverse modalities for history preserving bisimulations"

Connected through hyperedge HE-6 (induced by source paper "contextual equivalences in configuration structures and reversibility"):
  with members:
    - "reversible barbed congruence on configuration structures"
    - "evaluating functions as processes"
    - "configuration structures event structures and petri nets"

Connected through hyperedge HE-7 (induced by source paper "a coalgebraic semantics for causality in petri nets"):
  with members:
    - "relating coalgebraic notions of bisimulation"

Connected through hyperedge HE-8 (induced by source paper "extensions of configuration structures"):
  with members:
    - "the glory of the past and geometrical concurrency"
    - "formal relationships between geometrical and classical models for concurrency"
    - "a logic with reverse modalities for history preserving bisimulations"
    - "configuration structures event structures and petri nets"

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)