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: "the dynamic controllability of conditional stns with uncertainty"
  Abstract: Recent attempts to automate business processes and medical-treatment processes have uncovered the need for a formal framework that can accommodate not only temporal constraints, but also observations and actions with uncontrollable durations. To meet this need, this paper defines a Conditional Simple Temporal Network with Uncertainty (CSTNU) that combines the simple temporal constraints from a Simple Temporal Network (STN) with the conditional nodes from a Conditional Simple Temporal Problem (CSTP) and the contingent links from a Simple Temporal Network with Uncertainty (STNU). A notion of dynamic controllability for a CSTNU is defined that generalizes the dynamic consistency of a CTP and the dynamic controllability of an STNU. The paper also presents some sound constraint-propagation rules for dynamic controllability that are expected to form the backbone of a dynamic-controllability-checking algorithm for CSTNUs.

Connected through hyperedge HE-1 (induced by source paper "complexity bounds for the controllability of temporal networks with conditions disjunctions and uncertainty"):
  with members:
    - "dynamic controllability of conditional simple temporal networks is pspace complete"

Connected through hyperedge HE-2 (induced by source paper "checking dynamic consistency of conditional hyper temporal networks via mean payoff games hardness and pseudo singly exponential time algorithm"):
  with members:
    - "hyper temporal networks"
    - "polynomial time algorithms for energy games with special weight structures"
    - "the tropical shadow vertex algorithm solves mean payoff games in polynomial time on average"
    - "using strategy improvement to stay alive"

Connected through hyperedge HE-3 (induced by source paper "dynamic controllability of conditional simple temporal networks is pspace complete"):
  with members:
    - "checking dynamic consistency of conditional simple temporal networks via mean payoff games a singly exponential time algorithm"
    - "dynamic consistency of conditional simple temporal networks via mean payoff games a singly exponential time dc checking"

Connected through hyperedge HE-4 (induced by source paper "instantaneous reaction time in dynamic consistency checking of conditional simple temporal networks"):
  with members:
    - "hyper temporal networks"
    - "dynamic consistency of conditional simple temporal networks via mean payoff games a singly exponential time dc checking"

Connected through hyperedge HE-5 (induced by source paper "dynamic consistency of conditional simple temporal networks via mean payoff games a singly exponential time dc checking"):
  with members:
    - "hyper temporal networks"
    - "polynomial time algorithms for energy games with special weight structures"
    - "the tropical shadow vertex algorithm solves mean payoff games in polynomial time on average"
    - "using strategy improvement to stay alive"

Connected through hyperedge HE-6 (induced by source paper "checking dynamic consistency of conditional simple temporal networks via mean payoff games a singly exponential time algorithm"):
  with members:
    - "hyper temporal networks"
    - "polynomial time algorithms for energy games with special weight structures"
    - "using strategy improvement to stay alive"

Connected through hyperedge HE-7 (induced by source paper "security constraints in temporal role based access controlled workflows extended version"):
  with members:
    - "iterative plan construction for the workflow satisfiability problem"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"

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.AI(Artificial Intelligence)