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: "a cache friendly truncated fft"
  Abstract: We describe a cache-friendly version of van der Hoeven's truncated FFT and inverse truncated FFT, focusing on the case of `large' coefficients, such as those arising in the Schonhage--Strassen algorithm for multiplication in Z[x]. We describe two implementations and examine their performance.

Connected through hyperedge HE-1 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants"):
  with members:
    - "computing popov and hermite forms of rectangular polynomial matrices"
    - "fast computation of approximant bases in canonical form"
    - "block krylov techniques in the context of sparse fglm algorithms"
    - "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor"
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix"
    - "sub quadratic decoding of one point hermitian codes"
    - "computing minimal interpolation bases"

Connected through hyperedge HE-2 (induced by source paper "fast hermite interpolation and evaluation over finite fields of characteristic two"):
  with members:
    - "fast transforms over finite fields of characteristic two"
    - "faster integer and polynomial multiplication using cyclotomic coefficient rings"
    - "fast systematic encoding of multiplicity codes"
    - "faster multiplication for long binary polynomials"
    - "some remarks on multiplicity codes"
    - "a storage efficient and robust private information retrieval scheme allowing few servers"
    - "novel polynomial basis and its application to reed solomon erasure codes"
    - "faster polynomial multiplication over finite fields"

Connected through hyperedge HE-3 (induced by source paper "fast transforms over finite fields of characteristic two"):
  with members:
    - "fast hermite interpolation and evaluation over finite fields of characteristic two"
    - "multiplying boolean polynomials with frobenius partitions in additive fast fourier transform"
    - "frobenius additive fast fourier transform"
    - "fast systematic encoding of multiplicity codes"
    - "faster multiplication for long binary polynomials"
    - "novel polynomial basis and its application to reed solomon erasure codes"

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)