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 "constructing adjacency arrays from incidence arrays"):
  Abstract: Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, E in and E out, to produce an adjacency array of the graph, A, that can be processed with a variety of algorithms. This paper provides the mathematical criteria to determine if the product A = E T\out E in will have the required structure of the adjacency array of the graph. The values in the resulting adjacency array are determined by the corresponding addition ⊕ and multiplication ⊗ operations used to perform the array multiplication. Illustrations of the various results possible from different ⊕ and ⊗ operations are provided using a small collection of popular music metadata.

Includes members:
  Member "algebraic conditions for generating accurate adjacency arrays":
    also connected through other hyperedges:
      (none)
  Member "graphulo implementation of server side sparse matrix multiply in the accumulo database":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "streaming 1 9 billion hypersparse network updates per second with d4m")
  Member "standards for graph algorithm primitives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a systematic survey of general sparse matrix matrix multiplication")

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.DS(Data Structures and Algorithms)