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: "symbolic reachability analysis of higher order context free processes"
  Abstract: We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA processes) where each process manipulates a data structure which can be seen as a nested stack of stacks. Our main result is that, for any higher-order context-free process, the set of all predecessors of a given regular set of configurations is regular and effectively constructible. This result generalizes the analogous result which is known for level 1 context-free processes. We show that this result holds also in the case of backward reachability analysis under a regular constraint on configurations. As a corollary, we obtain a symbolic model checking algorithm for the temporal logic E(U,X) with regular atomic predicates, i.e., the fragment of CTL restricted to the EU and EX modalities.

Connected through hyperedge HE-1 (induced by source paper "annotated stack trees"):
  with members:
    - "saturation of concurrent collapsible pushdown systems"
    - "senescent ground tree rewrite systems"
    - "the complexity of games on higher order pushdown automata"

Connected through hyperedge HE-2 (induced by source paper "saturation algorithms for model checking pushdown systems"):
  with members:
    - "saturation of concurrent collapsible pushdown systems"
    - "modeling and verification of infinite systems with resources"
    - "model checking of ordered multi pushdown automata"
    - "symbolic backwards reachability analysis for higher order pushdown systems"

Connected through hyperedge HE-3 (induced by source paper "unified analysis of collapsible and ordered pushdown automata via term rewriting"):
  with members:
    - "model checking of ordered multi pushdown automata"

Connected through hyperedge HE-4 (induced by source paper "reachability in higher order counters"):
  with members:
    - "strictness of the collapsible pushdown hierarchy"
    - "symbolic backwards reachability analysis for higher order pushdown systems"

Connected through hyperedge HE-5 (induced by source paper "symbolic backwards reachability analysis for higher order pushdown systems"):
  with members:
    - "the complexity of games on higher order pushdown automata"

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)