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 "outline generation understanding the inherent content structure of documents"):
  Abstract: In this paper, we introduce and tackle the Outline Generation (OG) task, which aims to unveil the inherent content structure of a multi-paragraph document by identifying its potential sections and generating the corresponding section headings. Without loss of generality, the OG task can be viewed as a novel structured summarization task. To generate a sound outline, an ideal OG model should be able to capture three levels of coherence, namely the coherence between context paragraphs, that between a section and its heading, and that between context headings. The first one is the foundation for section identification, while the latter two are critical for consistent heading generation. In this work, we formulate the OG task as a hierarchical structured prediction problem, i.e., to first predict a sequence of section boundaries and then a sequence of section headings accordingly. We propose a novel hierarchical structured neural generation model, named HiStGen, for the task. Our model attempts to capture the three-level coherence via the following ways. First, we introduce a Markov paragraph dependency mechanism between context paragraphs for section identification. Second, we employ a section-aware attention mechanism to ensure the semantic coherence between a section and its heading. Finally, we leverage a Markov heading dependency mechanism and a review mechanism between context headings to improve the consistency and eliminate duplication between section headings. Besides, we build a novel WIKIOG dataset, a public collection which consists of over 1.75 million document-outline pairs for research on the OG task. Experimental results on our benchmark dataset demonstrate that our model can significantly outperform several state-of-the-art sequential generation models for the OG task.

Includes members:
  Member "keyphrase generation with correlation constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "large scale evaluation of keyphrase extraction models")
  Member "deep keyphrase generation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "two huge title and keyword generation corpora of research articles")
  Member "automated phrase mining from massive text corpora":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cube2net efficient query specific network construction with data cube organization")
  Member "get to the point summarization with pointer generator networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mast a memory augmented self supervised tracker")
  Member "abstractive text summarization using sequence to sequence rnns and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "prophetnet predicting future n gram for sequence to sequence pre training")
  Member "incorporating copying mechanism in sequence to sequence learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recent advances and challenges in task oriented dialog system")
  Member "sequence to sequence rnns for text summarization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "prophetnet predicting future n gram for sequence to sequence pre training")
  Member "a neural attention model for abstractive sentence summarization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a 3 accelerating attention mechanisms in neural networks with approximation")

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)