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 "neural ranking models with weak supervision"):
  Abstract: Despite the impressive improvements achieved by unsupervised deep neural networks in computer vision and NLP tasks, such improvements have not yet been observed in ranking for information retrieval. The reason may be the complexity of the ranking problem, as it is not obvious how to learn from queries and documents when no supervised signal is available. Hence, in this paper, we propose to train a neural ranking model using weak supervision, where labels are obtained automatically without human annotators or any external resources (e.g., click data). To this aim, we use the output of an unsupervised ranking model, such as BM25, as a weak supervision signal. We further train a set of simple yet effective ranking models based on feed-forward neural networks. We study their effectiveness under various learning scenarios (point-wise and pair-wise models) and using different input representations (i.e., from encoding query-document pairs into dense/sparse vectors to using word embedding representation). We train our networks using tens of millions of training instances and evaluate it on two standard collections: a homogeneous news collection(Robust) and a heterogeneous large-scale web collection (ClueWeb). Our experiments indicate that employing proper objective functions and letting the networks to learn the input representation based on weakly supervised data leads to impressive performance, with over 13% and 35% MAP improvements over the BM25 model on the Robust and the ClueWeb collections. Our findings also suggest that supervised neural ranking models can greatly benefit from pre-training on large amounts of weakly labeled data that can be easily obtained from unsupervised IR models.

Includes members:
  Member "anmm ranking short answer texts with attention based neural matching model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "iart intent aware response ranking with transformers in information seeking conversation systems")
  Member "relevance based word embedding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selective weak supervision for neural information retrieval")
  Member "a deep relevance matching model for ad hoc retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "iart intent aware response ranking with transformers in information seeking conversation systems")
  Member "neural information retrieval a literature review":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an analysis of word2vec for the italian language")
  Member "getting started with neural models for semantic matching in web search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "share your model instead of your data privacy preserving mimic learning for ranking")
  Member "query expansion with locally trained word embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "selective weak supervision for neural information retrieval")
  Member "learning to match using local and distributed representations of text for web search":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "iart intent aware response ranking with transformers in information seeking conversation systems")
  Member "unsupervised efficient and semantic expertise retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "quality aware skill translation models for expert finding on stackoverflow")

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