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 "efficient image retrieval via decoupling diffusion into online and offline processing"):
  Abstract: Diffusion is commonly used as a ranking or re-ranking method in retrieval tasks to achieve higher retrieval performance, and has attracted lots of attention in recent years. A downside to diffusion is that it performs slowly in comparison to the naive k-NN search, which causes a non-trivial online computational cost on large datasets. To overcome this weakness, we propose a novel diffusion technique in this paper. In our work, instead of applying diffusion to the query, we pre-compute the diffusion results of each element in the database, making the online search a simple linear combination on top of the k-NN search process. Our proposed method becomes 10~ times faster in terms of online search speed. Moreover, we propose to use late truncation instead of early truncation in previous works to achieve better retrieval performance.

Includes members:
  Member "mining on manifolds metric learning without labels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "divide and conquer the embedding space for metric learning")
  Member "revisiting oxford and paris large scale image retrieval benchmarking":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "unifying deep local and global features for image search")
  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 "fast spectral ranking for similarity search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "smooth adversarial examples")
  Member "deep image retrieval learning global representations for image search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "approximating spectral clustering via sampling a review")
  Member "efficient diffusion on region manifolds recovering small objects with compact cnn representations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "constrained dominant sets and its applications in computer vision")
  Member "cnn image retrieval learns from bow unsupervised fine tuning with hard examples":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "image matching across wide baselines from paper to practice")

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)