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 "diamond sampling for approximate maximum all pairs dot product mad search"):
  Abstract: Given two sets of vectors, A = {a1&#x2192;, . . . , am&#x2192;} and B = {b1&#x2192;, . . . , bn&#x2192;}, our problem is to find the top-t dot products, i.e., the largest |ai&#x2192; · bj&#x2192;| among all possible pairs. This is a fundamental mathematical problem that appears in numerous data applications involving similarity search, link prediction, and collaborative filtering. We propose a sampling-based approach that avoids direct computation of all mn dot products. We select diamonds (i.e., four-cycles) from the weighted tripartite representation of A and B. The probability of selecting a diamond corresponding to pair (i, j) is proportional to (ai&#x2192; · bj&#x2192;)2, amplifying the focus on the largest-magnitude entries. Experimental results indicate that diamond sampling is orders of magnitude faster than direct computation and requires far fewer samples than any competing approach. We also apply diamond sampling to the special case of maximum inner product search, and get significantly better results than the state-of-theart hashing methods.

Includes members:
  Member "image based recommendations on styles and substitutes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "path sampling a fast and provable method for estimating 4 vertex subgraph counts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the power of pivoting for exact clique counting")
  Member "compressed matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "low rank matrix valued chernoff bounds and approximate matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on dimension free tail inequalities for sums of random matrices and applications")
  Member "finding associations and computing similarity via biased pair sampling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a memory efficient sketch method for estimating high similarities in streaming sets")
  Member "on sparse representations of linear operators and the approximation of matrix products":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "when hashes met wedges a distributed algorithm for finding high similarity vectors")

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.SI(Social and Information Networks)