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 "revisiting the inverted indices for billion scale approximate nearest neighbors"):
  Abstract: This work addresses the problem of billion-scale nearest neighbor search. The state-of-the-art retrieval systems for billion-scale databases are currently based on the inverted multi-index, the recently proposed generalization of the inverted index structure. The multi-index provides a very fine-grained partition of the feature space that allows extracting concise and accurate short-lists of candidates for the search queries. In this paper, we argue that the potential of the simple inverted index was not fully exploited in previous works and advocate its usage both for the highly-entangled deep descriptors and relatively disentangled SIFT descriptors. We introduce a new retrieval system that is based on the inverted index and outperforms the multi-index by a large margin for the same memory consumption and construction complexity. For example, our system achieves the state-of-the-art recall rates up to six times faster on the dataset of one billion deep descriptors compared to the efficient implementation of the inverted multi-index from the FAISS library.

Includes members:
  Member "polysemous codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning to compress and search visual data in large scale systems")
  Member "low shot learning with large scale diffusion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semi supervised few shot learning with prototypical random walks")
  Member "billion scale similarity search with gpus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "efficient large scale approximate nearest neighbor search on the gpu":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "kidnapped radar topological radar localisation using rotationally invariant metric learning")
  Member "approximate search with quantized sparse representations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reconfigurable inverted index")
  Member "efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximating spectral clustering via sampling a review")
  Member "searching in one billion vectors re rank with source coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning to compress and search visual data in large scale systems")

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.CV(Computer Vision and Pattern Recognition)