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 "supervised hashing using graph cuts and boosted decision trees"):
  Abstract: To build large-scale query-by-example image retrieval systems, embedding image features into a binary Hamming space provides great benefits. Supervised hashing aims to map the original features to compact binary codes that are able to preserve label based similarity in the binary Hamming space. Most existing approaches apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of those methods, and can result in complex optimization problems that are difficult to solve. In this work we proffer a flexible yet simple framework that is able to accommodate different types of loss functions and hash functions. The proposed framework allows a number of existing approaches to hashing to be placed in context, and simplifies the development of new problem-specific hashing methods. Our framework decomposes the hashing learning problem into two steps: binary code (hash bit) learning and hash function learning. The first step can typically be formulated as binary quadratic problems, and the second step can be accomplished by training a standard binary classifier. For solving large-scale binary code inference, we show how it is possible to ensure that the binary quadratic problems are submodular such that efficient graph cut methods may be used. To achieve efficiency as well as efficacy on large-scale high-dimensional data, we propose to use boosted decision trees as the hash functions, which are nonlinear, highly descriptive, and are very fast to train and evaluate. Experiments demonstrate that the proposed method significantly outperforms most state-of-the-art methods, especially on high-dimensional data.

Includes members:
  Member "fast supervised hashing with decision trees for high dimensional data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probability weighted compact feature for domain adaptive retrieval")
  Member "optimizing ranking measures for compact binary code learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "structured learning of binary codes with column generation")
  Member "learning hash functions using column generation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep multi index hashing for person re identification")
  Member "decaf a deep convolutional activation feature for generic visual recognition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "crl class representative learning for image classification")
  Member "inductive hashing on manifolds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proximity preserving binary code using signed graph cut")
  Member "a general two step approach to learning based hashing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep ordinal hashing with spatial attention")
  Member "self taught hashing for fast similarity search":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning compressed sentence representations for on device text processing")

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.LG(Machine Learning)