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: "computing spectral sequences"
  Abstract: In this paper, a set of programs enhancing the Kenzo system is presented. Kenzo is a Common Lisp program designed for computing in Algebraic Topology, in particular it allows the user to calculate homology and homotopy groups of complicated spaces. The new programs presented here entirely compute Serre and Eilenberg-Moore spectral sequences, in particular the groups and differential maps for arbitrary r. They also determine when the spectral sequence has converged and describe the filtration of the target homology groups induced by the spectral sequence.

Connected through hyperedge HE-1 (induced by source paper "computing simplicial representatives of homotopy group elements"):
  with members:
    - "computing higher homotopy groups is w 1 hard"
    - "computing all maps into a sphere"

Connected through hyperedge HE-2 (induced by source paper "extendability of continuous maps is undecidable"):
  with members:
    - "polynomial time homology for simplicial eilenberg maclane spaces"
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"
    - "computing all maps into a sphere"

Connected through hyperedge HE-3 (induced by source paper "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"):
  with members:
    - "extendability of continuous maps is undecidable"
    - "computing higher homotopy groups is w 1 hard"
    - "polynomial time homology for simplicial eilenberg maclane spaces"
    - "computing all maps into a sphere"
    - "complexity and algorithms for euler characteristic of simplicial complexes"

Connected through hyperedge HE-4 (induced by source paper "polynomial time homology for simplicial eilenberg maclane spaces"):
  with members:
    - "extendability of continuous maps is undecidable"
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"
    - "computing all maps into a sphere"

Connected through hyperedge HE-5 (induced by source paper "computing all maps into a sphere"):
  with members:
    - "robust satisfiability of systems of equations"
    - "computing higher homotopy groups is w 1 hard"
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"

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)