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 "recent progress on scaling algorithms and applications"):
  Abstract: Scaling problems have a rich and diverse history, and thereby have found numerous applications in several fields of science and engineering. For instance, the matrix scaling problem has had applications ranging from theoretical computer science to telephone forecasting, economics, statistics, optimization, among many other fields. Recently, a generalization of matrix scaling known as operator scaling has found applications in non-commutative algebra, invariant theory, combinatorics and algebraic complexity; and a further generalization (tensor scaling) has found more applications in quantum information theory, geometric complexity theory and invariant theory. In this survey, we will describe in detail the scaling problems mentioned above, showing how alternating minimization algorithms naturally arise in this setting, and we shall present a general framework to rigorously analyze such algorithms. These simple problems and algorithms are not just applicable to diverse mathematical and CS areas, but also serve to bring out deep connections between them. As this framework makes extensive use of concepts from invariant theory, we also provide a very gentle introduction to basic concepts of invariant theory and how they are used to analyze alternating minimization algorithms for the scaling problems. This survey is intended for a general computer science audience, and the only background required is basic knowledge of calculus and linear algebra, thereby making it accessible to graduate students and even to advanced undergraduates.

Includes members:
  Member "the paulsen problem continuous operator scaling and smoothed analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing")
  Member "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "operator scaling theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "constructive noncommutative rank computation is in deterministic polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "general linear group action on tensors a candidate for post quantum cryptography")
  Member "non commutative edmonds problem and matrix semi invariants":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions")
  Member "explicit lower bounds via geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "geometric complexity theory and tensor rank":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient algorithms for tensor scaling quantum marginals and moment polytopes")

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)