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 "formal verification of neural network controlled autonomous systems"):
  Abstract: In this paper, we consider the problem of formally verifying the safety of an autonomous robot equipped with a Neural Network (NN) controller that processes LiDAR images to produce control actions. Given a workspace that is characterized by a set of polytopic obstacles, our objective is to compute the set of safe initial conditions such that a robot trajectory starting from these initial conditions is guaranteed to avoid the obstacles. Our approach is to construct a finite state abstraction of the system and use standard reachability analysis over the finite state abstraction to compute the set of the safe initial states. The first technical problem in computing the finite state abstraction is to mathematically model the imaging function that maps the robot position to the LiDAR image. To that end, we introduce the notion of imaging-adapted sets as partitions of the workspace in which the imaging function is guaranteed to be affine. We develop a polynomial-time algorithm to partition the workspace into imaging-adapted sets along with computing the corresponding affine imaging functions. Given this workspace partitioning, a discrete-time linear dynamics of the robot, and a pre-trained NN controller with Rectified Linear Unit (ReLU) nonlinearity, the second technical challenge is to analyze the behavior of the neural network. To that end, we utilize a Satisfiability Modulo Convex (SMC) encoding to enumerate all the possible segments of different ReLUs. SMC solvers then use a Boolean satisfiability solver and a convex programming solver and decompose the problem into smaller subproblems. To accelerate this process, we develop a pre-processing algorithm that could rapidly prune the space feasible ReLU segments. Finally, we demonstrate the efficiency of the proposed algorithms using numerical simulations with increasing complexity of the neural network controller.

Includes members:
  Member "adversarial sample detection for deep neural network through model mutation testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reliability validation of learning enabled vehicle tracking")
  Member "deepgauge comprehensive and multi granularity testing criteria for gauging the robustness of deep learning systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reliability validation of learning enabled vehicle tracking")
  Member "automated verification of neural networks advances challenges and perspectives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "verification of neural networks enhancing scalability through pruning")
  Member "robust deep reinforcement learning for security and safety in autonomous vehicle systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "survey of deep reinforcement learning for motion planning of autonomous vehicles")
  Member "agi safety literature review":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ai safety state of the field through quantitative lens")
  Member "deepgauge multi granularity testing criteria for deep learning systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "importance driven deep learning system testing")
  Member "deepmutation mutation testing of deep learning systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "importance driven deep learning system testing")
  Member "concolic testing for deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "importance driven deep learning system testing")

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