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: "an implementation of sub cad in maple"
  Abstract: AbstractCylindrical algebraic decomposition (CAD) is an important tool for the investiga-tion of semi-algebraic sets, with applications in algebraic geometry and beyond. Wehave previously reported on an implementation of CAD in Maple which oﬀers theoriginal projection and lifting algorithm of Collins along with subsequent improve-ments.Here we report on new functionality: speciﬁcally the ability to build cylindricalalgebraic sub-decompositions (sub-CADs) where only certain cells are returned. Wehave implemented algorithms to return cells of a prescribed dimensions or higher(layered sub-CADs), and an algorithm to return only those cells on which given poly-nomials are zero (variety sub-CADs). These oﬀer substantial savings in output sizeand computation time.The code described and an introductory Maple worksheet / pdf demonstratingthe full functionality of the package should accompany this report. This work is supported by EPSRC grant EP/J003247/1. 1 Introduction This report concerns ProjectionCAD: a Maplepackage for cylindrical algebraic decom-position (CAD) developed at the University of Bath. The extended abstract [18] at ICMS2014 describes how this package utilises recent CAD work in the RegularChainsLibraryof Maple, while still following the classical projection and lifting framework for CADconstruction. The present report is to accompany the release of ProjectionCADversion3, describing the new functionality this introduced. The report should be accompaniedby the code described and an introductory Maple worksheet / pdf demonstrating thefull functionality of the package. The previous two versions of ProjectionCADare hostedalongside similar reports documenting their functionality [16, 17].Version 3 introduces functionality for cylindrical algebraic sub-decompositions(sub-CADs): subsets of CADs suﬃcient to describe the solutions of a given formulae.Two distinct types are provided, whose theory was developed in [27]. The ﬁrst typecontains only those cells of a certain dimension and higher, reducing both the outputsize and computational time by giving only output of the required generality. We haveimplemented both a direct and recursive algorithm to build these layeredsub-CADs. Thesecond type contains only those cells on which given equations are satisﬁed (lie on aprescribed variety). When building a CAD for a formula with an equational constraintthen only these cells can contain the solution set. These varietysub-CADs clearly reducethe output, and can also reduce computation time depending on the rank of the varietyrelative to the variable ordering.1

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)