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 "link and code fast indexing with graphs and compact regression codes"):
  Abstract: Similarity search approaches based on graph walks have recently attained outstanding speed-accuracy trade-offs, taking aside the memory requirements. In this paper, we revisit these approaches by considering, additionally, the memory constraint required to index billions of images on a single server. This leads us to propose a method based both on graph traversal and compact representations. We encode the indexed vectors using quantization and exploit the graph structure to refine the similarity estimation. #R##N#In essence, our method takes the best of these two worlds: the search strategy is based on nested graphs, thereby providing high precision with a relatively small set of comparisons. At the same time it offers a significant memory compression. As a result, our approach outperforms the state of the art on operating points considering 64-128 bytes per vector, as demonstrated by our results on two billion-scale public benchmarks.

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 "deep image retrieval learning global representations for image search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "constrained dominant sets and its applications in computer vision")
  Member "efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximating spectral clustering via sampling a review")
  Member "cnn image retrieval learns from bow unsupervised fine tuning with hard examples":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "image matching across wide baselines from paper to practice")
  Member "particular object retrieval with integral max pooling of cnn activations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "unifying deep local and global features for image search")
  Member "multi scale orderless pooling of deep convolutional activation features":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning representations by predicting bags of visual words")

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)