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: "optimizing the factual correctness of a summary a study of summarizing radiology reports"
  Abstract: Neural abstractive summarization models are able to generate summaries which have high overlap with human references. However, existing models are not optimized for factual correctness, a critical metric in real-world applications. In this work, we develop a general framework where we evaluate the factual correctness of a generated summary by fact-checking it against its reference using an information extraction module. We further propose a training strategy which optimizes a neural summarization model with a factual correctness reward via reinforcement learning. We apply the proposed method to the summarization of radiology reports, where factual correctness is a key requirement. On two separate datasets collected from real hospitals, we show via both automatic and human evaluation that the proposed approach substantially improves the factual correctness and overall quality of outputs over a competitive neural summarization system.

Connected through hyperedge HE-1 (induced by source paper "boosting factual correctness of abstractive summarization with knowledge graph"):
  with members:
    - "passage re ranking with bert"
    - "evaluating the factual consistency of abstractive text summarization"
    - "make lead bias in your favor a simple and effective method for news summarization"
    - "assessing the factual accuracy of generated text"
    - "text summarization with pretrained encoders"
    - "unified language model pre training for natural language understanding and generation"
    - "sentencepiece a simple and language independent subword tokenizer and detokenizer for neural text processing"
    - "bottom up abstractive summarization"

Connected through hyperedge HE-2 (induced by source paper "generating followup questions for interpretable multi hop question answering"):
  with members:
    - "multi paragraph reasoning with knowledge enhanced graph neural network"
    - "compositional questions do not necessitate multi hop reasoning"
    - "cognitive graph for multi hop reading comprehension at scale"
    - "multi hop paragraph retrieval for open domain question answering"
    - "qasc a dataset for question answering via sentence composition"
    - "capturing greater context for question generation"
    - "revealing the importance of semantic retrieval for machine reading at scale"
    - "multi hop reading comprehension through question decomposition and rescoring"

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)