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 "injecting domain knowledge in neural networks a controlled experiment on a constrained problem"):
  Abstract: Given enough data, Deep Neural Networks (DNNs) are capable of learning complex input-output relations with high accuracy. In several domains, however, data is scarce or expensive to retrieve, while a substantial amount of expert knowledge is available. It seems reasonable that if we can inject this additional information in the DNN, we could ease the learning process. One such case is that of Constraint Problems, for which declarative approaches exists and pure ML solutions have obtained mixed success. Using a classical constrained problem as a case study, we perform controlled experiments to probe the impact of progressively adding domain and empirical knowledge in the DNN. Our results are very encouraging, showing that (at least in our setup) embedding domain knowledge at training time can have a considerable effect and that a small amount of empirical knowledge is sufficient to obtain practically useful results.

Includes members:
  Member "integrating learning and reasoning with deep logic models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "semi supervised learning using differentiable reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "deepproblog neural probabilistic logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "machine learning for combinatorial optimization a methodological tour d horizon":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lossless compression of deep neural networks")
  Member "deep neural networks as 0 1 mixed integer linear programs a feasibility study":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "randomized smoothing of all shapes and sizes")
  Member "learning explanatory rules from noisy data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "neural combinatorial optimization with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "logic tensor networks deep learning and logical reasoning from data and knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the next decade in ai four steps towards robust artificial intelligence")

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)