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 "a semantic loss function for deep learning with symbolic knowledge"):
  Abstract: This paper develops a novel methodology for using symbolic knowledge in deep learning. From first principles, we derive a semantic loss function that bridges between neural output vectors and logical constraints. This loss function captures how close the neural network is to satisfying the constraints on its output. An experimental evaluation shows that our semantic loss function effectively guides the learner to achieve (near-)state-of-the-art results on semi-supervised multi-class classification. Moreover, it significantly increases the ability of the neural network to predict structured objects, such as rankings and paths. These discrete concepts are tremendously difficult to learn, and benefit from a tight integration of deep learning and symbolic reasoning methods.

Includes members:
  Member "imposing hard constraints on deep networks promises and limitations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non parametric uni modality constraints for deep ordinal classification")
  Member "logic tensor networks for semantic image interpretation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "fashion mnist a novel image dataset for benchmarking machine learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "adversarial sets for regularising neural link predictors":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "premise selection for theorem proving by deep graph embedding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an experimental study of formula embeddings for automated theorem proving in first order logic")
  Member "harnessing deep neural networks with logic rules":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "natural language qa approaches using reasoning with external knowledge")
  Member "programming with a differentiable forth interpreter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "from statistical relational to neuro symbolic artificial intelligence")
  Member "lifted rule injection for relation embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "knowledge graphs")

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)