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 piece wise linear feed forward neural networks"):
  Abstract: We present an approach for the verification of feed-forward neural networks in which all nodes have a piece-wise linear activation function. Such networks are often used in deep learning and have been shown to be hard to verify for modern satisfiability modulo theory (SMT) and integer linear programming (ILP) solvers. #R##N#The starting point of our approach is the addition of a global linear approximation of the overall network behavior to the verification problem that helps with SMT-like reasoning over the network behavior. We present a specialized verification algorithm that employs this approximation in a search process in which it infers additional node phases for the non-linear nodes in the network from partial node phase assignments, similar to unit propagation in classical SAT solving. We also show how to infer additional conflict clauses and safe node fixtures from the results of the analysis steps performed during the search. The resulting approach is evaluated on collision avoidance and handwritten digit recognition case studies.

Includes members:
  Member "reluplex an efficient smt solver for verifying deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adversarial ranking attack and defense")
  Member "measuring neural net robustness with constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "metrics and methods for robustness evaluation of neural networks with generative models")
  Member "safety verification of deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "deep learning in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "π nets deep polynomial neural networks")
  Member "sketch a net that beats humans":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning robust representations via multi view information bottleneck")
  Member "fast and accurate deep network learning by exponential linear units elus":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ride rewarding impact driven exploration for procedurally generated environments")
  Member "caffe convolutional architecture for fast feature embedding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "object detection in optical remote sensing images a survey and a new benchmark")

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.LO(Logic in Computer Science)