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: "preference based interactive multi document summarisation"
  Abstract: Interactive NLP is a promising paradigm to close the gap between automatic NLP systems and the human upper bound. Preference-based interactive learning has been successfully applied, but the existing methods require several thousand interaction rounds even in simulations with perfect user feedback. In this paper, we study preference-based interactive summarisation. To reduce the number of interaction rounds, we propose the Active Preference-based ReInforcement Learning (APRIL) framework. APRIL uses Active Learning to query the user, Preference Learning to learn a summary ranking function from the preferences, and neural Reinforcement Learning to efficiently search for the (near-)optimal summary. Our results show that users can easily provide reliable preferences over summaries and that APRIL outperforms the state-of-the-art preference-based interactive method in both simulation and real-user experiments.

Connected through hyperedge HE-1 (induced by source paper "fine tuning language models from human preferences"):
  with members:
    - "towards coherent and engaging spoken dialog response generation using automatic conversation evaluators"
    - "finding generalizable evidence by learning to convince q a models"
    - "reward learning for efficient reinforcement learning in extractive document summarisation"
    - "sample efficient text summarization using a single pre trained transformer"
    - "towards coherent and cohesive long form text generation"
    - "deep batch active learning by diverse uncertain gradient lower bounds"
    - "way off policy batch deep reinforcement learning of implicit human preferences in dialog"
    - "learning from dialogue after deployment feed yourself chatbot"

Connected through hyperedge HE-2 (induced by source paper "interactive text ranking with bayesian optimisation a case study on community qa and summarisation"):
  with members:
    - "end to end robotic reinforcement learning without reward engineering"
    - "passage ranking with weak supervision"
    - "april interactively learning to summarise by combining active preference learning and reinforcement learning"
    - "active learning for interactive neural machine translation of data streams"
    - "finding convincing arguments using scalable bayesian preference learning"
    - "bert pre training of deep bidirectional transformers for language understanding"
    - "improving a neural semantic parser by counterfactual learning from human bandit feedback"
    - "commonsense for generative multi hop question answering tasks"

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)