human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "guarding a subspace in high dimensional space with two defenders and one attacker"):
  Abstract: This paper is concerned with a subspace guarding game, which is a reach-avoid game, in high-dimensional space which consists of a play subspace and a target subspace divided by a hyperplane. In this differential game, two faster defenders cooperate to protect the target subspace by capturing an attacker which strives to enter into the target subspace from the play subspace without being captured. A complete, closed-form solution is provided from the perspectives of kind and degree. Contributions of the work include the use of the attack subspace (AS) method to construct the barrier, by which the game winner can be perfectly predicted before the game starts. In addition to this inclusion, with the priori information about the game result, two critical payoff functions are designed for two winning subspaces obtained from the barrier. Then, the optimal strategy for each player is reformulated as a saddle-point equilibrium, and the expression of the saddle-point equilibrium is presented in detail. Finally, we apply these theoretical results to a half-space guarding game in three-dimensional space. More realistically, since the whole achieved developments are analytical, they require a little memory without computational burden and allow for real-time updates, beyond the capacity of traditional Hamilton-Jacobi-Isaacs method. It is worth noting that this is the first time in the current work to consider the target guarding games for arbitrary high-dimensional space, and simultaneously in a fully analytical form.

Includes members:
  Member "exploiting symmetry for discrete time reachability computations":
    also connected through other hyperedges:
      (none)
  Member "recursive regression with neural networks approximating the hji pde solution":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hamilton jacobi reachability a brief overview and recent advances")

Question: Please tell me which class the source paper 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.SY(Systems and Control)