human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "alternating minimization scaling algorithms and the null cone problem from invariant theory"
  Abstract: Alternating minimization heuristics seek to solve a (difficult) global optimization task through iteratively solving a sequence of (much easier) local optimization tasks on different parts (or blocks) of the input parameters. While popular and widely applicable, very few examples of this heuristic are rigorously shown to converge to optimality, and even fewer to do so efficiently.#R##N##R##N#In this paper we present a general framework which is amenable to rigorous analysis, and expose its applicability. Its main feature is that the local optimization domains are each a group of invertible matrices, together naturally acting on tensors, and the optimization problem is minimizing the norm of an input tensor under this joint action. The solution of this optimization problem captures a basic problem in Invariant Theory, called the null-cone problem.#R##N##R##N#This algebraic framework turns out to encompass natural computational problems in combinatorial optimization, algebra, analysis, quantum information theory, and geometric complexity theory. It includes and extends to high dimensions the recent advances on (2-dimensional) operator scaling.#R##N##R##N#Our main result is a fully polynomial time approximation scheme for this general problem, which may be viewed as a multi-dimensional scaling algorithm. This directly leads to progress on some of the problems in the areas above, and a unified view of others. We explain how faster convergence of an algorithm for the same problem will allow resolving central open problems.#R##N##R##N#Our main techniques come from Invariant Theory, and include its rich non-commutative duality theory, and new bounds on the bitsizes of coefficients of invariant polynomials. They enrich the algorithmic toolbox of this very computational field of mathematics, and are directly related to some challenges in geometric complexity theory (GCT).

Connected through hyperedge HE-1 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion"):
  with members:
    - "spectral analysis of matrix scaling and operator scaling"
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "efficient algorithms for tensor scaling quantum marginals and moment polytopes"
    - "maximum entropy distributions bit complexity and stability"
    - "computing maximum entropy distributions everywhere"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "operator scaling theory and applications"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"

Connected through hyperedge HE-2 (induced by source paper "general linear group action on tensors a candidate for post quantum cryptography"):
  with members:
    - "isomorphism problems for tensors groups and cubic forms completeness and reductions"
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "efficient algorithms for tensor scaling quantum marginals and moment polytopes"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "solving the isomorphism of polynomials with two secrets problem for all pairs of quadratic forms"
    - "polynomial time algorithms for quadratic isomorphism of polynomials the regular case"
    - "on the lattice isomorphism problem"

Connected through hyperedge HE-3 (induced by source paper "variety membership testing algebraic natural proofs and geometric complexity theory"):
  with members:
    - "barriers for rank methods in arithmetic complexity"
    - "succinct hitting sets and barriers to proving algebraic circuits lower bounds"
    - "discovering the roots uniform closure results for algebraic classes under factoring"
    - "towards an algebraic natural proofs barrier via polynomial identity testing"
    - "on the complexity of the permanent in various computational models"
    - "the complexity of tensor rank"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "computational limits for matrix completion"

Connected through hyperedge HE-4 (induced by source paper "search problems in algebraic complexity gct and hardness of generator for invariant rings"):
  with members:
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "no occurrence obstructions in geometric complexity theory"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "circuit complexity proof complexity and polynomial identity testing"
    - "geometric complexity theory v efficient algorithms for noether normalization"

Connected through hyperedge HE-5 (induced by source paper "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"):
  with members:
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "the paulsen problem continuous operator scaling and smoothed analysis"
    - "much faster algorithms for matrix scaling"
    - "matrix scaling and balancing via box constrained newton s method and interior point methods"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"
    - "non commutative edmonds problem and matrix semi invariants"

Connected through hyperedge HE-6 (induced by source paper "efficient algorithms for tensor scaling quantum marginals and moment polytopes"):
  with members:
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "membership in moment polytopes is in np and conp"
    - "on vanishing of kronecker coefficients"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "computing multiplicities of lie group representations"

Connected through hyperedge HE-7 (induced by source paper "orbits of monomials and factorization into products of linear forms"):
  with members:
    - "no occurrence obstructions in geometric complexity theory"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"

Question: Please tell me which class the center node 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.CC(Computational Complexity)