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 "fast cosine similarity search in binary space with angular multi index hashing"):
  Abstract: Given a large dataset of binary codes and a binary query point, we address how to efficiently find $K$ codes in the dataset that yield the largest cosine similarities to the query. The straightforward answer to this problem is to compare the query with all items in the dataset, but this is practical only for small datasets. One potential solution to enhance the search time and achieve sublinear cost is to use a hash table populated with binary codes of the dataset and then look up the nearby buckets to the query to retrieve the nearest neighbors. However, if codes are compared in terms of cosine similarity rather than the Hamming distance, then the main issue is that the order of buckets to probe is not evident. To examine this issue, we first elaborate on the connection between the Hamming distance and the cosine similarity. Doing this allows us to systematically find the probing sequence in the hash table. However, solving the nearest neighbor search with a single table is only practical for short binary codes. To address this issue, we propose the angular multi-index hashing search algorithm which relies on building multiple hash tables on binary code substrings. The proposed search algorithm solves the exact angular $K$ nearest neighbor problem in a time that is often orders of magnitude faster than the linear scan baseline and even approximation methods.

Includes members:
  Member "ann benchmarks a benchmarking tool for approximate nearest neighbor algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating spectral clustering via sampling a review")
  Member "a survey on learning to hash":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on deep hashing methods")
  Member "learning to hash with binary deep neural network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on deep hashing methods")
  Member "efficient training of very deep neural networks for supervised hashing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on deep hashing methods")
  Member "hashing with binary autoencoders":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "auto encoding twin bottleneck hashing")
  Member "practical and optimal lsh for angular distance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "differentiable reasoning over a virtual knowledge base")
  Member "fast exact search in hamming space with multi index hashing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep multi index hashing for person re identification")

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.DB(Databases)