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 "detecting code clones with graph neural networkand flow augmented abstract syntax tree"):
  Abstract: Code clones are semantically similar code fragments pairs that are syntactically similar or different. Detection of code clones can help to reduce the cost of software maintenance and prevent bugs. Numerous approaches of detecting code clones have been proposed previously, but most of them focus on detecting syntactic clones and do not work well on semantic clones with different syntactic features. To detect semantic clones, researchers have tried to adopt deep learning for code clone detection to automatically learn latent semantic features from data. Especially, to leverage grammar information, several approaches used abstract syntax trees (AST) as input and achieved significant progress on code clone benchmarks in various programming languages. However, these AST-based approaches still can not fully leverage the structural information of code fragments, especially semantic information such as control flow and data flow. To leverage control and data flow information, in this paper, we build a graph representation of programs called flow-augmented abstract syntax tree (FA-AST). We construct FA-AST by augmenting original ASTs with explicit control and data flow edges. Then we apply two different types of graph neural networks (GNN) on FA-AST to measure the similarity of code pairs. As far as we have concerned, we are the first to apply graph neural networks on the domain of code clone detection. #R##N#We apply our FA-AST and graph neural networks on two Java datasets: Google Code Jam and BigCloneBench. Our approach outperforms the state-of-the-art approaches on both Google Code Jam and BigCloneBench tasks.

Includes members:
  Member "fast graph representation learning with pytorch geometric":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on feature normalization and data augmentation")
  Member "graph matching networks for learning the similarity of graph structured objects":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep graph matching consensus")
  Member "graph neural networks a review of methods and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "natural language qa approaches using reasoning with external knowledge")
  Member "convolutional neural networks over control flow graphs for software defect prediction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using deep learning to solve computer security challenges a survey")
  Member "oreo detection of clones in the twilight zone":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "what you see is what it means semantic representation learning of code based on visualization and transfer learning")
  Member "generative code modeling with graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adversarial robustness for code")
  Member "neural message passing for quantum chemistry":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "learning to represent programs with graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adversarial robustness for code")

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.SE(Software Engineering)