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: "introduction to redberry a computer algebra system designed for tensor manipulation"
  Abstract: In this paper we introduce Redberry --- an open source computer algebra system with native support of tensorial expressions. It provides basic computer algebra tools (algebraic manipulations, substitutions, basic simplifications etc.) which are aware of specific features of indexed expressions: contractions of indices, permutational symmetries, multiple index types etc. Redberry supports conventional \LaTeX-style input notation for tensorial expressions. The high energy physics package includes tools for Feynman diagrams calculation: Dirac and SU(N) algebra, Levi-Civita simplifications and tools for one-loop calculations in quantum field theory. In the paper we give detailed overview of Redberry features: from basic manipulations with tensors to real Feynman diagrams calculation, accompanied by many examples. Redberry is written in Java 7 and provides convenient Groovy-based user interface inside the high-level general purpose programming language environment. Redberry is available from this http URL

Connected through hyperedge HE-1 (induced by source paper "new features in the second version of the cadabra computer algebra system"):
  with members:
    - "using two types of computer algebra systems to solve maxwell optics problems"
    - "tensor computations in computer algebra systems"
    - "cadabra a field theory motivated symbolic computer algebra system"
    - "form matters fast symbolic computation under unix"
    - "atensor reduce program for tensor simplification"

Connected through hyperedge HE-2 (induced by source paper "faster tensor canonicalization"):
  with members:
    - "riemann tensor polynomial canonicalization by graph algebra extension"
    - "the invar tensor package differential invariants of riemann"
    - "xperm fast index canonicalization for tensor computer algebra"
    - "cadabra a field theory motivated symbolic computer algebra system"

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)