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: "computation tree logic with deadlock detection"
  Abstract: We study the equivalence relation on states of labelled transition systems of#N#satisfying the same formulas in Computation Tree Logic without the next state#N#modality (CTL-X). This relation is obtained by De Nicola & Vaandrager by#N#translating labelled transition systems to Kripke structures, while lifting the#N#totality restriction on the latter. They characterised it as divergence#N#sensitive branching bisimulation equivalence.#N#  We find that this equivalence fails to be a congruence for interleaving#N#parallel composition. The reason is that the proposed application of CTL-X to#N#non-total Kripke structures lacks the expressiveness to cope with deadlock#N#properties that are important in the context of parallel composition. We#N#propose an extension of CTL-X, or an alternative treatment of non-totality,#N#that fills this hiatus. The equivalence induced by our extension is#N#characterised as branching bisimulation equivalence with explicit divergence,#N#which is, moreover, shown to be the coarsest congruence contained in divergence#N#sensitive branching bisimulation equivalence.

Connected through hyperedge HE-1 (induced by source paper "divide and congruence iii from decomposition of modal formulas to preservation of stability and divergence"):
  with members:
    - "sequential composition in the presence of intermediate termination extended abstract"
    - "divide and congruence ii from decomposition of modal formulas to preservation of delay and weak bisimilarity"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-2 (induced by source paper "rooted divergence preserving branching bisimilarity is a congruence"):
  with members:
    - "sequential composition in the presence of intermediate termination extended abstract"
    - "lean and full congruence formats for recursion"
    - "on the executability of interactive computation"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-3 (induced by source paper "sequential composition in the presence of intermediate termination extended abstract"):
  with members:
    - "sequential composition in the presence of intermediate termination"
    - "on the executability of interactive computation"
    - "expressiveness modulo bisimilarity of regular expressions with parallel composition"
    - "reactive turing machines"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-4 (induced by source paper "games for bisimulations and abstraction"):
  with members:
    - "parity game reductions"
    - "branching bisimilarity checking for prs"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-5 (induced by source paper "reactive turing machines"):
  with members:
    - "expressiveness modulo bisimilarity of regular expressions with parallel composition"
    - "branching bisimilarity with explicit divergence"
    - "interactive small step algorithms i axiomatization"

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)