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 introspective algorithm for the integer determinant"
  Abstract: We present an algorithm computing the determinant of an integer matrix $A$. The algorithm is introspective in the sense that it uses several distinct algorithms than run in a concurrent manner. During the course of the algorithm partial results coming from distinct methods can be combined. Then, depending on the current running time of each method, the algorithm can emphasize a particular variant. With the use of very fast modular routines for linear algebra, our implementation is an order of magnitude faster than other existing implementations. Moreover, we prove that the expected complexity of our algorithm is only $O\left(n^3 (\log(n)+\log(||A||))^2 \log(n)\right) $ bit operations, where $||A||$ is the largest entry in absolute value of the matrix.

Connected through hyperedge HE-1 (induced by source paper "faster geometric algorithms via dynamic determinant computation"):
  with members:
    - "powers of tensors and fast matrix multiplication"
    - "a new approach to output sensitive voronoi diagrams and delaunay triangulations"
    - "an oracle based output sensitive algorithm for projections of resultant polytopes"
    - "an output sensitive algorithm for computing projections of resultant polytopes"

Connected through hyperedge HE-2 (induced by source paper "on finding multiplicities of characteristic polynomial factors of black box matrices"):
  with members:
    - "faster inversion and other black box matrix computations using efficient block projections"
    - "bounds on the coefficients of the characteristic and minimal polynomials"
    - "efficient computation of the characteristic polynomial"

Connected through hyperedge HE-3 (induced by source paper "towards an exact adaptive algorithm for the determinant of a rational matrix"):
  with members:
    - "solving sparse integer linear systems"

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)