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 "interpretable time budget constrained contextualization for re ranking"):
  Abstract: Search engines operate under a strict time constraint as a fast response is paramount to user satisfaction. Thus, neural re-ranking models have a limited time-budget to re-rank documents. Given the same amount of time, a faster re-ranking model can incorporate more documents than a less efficient one, leading to a higher effectiveness. To utilize this property, we propose TK (Transformer-Kernel): a neural re-ranking model for ad-hoc search using an efficient contextualization mechanism. TK employs a very small number of Transformer layers (up to three) to contextualize query and document word embeddings. To score individual term interactions, we use a document-length enhanced kernel-pooling, which enables users to gain insight into the model. TK offers an optimal ratio between effectiveness and efficiency: under realistic time constraints (max. 200 ms per query) TK achieves the highest effectiveness in comparison to BERT and other re-ranking models. We demonstrate this on three large-scale ranking collections: MSMARCO-Passage, MSMARCO-Document, and TREC CAR. In addition, to gain insight into TK, we perform a clustered query analysis of TK's results, highlighting its strengths and weaknesses on queries with different types of information need and we show how to interpret the cause of ranking differences of two documents by comparing their internal scores.

Includes members:
  Member "analyzing multi head self attention specialized heads do the heavy lifting the rest can be pruned":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "train large then compress rethinking model size for efficient training and inference of transformers")
  Member "passage re ranking with bert":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selective weak supervision for neural information retrieval")
  Member "a study on the interpretability of neural retrieval models using deepshap":
    also connected through other hyperedges:
      (none)
  Member "document expansion by query prediction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "selective weak supervision for neural information retrieval")
  Member "incorporating query term independence assumption for efficient retrieval and ranking using deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "overview of the trec 2019 deep learning track")
  Member "an updated duet model for passage re ranking":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "overview of the trec 2019 deep learning track")
  Member "let s measure run time extending the ir replicability infrastructure to include performance aspects":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the replicability of combining word embeddings and retrieval models")
  Member "cedr contextualized embeddings for document ranking":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "selective weak supervision for neural information retrieval")

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)