human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "identifying well formed natural language questions"
  Abstract: Understanding search queries is a hard problem as it involves dealing with "word salad" text ubiquitously issued by users. However, if a query resembles a well-formed question, a natural language processing pipeline is able to perform more accurate interpretation, thus reducing downstream compounding errors. Hence, identifying whether or not a query is well formed can enhance query understanding. Here, we introduce a new task of identifying a well-formed natural language question. We construct and release a dataset of 25,100 publicly available questions classified into well-formed and non-wellformed categories and report an accuracy of 70.7% on the test set. We also show that our classifier can be used to improve the performance of neural sequence-to-sequence models for generating questions for reading comprehension.

Connected through hyperedge HE-1 (induced by source paper "unsupervised question decomposition for question answering"):
  with members:
    - "break it down a question understanding benchmark"
    - "unsupervised question answering by cloze translation"
    - "compositional questions do not necessitate multi hop reasoning"
    - "gqa a new dataset for real world visual reasoning and compositional question answering"
    - "self assembling modular networks for interpretable multi hop reasoning"
    - "revealing the importance of semantic retrieval for machine reading at scale"
    - "huggingface s transformers state of the art natural language processing"
    - "multi hop reading comprehension through question decomposition and rescoring"

Connected through hyperedge HE-2 (induced by source paper "superglue a stickier benchmark for general purpose language understanding systems"):
  with members:
    - "boolq exploring the surprising difficulty of natural yes no questions"
    - "right for the wrong reasons diagnosing syntactic heuristics in natural language inference"
    - "paws paraphrase adversaries from word scrambling"
    - "what do you learn from context probing for sentence structure in contextualized word representations"
    - "a surprisingly robust trick for the winograd schema challenge"
    - "multi task deep neural networks for natural language understanding"
    - "improving multi task deep neural networks via knowledge distillation for natural language understanding"
    - "human vs muppet a conservative estimate of human performance on the glue benchmark"

Connected through hyperedge HE-3 (induced by source paper "generative question refinement with deep reinforcement learning in retrieval based qa system"):
  with members:
    - "learning to coordinate multiple reinforcement learning agents for diverse query reformulation"
    - "proximal policy optimization and its dynamic version for sequence generation"
    - "no metrics are perfect adversarial reward learning for visual storytelling"
    - "bert pre training of deep bidirectional transformers for language understanding"
    - "memen multi layer embedding with memory networks for machine comprehension"
    - "learning to paraphrase for question answering"
    - "sentence simplification with deep reinforcement learning"
    - "ask the right questions active question reformulation with reinforcement learning"

Connected through hyperedge HE-4 (induced by source paper "unsupervised question answering by cloze translation"):
  with members:
    - "evaluating rewards for question generation models"
    - "cross lingual language model pretraining"
    - "unsupervised statistical machine translation"
    - "multiple attribute text style transfer"
    - "efficient and robust question answering from minimal context over documents"
    - "knowledgeable reader enhancing cloze style reading comprehension with external commonsense knowledge"
    - "dynamic integration of background knowledge in neural nlu systems"
    - "what makes reading comprehension questions easier"

Connected through hyperedge HE-5 (induced by source paper "how to ask better questions a large scale multi domain dataset for rewriting ill formed questions"):
  with members:
    - "translating web search queries into natural language questions"
    - "corpora generation for grammatical error correction"
    - "decomposable neural paraphrase generation"
    - "controllable paraphrase generation with a syntactic exemplar"
    - "adversarial example generation with syntactically controlled paraphrase networks"
    - "learning to paraphrase for question answering"
    - "paranmt 50m pushing the limits of paraphrastic sentence embeddings with millions of machine translations"
    - "ask the right questions active question reformulation with reinforcement learning"

Question: Please tell me which class the center node 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)