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 "improving the robustness to data inconsistency between training and testing for code completion by hierarchical language model"):
  Abstract: In the field of software engineering, applying language models to the token sequence of source code is the state-of-art approach to build a code recommendation system. The syntax tree of source code has hierarchical structures. Ignoring the characteristics of tree structures decreases the model performance. Current LSTM model handles sequential data. The performance of LSTM model will decrease sharply if the noise unseen data is distributed everywhere in the test suite. As code has free naming conventions, it is common for a model trained on one project to encounter many unknown words on another project. If we set many unseen words as UNK just like the solution in natural language processing, the number of UNK will be much greater than the sum of the most frequently appeared words. In an extreme case, just predicting UNK at everywhere may achieve very high prediction accuracy. Thus, such solution cannot reflect the true performance of a model when encountering noise unseen data. In this paper, we only mark a small number of rare words as UNK and show the prediction performance of models under in-project and cross-project evaluation. We propose a novel Hierarchical Language Model (HLM) to improve the robustness of LSTM model to gain the capacity about dealing with the inconsistency of data distribution between training and testing. The newly proposed HLM takes the hierarchical structure of code tree into consideration to predict code. HLM uses BiLSTM to generate embedding for sub-trees according to hierarchies and collects the embedding of sub-trees in context to predict next code. The experiments on inner-project and cross-project data sets indicate that the newly proposed Hierarchical Language Model (HLM) performs better than the state-of-art LSTM model in dealing with the data inconsistency between training and testing and achieves averagely 11.2\% improvement in prediction accuracy.

Includes members:
  Member "program language translation using a grammar driven tree to tree model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improve language modelling for code completion through statement level language model based on statement embedding generated by bilstm")
  Member "mapping language to code in programmatic context":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "structural language models of code")
  Member "code completion with neural attention and pointer networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "big code big vocabulary open vocabulary models for source code")
  Member "tree to tree neural networks for program translation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "does syntax need to grow on trees sources of hierarchical inductive bias in sequence to sequence networks")
  Member "a syntactic neural model for general purpose code generation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploring neural models for parsing natural language into first order logic")
  Member "seqgan sequence generative adversarial nets with policy gradient":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")
  Member "learning continuous semantic representations of symbolic expressions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "relational neural machines")
  Member "a deep language model for software code":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "big code big vocabulary open vocabulary models for source 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)