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: "passage ranking with weak supervision"
  Abstract: In this paper, we propose a \textit{weak supervision} framework for neural ranking tasks based on the data programming paradigm \citep{Ratner2016}, which enables us to leverage multiple weak supervision signals from different sources. Empirically, we consider two sources of weak supervision signals, unsupervised ranking functions and semantic feature similarities. We train a BERT-based passage-ranking model (which achieves new state-of-the-art performances on two benchmark datasets with full supervision) in our weak supervision framework. Without using ground-truth training labels, BERT-PR models outperform BM25 baseline by a large margin on all three datasets and even beat the previous state-of-the-art results with full supervision on two of the datasets.

Connected through hyperedge HE-1 (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"
    - "preference based interactive multi document summarisation"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "revisit semantic representation and tree search for similar question retrieval"):
  with members:
    - "joint optimization of tree based index and deep model for recommender systems"
    - "understanding the behaviors of bert in ranking"
    - "xlnet generalized autoregressive pretraining for language understanding"
    - "roberta a robustly optimized bert pretraining approach"
    - "a deep look into neural ranking models for information retrieval"
    - "universal sentence encoder"
    - "bert pre training of deep bidirectional transformers for language understanding"
    - "supervised learning of universal sentence representations from natural language inference data"

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.IR(Information Retrieval)