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: "laderman matrix multiplication algorithm can be constructed using strassen algorithm and related tensor s isotropies"
  Abstract: In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm.  The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This note presents a geometric relationship between Strassen and Laderman algorithms.  By doing so, we retrieve a geometric formulation of results very similar to those presented by O. Sykora in 1977.

Connected through hyperedge HE-1 (induced by source paper "new ways to multiply 3 x 3 matrices"):
  with members:
    - "local search for fast matrix multiplication"
    - "fast feasible and unfeasible matrix multiplication"
    - "a non commutative algorithm for multiplying 5 5 matrices using 99 multiplications"
    - "schur number five"
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "powers of tensors and fast matrix multiplication"
    - "a new general purpose method to multiply 3x3 matrices using only 23 multiplications"

Connected through hyperedge HE-2 (induced by source paper "a non commutative algorithm for multiplying 5 5 matrices using 99 multiplications"):
  with members:
    - "fast matrix multiplication and symbolic computation"
    - "a framework for practical parallel fast matrix multiplication"

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.SC(Symbolic Computation)