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 "testing properties of functions on finite groups"):
  Abstract: We study testing properties of functions on finite groups. First we consider functions of the form $f:G \to \mathbb{C}$, where $G$ is a finite group. We show that conjugate invariance, homomorphism, and the property of being proportional to an irreducible character is testable with a constant number of queries to $f$, where a character is a crucial notion in representation theory. Our proof relies on representation theory and harmonic analysis on finite groups. Next we consider functions of the form $f: G \to M_d(\mathbb{C})$, where $d$ is a fixed constant and $M_d(\mathbb{C})$ is the family of $d$ by $d$ matrices with each element in $\mathbb{C}$. For a function $g:G \to M_d(\mathbb{C})$, we show that the unitary isomorphism to $g$ is testable with a constant number of queries to $f$, where we say that $f$ and $g$ are unitary isomorphic if there exists a unitary matrix $U$ such that $f(x) = Ug(x)U^{-1}$ for any $x \in G$.

Includes members:
  Member "a characterization of locally testable affine invariant properties via decomposition theorems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a characterization of constant sample testable properties")
  Member "estimating the distance from testable affine invariant properties":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast fourier sparsity testing")
  Member "every locally characterized affine invariant property is testable":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "torus polynomials an algebraic approach to acc lower bounds")
  Member "testing low complexity affine invariant properties":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "testing noisy linear functions for sparsity")
  Member "partially symmetric functions are efficiently isomorphism testable":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distribution free testing of linear functions on r n")

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)