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 "neural network guided expression transformation"):
  Abstract: Optimizing compilers, as well as other translator systems, often work by rewriting expressions according to equivalence preserving rules. Given an input expression and its optimized form, finding the sequence of rules that were applied is a non-trivial task. Most of the time, the tools provide no proof, of any kind, of the equivalence between the original expression and its optimized form. In this work, we propose to reconstruct proofs of equivalence of simple mathematical expressions, after the fact, by finding paths of equivalence preserving transformations between expressions. We propose to find those sequences of transformations using a search algorithm, guided by a neural network heuristic. Using a Tree-LSTM recursive neural network, we learn a distributed representation of expressions where the Manhattan distance between vectors approximately corresponds to the rewrite distance between expressions. We then show how the neural network can be efficiently used to search for transformation paths, leading to substantial gain in speed compared to an uninformed exhaustive search. In one of our experiments, our neural-network guided search algorithm is able to solve more instances with a 2 seconds timeout per instance than breadth-first search does with a 5 minutes timeout per instance.

Includes members:
  Member "semeval 2016 task 4 sentiment analysis in twitter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "related tasks can share a multi task framework for affective language")
  Member "code2vec learning distributed representations of code":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarial robustness for code")
  Member "learning a sat solver from single bit supervision":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "teaching temporal logics to neural networks")
  Member "in datacenter performance analysis of a tensor processing unit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "train large then compress rethinking model size for efficient training and inference of transformers")
  Member "mastering chess and shogi by self play with a general reinforcement learning algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")
  Member "a fast unified model for parsing and sentence understanding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "description based text classification with reinforcement learning")
  Member "learning program embeddings to propagate feedback on student code":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "teaching temporal logics to neural networks")
  Member "improved semantic representations from tree structured long short term memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "unbiased scene graph generation from biased training")

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)