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: "form version 4 0"
  Abstract: Abstract   We present version 4.0 of the symbolic manipulation system  Form . The most important new features are manipulation of rational polynomials and the factorization of expressions. Many other new functions and commands are also added; some of them are very general, while others are designed for building specific high level packages, such as one for Grobner bases. New is also the checkpoint facility, that allows for periodic backups during long calculations. Finally,  Form  4.0 has become available as open source under the GNU General Public License version 3.    Program summary  Program title: FORM.  Catalogue identifier: AEOT_v1_0  Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEOT_v1_0.html   Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland  Licensing provisions: GNU General Public License, version 3  No. of lines in distributed program, including test data, etc.: 151599  No. of bytes in distributed program, including test data, etc.: 1 078 748  Distribution format: tar.gz  Programming language: The FORM language. FORM itself is programmed in a mixture of C and C++.  Computer: All.  Operating system: UNIX, LINUX, Mac OS, Windows.  Classification: 5.  Nature of problem:  FORM defines a symbolic manipulation language in which the emphasis lies on fast processing of very large formulas. It has been used successfully for many calculations in Quantum Field Theory and mathematics. In speed and size of formulas that can be handled it outperforms other systems typically by an order of magnitude.  Special in this version:  The version 4.0 contains many new features. Most important are factorization and rational arithmetic. The program has also become open source under the GPL. The code in CPC is for reference. You are encouraged to upload the most recent sources from  www.nikhef.nl/form/formcvs.php  because of frequent bug fixes.  Solution method:  See “Nature of Problem”, above.  Additional comments:  NOTE: The code in CPC is for reference. You are encouraged to upload the most recent sources from  www.nikhef.nl/form/formcvs.php  because of frequent bug fixes.

Connected through hyperedge HE-1 (induced by source paper "rings an efficient java scala library for polynomial rings"):
  with members:
    - "a survey on homomorphic encryption schemes theory and implementation"

Connected through hyperedge HE-2 (induced by source paper "hepgame and the simplification of expressions"):
  with members:
    - "improving multivariate horner schemes with monte carlo tree search"

Connected through hyperedge HE-3 (induced by source paper "code optimization in form"):
  with members:
    - "improving multivariate horner schemes with monte carlo tree search"

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)