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 "efficient algorithms for tensor scaling quantum marginals and moment polytopes"):
  Abstract: We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our algorithm provides an efficient weak membership oracle for the associated moment polytopes, an important family of implicitly-defined convex polytopes with exponentially many facets and a wide range of applications. These include the entanglement polytopes from quantum information theory (in particular, we obtain an efficient solution to the notorious one-body quantum marginal problem) and the Kronecker polytopes from representation theory (which capture the asymptotic support of Kronecker coefficients). Our algorithm can be applied to succinct descriptions of the input tensor whenever the marginals can be efficiently computed, as in the important case of matrix product states or tensor-train decompositions, widely used in computational physics and numerical mathematics. Beyond these applications, the algorithm enriches the arsenal of "numerical" methods for classical problems in invariant theory that are significantly faster than "symbolic" methods which explicitly compute invariants or covariants of the relevant action. We stress that (like almost all past algorithms) our convergence rate is polynomial in the approximation parameter; it is an intriguing question to achieve exponential convergence rate, beating symbolic algorithms exponentially, and providing strong membership and separation oracles for the problems above. We strengthen and generalize the alternating minimization approach of previous papers by introducing the theory of highest weight vectors from representation theory into the numerical optimization framework. We show that highest weight vectors are natural potential functions for scaling algorithms and prove new bounds on their evaluations to obtain polynomial-time convergence. Our techniques are general and we believe that they will be instrumental to obtain efficient algorithms for moment polytopes beyond the ones consider here, and more broadly, for other optimization problems possessing natural symmetries.

Includes members:
  Member "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "alternating minimization scaling algorithms and the null cone problem from invariant theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "membership in moment polytopes is in np and conp":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implementing geometric complexity theory on the separation of orbit closures via symmetries")
  Member "on vanishing of kronecker coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "general linear group action on tensors a candidate for post quantum cryptography")
  Member "a deterministic polynomial time algorithm for non commutative rational identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")

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)