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: "key fact as pivot a two stage model for low resource table to text generation"
  Abstract: Table-to-text generation aims to translate the structured data into the unstructured text. Most existing methods adopt the encoder-decoder framework to learn the transformation, which requires large-scale training samples. However, the lack of large parallel data is a major practical problem for many domains. In this work, we consider the scenario of low resource table-to-text generation, where only limited parallel data is available. We propose a novel model to separate the generation into two stages: key fact prediction and surface realization. It first predicts the key facts from the tables, and then generates the text with the key facts. The training of key fact prediction needs much fewer annotated data, while surface realization can be trained with pseudo parallel corpus. We evaluate our model on a biography generation dataset. Our model can achieve $27.34$ BLEU score with only $1,000$ parallel data, while the baseline model only obtain the performance of $9.71$ BLEU score.

Connected through hyperedge HE-1 (induced by source paper "variational template machine for data to text generation"):
  with members:
    - "using monolingual data in neural machine translation a systematic study"
    - "the curious case of neural text degeneration"
    - "table to text generation with effective hierarchical encoder on three dimensions row column and time"
    - "generating sentences from disentangled syntactic and semantic spaces"
    - "disentangled representation learning for non parallel text style transfer"
    - "can neural generators for dialogue learn sentence planning and discourse structuring"
    - "unsupervised discrete sentence representation learning for interpretable neural dialog generation"
    - "describing a knowledge base"

Connected through hyperedge HE-2 (induced by source paper "sticking to the facts confident decoding for faithful data to text generation"):
  with members:
    - "stochastic beams and where to find them the gumbel top k trick for sampling sequences without replacement"
    - "data to text generation with entity modeling"
    - "text generation with exemplar based adaptive decoding"
    - "handling divergent reference texts when evaluating table to text generation"
    - "calibration entropy rates and memory in language models"
    - "leveraging pre trained checkpoints for sequence generation tasks"
    - "bottom up abstractive summarization"
    - "learning neural templates for text generation"

Connected through hyperedge HE-3 (induced by source paper "table to text natural language generation with unseen schemas"):
  with members:
    - "domain adaptive dialog generation via meta learning"
    - "domain adaptation of neural machine translation by lexicon induction"
    - "step by step separating planning from realization in neural data to text generation"
    - "learning to compose topic aware mixture of experts for zero shot video captioning"
    - "zero shot question generation from knowledge graphs for unseen predicates and entity types"
    - "natural language to structured query generation via meta learning"
    - "data to text generation with content selection and planning"
    - "get to the point summarization with pointer generator networks"

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)