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 "subic a supervised structured binary code for image search"):
  Abstract: For large-scale visual search, highly compressed yet meaningful representations of images are essential. Structured vector quantizers based on product quantization and its variants are usually employed to achieve such compression while minimizing the loss of accuracy. Yet, unlike binary hashing schemes, these unsupervised methods have not yet benefited from the supervision, end-to-end learning and novel architectures ushered in by the deep learning revolution. We hence propose herein a novel method to make deep convolutional neural networks produce supervised, compact, structured binary codes for visual search. Our method makes use of a novel block-softmax non-linearity and of batch-based entropy losses that together induce structure in the learned encodings. We show that our method outperforms state-of-the-art compact representations based on deep hashing or structured quantization in single and cross-domain category retrieval, instance retrieval and classification. We make our code and models publicly available online.

Includes members:
  Member "billion scale similarity search with gpus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "constrained dominant sets and its applications in computer vision")
  Member "approximate search with quantized sparse representations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reconfigurable inverted index")
  Member "how should we evaluate supervised hashing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantic cluster unary loss for efficient deep hashing")
  Member "learning to hash with binary deep neural network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on deep hashing methods")
  Member "deep semantic ranking based hashing for multi label image retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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-8 (induced by source paper "a survey on deep hashing methods")

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)