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 "matrix multiplication algorithms from group orbits"):
  Abstract: We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of orbits under some finite group action. We show how to use the representation theory of the corresponding group to derive simple constraints on the decomposition, which we solve by hand for n=2,3,4,5, recovering Strassen's algorithm (in a particularly symmetric form) and new algorithms for larger n. While these new algorithms do not improve the known upper bounds on tensor rank or the matrix multiplication exponent, they are beautiful in their own right, and we point out modifications of this idea that could plausibly lead to further improvements. Our constructions also suggest further patterns that could be mined for new algorithms, including a tantalizing connection with lattices. In particular, using lattices we give the most transparent proof to date of Strassen's algorithm; the same proof works for all n, to yield a decomposition with $n^3 - n + 1$ terms.

Includes members:
  Member "the geometry of rank decompositions of matrix multiplication i 2x2 matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "designing strassen s algorithm")
  Member "a 2n 2 log n 1 lower bound for the border rank of matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on algebraic branching programs of small width")
  Member "on the geometry of border rank algorithms for n x 2 by 2 x 2 matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "designing strassen s algorithm")
  Member "symmetries of matrix multiplication algorithms i":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "designing strassen s algorithm")
  Member "fast matrix multiplication limitations of the laser method":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "barriers for rectangular matrix multiplication")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "on symmetries of the strassen algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strassen s 2x2 matrix multiplication algorithm a conceptual perspective")
  Member "equations for lower bounds on border rank":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of matrix multiplication developments since 2014 extended abstract of 2018 oberwolfach complexity meeting plenary lecture")

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.CC(Computational Complexity)