human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "fast supervised hashing with decision trees for high dimensional data"
  Abstract: Supervised hashing aims to map the original features to compact binary codes that are able to preserve label based similarity in the Hamming space. Non-linear hash functions have demonstrated their advantage over linear ones due to their powerful generalization capability. In the literature, kernel functions are typically used to achieve non-linearity in hashing, which achieve encouraging retrieval perfor- mance at the price of slow evaluation and training time. Here we propose to use boosted decision trees for achieving non-linearity in hashing, which are fast to train and evalu- ate, hence more suitable for hashing with high dimensional data. In our approach, we first propose sub-modular for- mulations for the hashing binary code inference problem and an efficient GraphCut based block search method for solving large-scale inference. Then we learn hash func- tions by training boosted decision trees to fit the binary codes. Experiments demonstrate that our proposed method significantly outperforms most state-of-the-art methods in retrieval precision and training time. Especially for high- dimensional data, our method is orders of magnitude faster than many methods in terms of training time.

Connected through hyperedge HE-1 (induced by source paper "probability weighted compact feature for domain adaptive retrieval"):
  with members:
    - "optimal projection guided transfer hashing for image retrieval"
    - "deep hashing network for unsupervised domain adaptation"
    - "decaf a deep convolutional activation feature for generic visual recognition"

Connected through hyperedge HE-2 (induced by source paper "semantic cluster unary loss for efficient deep hashing"):
  with members:
    - "ssdh semi supervised deep hashing for large scale image retrieval"
    - "supervised learning of semantics preserving hash via deep convolutional neural networks"
    - "deep reinforcement learning for image hashing"
    - "mihash online hashing with mutual information"
    - "deep supervised discrete hashing"
    - "sphereface deep hypersphere embedding for face recognition"
    - "mean teachers are better role models weight averaged consistency targets improve semi supervised deep learning results"
    - "no fuss distance metric learning using proxies"

Connected through hyperedge HE-3 (induced by source paper "simultaneous feature aggregating and hashing for compact binary code learning"):
  with members:
    - "on device scalable image based localization via prioritized cascade search and fast one many ransac"
    - "deep supervised discrete hashing"
    - "simultaneous feature aggregating and hashing for large scale image search"
    - "embedding based on function approximation for large scale image search"
    - "a survey on learning to hash"
    - "learning to hash with binary deep neural network"
    - "binaryconnect training deep neural networks with binary weights during propagations"
    - "deep semantic ranking based hashing for multi label image retrieval"

Connected through hyperedge HE-4 (induced by source paper "deep supervised hashing leveraging quadratic spherical mutual information for content based image retrieval"):
  with members:
    - "triplet based deep hashing network for cross modal retrieval"
    - "mihash online hashing with mutual information"
    - "deep supervised discrete hashing"
    - "asymmetric deep supervised hashing"
    - "hashnet deep learning to hash by continuation"
    - "fashion mnist a novel image dataset for benchmarking machine learning algorithms"
    - "deep supervised hashing with triplet labels"
    - "densely connected convolutional networks"

Connected through hyperedge HE-5 (induced by source paper "ssdh semi supervised deep hashing for large scale image retrieval"):
  with members:
    - "a survey on learning to hash"
    - "how should we evaluate supervised hashing"
    - "hashing on nonlinear manifolds"
    - "deep semantic ranking based hashing for multi label image retrieval"
    - "simultaneous feature learning and hash coding with deep neural networks"
    - "bit scalable deep hashing with regularized similarity learning for image retrieval and person re identification"
    - "return of the devil in the details delving deep into convolutional nets"
    - "imagenet large scale visual recognition challenge"

Connected through hyperedge HE-6 (induced by source paper "video segment copy detection using memory constrained hierarchical batch normalized lstm autoencoder"):
  with members:
    - "self supervised video hashing with hierarchical binary auto encoder"
    - "hashnet deep learning to hash by continuation"
    - "a survey on learning to hash"
    - "recurrent batch normalization"
    - "hashing on nonlinear manifolds"
    - "feature learning based deep supervised hashing with pairwise labels"
    - "deep residual learning for image recognition"
    - "adam a method for stochastic optimization"

Connected through hyperedge HE-7 (induced by source paper "push for quantization deep fisher hashing"):
  with members:
    - "fast supervised discrete hashing"
    - "deep supervised discrete hashing"
    - "hashnet deep learning to hash by continuation"
    - "deep supervised hashing with triplet labels"
    - "deep cross modal hashing"
    - "efficient training of very deep neural networks for supervised hashing"
    - "deep semantic ranking based hashing for multi label image retrieval"
    - "simultaneous feature learning and hash coding with deep neural networks"

Connected through hyperedge HE-8 (induced by source paper "sadih semantic aware discrete hashing"):
  with members:
    - "fast supervised discrete hashing"
    - "supervised discrete hashing with relaxation"
    - "highly economized multi view binary compression for scalable image clustering"
    - "a survey on learning to hash"
    - "simultaneous feature learning and hash coding with deep neural networks"
    - "feature learning based deep supervised hashing with pairwise labels"
    - "very deep convolutional networks for large scale image recognition"
    - "revisiting kernelized locality sensitive hashing for improved large scale image retrieval"

Question: Please tell me which class the center node 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)