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: "cadabra a field theory motivated symbolic computer algebra system"
  Abstract: Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be used to represent and manipulate field-theory expressions, this often leads to cumbersome input formats, unexpected side-effects, or the need for a lot of special-purpose code. This makes a direct translation of problems from paper to computer and back needlessly time-consuming and error-prone. A prototype computer algebra system is presented which features TEX-like input, graph data structures, lists with Young-tableaux symmetries and a multiple-inheritance property system. The usefulness of this approach is illustrated with a number of explicit field-theory problems. 1. Field theory versus general-purpose computer algebra

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"
    - "introduction to redberry a computer algebra system designed for tensor manipulation"
    - "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"
    - "introduction to redberry a computer algebra system designed for tensor manipulation"
    - "the invar tensor package differential invariants of riemann"
    - "xperm fast index canonicalization for tensor computer algebra"

Connected through hyperedge HE-3 (induced by source paper "using two types of computer algebra systems to solve maxwell optics problems"):
  with members:
    - "tensor computations in computer algebra systems"
    - "extension of the functionality of the symbolic program form by external software"
    - "form matters fast symbolic computation under unix"

Connected through hyperedge HE-4 (induced by source paper "introduction to redberry a computer algebra system designed for tensor manipulation"):
  with members:
    - "tensor computations in computer algebra systems"
    - "practical graph isomorphism ii"
    - "xperm fast index canonicalization for tensor computer algebra"
    - "introduction to the ginac framework for symbolic computation within the c programming language"

Connected through hyperedge HE-5 (induced by source paper "xperm fast index canonicalization for tensor computer algebra"):
  with members:
    - "the invar tensor package"

Connected through hyperedge HE-6 (induced by source paper "the invar tensor package"):
  with members:
    - "atensor reduce program for tensor simplification"

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)