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: "goal oriented reduction of automata networks"
  Abstract: We consider networks of finite-state machines having local transitions conditioned by the current state of other automata. In this paper, we introduce a reduction procedure tailored for reachability properties of the form “from global state \({s}\), there exists a sequence of transitions leading to a state where an automaton g is in a local state \(\top \)”. By analysing the causality of transitions within the individual automata, the reduction identifies local transitions which can be removed while preserving all the minimal traces satisfying the reachability property. The complexity of the procedure is polynomial with the total number of local transitions, and exponential with the maximal number of local states within an automaton. Applied to Boolean and multi-valued networks modelling dynamics of biological systems, the reduction can shrink down significantly the reachable state space, enhancing the tractability of the model-checking of large networks.

Connected through hyperedge HE-1 (induced by source paper "relationship between the reprogramming determinants of boolean networks and their interaction graph"):
  with members:
    - "negative circuits and sustained oscillations in asynchronous automata networks"
    - "positive circuits and maximal number of fixed points in discrete dynamical systems"

Connected through hyperedge HE-2 (induced by source paper "goal driven unfolding of petri nets"):
  with members:
    - "under approximating cut sets for reachability in large scale automata networks"

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)