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 "deep lda hashing"):
  Abstract: The conventional supervised hashing methods based on classification do not entirely meet the requirements of hashing technique, but Linear Discriminant Analysis (LDA) does. In this paper, we propose to perform a revised LDA objective over deep networks to learn efficient hashing codes in a truly end-to-end fashion. However, the complicated eigenvalue decomposition within each mini-batch in every epoch has to be faced with when simply optimizing the deep network w.r.t. the LDA objective. In this work, the revised LDA objective is transformed into a simple least square problem, which naturally overcomes the intractable problems and can be easily solved by the off-the-shelf optimizer. Such deep extension can also overcome the weakness of LDA Hashing in the limited linear projection and feature learning. Amounts of experiments are conducted on three benchmark datasets. The proposed Deep LDA Hashing shows nearly 70 points improvement over the conventional one on the CIFAR-10 dataset. It also beats several state-of-the-art methods on various metrics.

Includes members:
  Member "supervised learning of semantics preserving hash via deep convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "random vlad based deep hashing for efficient image retrieval")
  Member "deep supervised discrete hashing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on deep hashing methods")
  Member "deep binary reconstruction for cross modal hashing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on deep hashing methods")
  Member "hashnet deep learning to hash by continuation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on deep hashing methods")
  Member "fast supervised discrete hashing and its analysis":
    also connected through other hyperedges:
      (none)
  Member "deep supervised hashing with triplet labels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on deep hashing methods")
  Member "hashing with binary autoencoders":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "auto encoding twin bottleneck hashing")
  Member "feature learning based deep supervised hashing with pairwise labels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)