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 "auto encoding twin bottleneck hashing"):
  Abstract: Conventional unsupervised hashing methods usually take advantage of similarity graphs, which are either pre-computed in the high-dimensional space or obtained from random anchor points. On the one hand, existing methods uncouple the procedures of hash function learning and graph construction. On the other hand, graphs empirically built upon original data could introduce biased prior knowledge of data relevance, leading to sub-optimal retrieval performance. In this paper, we tackle the above problems by proposing an efficient and adaptive code-driven graph, which is updated by decoding in the context of an auto-encoder. Specifically, we introduce into our framework twin bottlenecks (i.e., latent variables) that exchange crucial information collaboratively. One bottleneck (i.e., binary codes) conveys the high-level intrinsic data structure captured by the code-driven graph to the other (i.e., continuous variables for low-level detail information), which in turn propagates the updated network feedback for the encoder to learn more discriminative binary codes. The auto-encoding learning objective literally rewards the code-driven graph to learn an optimal encoder. Moreover, the proposed model can be simply optimized by gradient descent without violating the binary constraints. Experiments on benchmarked datasets clearly show the superiority of our framework over the state-of-the-art hashing methods.

Includes members:
  Member "distillhash unsupervised deep hashing by distilling data pairs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on deep hashing methods")
  Member "embarrassingly simple binary representation learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bidet an efficient binarized object detector")
  Member "zero shot sketch image hashing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sketch less for more on the fly fine grained sketch based image retrieval")
  Member "bingan learning compact binary descriptors with a regularized gan":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generative adversarial networks recent developments")
  Member "stochastic generative hashing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "a survey on deep hashing methods")
  Member "semi supervised classification with graph convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "relatext exploiting visual relationships for arbitrary shaped scene text detection with graph convolutional networks")
  Member "simultaneous feature learning and hash coding with deep neural networks":
    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)