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 "pyramid a general framework for distributed similarity search"):
  Abstract: Similarity search is a core component in various applications such as image matching, product recommendation and low-shot classification. However, single machine solutions are usually insufficient due to the large cardinality of modern datasets and stringent latency requirement of on-line query processing. We present Pyramid, a general and efficient framework for distributed similarity search. Pyramid supports search with popular similarity functions including Euclidean distance, angular distance and inner product. Different from existing distributed solutions that are based on KD-tree or locality sensitive hashing (LSH), Pyramid is based on Hierarchical Navigable Small World graph (HNSW), which is the state of the art similarity search algorithm on a single machine. To achieve high query processing throughput, Pyramid partitions a dataset into sub-datasets containing similar items for index building and assigns a query to only some of the sub-datasets for query processing. To provide the robustness required by production deployment, Pyramid also supports failure recovery and straggler mitigation. Pyramid offers a set of concise API such that users can easily use Pyramid without knowing the details of distributed execution. Experiments on large-scale datasets show that Pyramid produces quality results for similarity search, achieves high query processing throughput and is robust under node failure and straggler.

Includes members:
  Member "norm ranging lsh for maximum inner product search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the space complexity of inner product filters")
  Member "link and code fast indexing with graphs and compact regression codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast compact and highly scalable visual place recognition through sequence based matching of overloaded representations")
  Member "revisiting the inverted indices for billion scale approximate nearest neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quicker adc unlocking the hidden potential of product quantization with simd")
  Member "low shot learning with large scale diffusion":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semi supervised few shot learning with prototypical random walks")
  Member "billion scale similarity search with gpus":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "fast approximate nearest neighbor search with navigating spreading out graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "a survey on deep hashing methods")
  Member "clustering is efficient for approximate maximum inner product search":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a 3 accelerating attention mechanisms in neural networks with approximation")

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.DC(Distributed, Parallel, and Cluster Computing)