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 "faster tensor canonicalization"):
  Abstract: Abstract   The Butler–Portugal algorithm for obtaining the canonical form of a tensor expression, by permuting its    n    index labels with respect to slot symmetries and dummy-index renaming, suffers, in certain cases with a high degree of symmetry, from    O   (  n  !  )     explosion in both computation time and memory. We present a modified algorithm which alleviates this problem in the most common cases – tensor expressions with subsets of indices which are totally symmetric or totally antisymmetric – in polynomial time. We also present an implementation of the label-renaming mechanism which improves upon that of the original Butler–Portugal algorithm, thus providing a significant speed increase for the average case as well as the highly-symmetric special case. The worst-case behavior remains    O   (  n  !  )    , although it occurs in more limited situations less likely to appear in actual computations. We comment on possible strategies to take if the nature of a computation should make these situations more likely.

Includes members:
  Member "riemann tensor polynomial canonicalization by graph algebra extension":
    also connected through other hyperedges:
      (none)
  Member "introduction to redberry a computer algebra system designed for tensor manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new features in the second version of the cadabra computer algebra system")
  Member "the invar tensor package differential invariants of riemann":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "xtras a field theory inspired xact package for mathematica")
  Member "xperm fast index canonicalization for tensor computer algebra":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "riemann tensor polynomial canonicalization by graph algebra extension")
  Member "cadabra a field theory motivated symbolic computer algebra system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new features in the second version of the cadabra computer algebra system")

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