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 "ssdh semi supervised deep hashing for large scale image retrieval"):
  Abstract: Hashing methods have been widely used for efficient similarity retrieval on large scale image database. Traditional hashing methods learn hash functions to generate binary codes from hand-crafted features, which achieve limited accuracy since the hand-crafted features cannot optimally represent the image content and preserve the semantic similarity. Recently, several deep hashing methods have shown better performance because the deep architectures generate more discriminative feature representations. However, these deep hashing methods are mainly designed for supervised scenarios, which only exploit the semantic similarity information, but ignore the underlying data structures. In this paper, we propose the semi-supervised deep hashing approach, to perform more effective hash function learning by simultaneously preserving semantic similarity and underlying data structures. The main contributions are as follows: 1) We propose a  semi-supervised loss  to jointly minimize the empirical error on labeled data, as well as the embedding error on both labeled and unlabeled data, which can preserve the semantic similarity and capture the meaningful neighbors on the underlying data structures for effective hashing. 2) A  semi-supervised deep hashing network  is designed to extensively exploit both labeled and unlabeled data, in which we propose an  online graph construction  method to benefit from the evolving deep features during training to better capture semantic neighbors. To the best of our knowledge, the proposed deep network is the  first  deep hashing method that can perform hash code learning and feature learning simultaneously in a semi-supervised fashion. Experimental results on five widely-used data sets show that our proposed approach outperforms the state-of-the-art hashing methods.

Includes members:
  Member "a survey on learning to hash":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on deep hashing methods")
  Member "how should we evaluate supervised hashing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semantic cluster unary loss for efficient deep hashing")
  Member "hashing on nonlinear manifolds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep multi view enhancement hashing for image retrieval")
  Member "deep semantic ranking based hashing for multi label image retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on deep hashing methods")
  Member "simultaneous feature learning and hash coding with deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on deep hashing methods")
  Member "bit scalable deep hashing with regularized similarity learning for image retrieval and person re identification":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on deep hashing methods")
  Member "return of the devil in the details delving deep into convolutional nets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on deep hashing methods")
  Member "imagenet large scale visual recognition challenge":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")

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)