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 "breaking the beam search curse a study of re scoring methods and stopping criteria for neural machine translation"):
  Abstract: Beam search is widely used in neural machine translation, and usually improves translation quality compared to greedy search. It has been widely observed that, however, beam sizes larger than 5 hurt translation quality. We explain why this happens, and propose several methods to address this problem. Furthermore, we discuss the optimal stopping criteria for these methods. Results show that our hyperparameter-free methods outperform the widely-used hyperparameter-free heuristic of length normalization by +2.0 BLEU, and achieve the best results among all methods on Chinese-to-English translation.

Includes members:
  Member "analyzing uncertainty in neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "discriminative adversarial search for abstractive summarization")
  Member "correcting length bias in neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consistency of a recurrent language model with respect to incomplete decoding")
  Member "convolutional sequence to sequence learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a brief survey of multilingual neural machine translation")
  Member "six challenges for neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a brief survey of multilingual neural machine translation")
  Member "sequence to sequence learning as beam search optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gradient based adversarial attacks on categorical sequence models via traversing an embedded world")
  Member "neural machine translation with reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bi decoder augmented network for neural machine translation")
  Member "google s neural machine translation system bridging the gap between human and machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "minimum risk training for neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "estimating gradients for discrete random variables by sampling without replacement")

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.CL(Computation and Language)