human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "fast hermite interpolation and evaluation over finite fields of characteristic two"):
  Abstract: This paper presents new fast algorithms for Hermite interpolation and evaluation over finite fields of characteristic two. The algorithms reduce the Hermite problems to instances of the standard multipoint interpolation and evaluation problems, which are then solved by existing fast algorithms. The reductions are simple to implement and free of multiplications, allowing low overall multiplicative complexities to be obtained. The algorithms are suitable for use in encoding and decoding algorithms for multiplicity codes.

Includes members:
  Member "fast transforms over finite fields of characteristic two":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast systematic encoding of multiplicity codes")
  Member "faster integer and polynomial multiplication using cyclotomic coefficient rings":
    also connected through other hyperedges:
      (none)
  Member "fast systematic encoding of multiplicity codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast transforms over finite fields of characteristic two")
  Member "faster multiplication for long binary polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast transforms over finite fields of characteristic two")
  Member "some remarks on multiplicity codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes")
  Member "a storage efficient and robust private information retrieval scheme allowing few servers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "weighted lifted codes local correctabilities and application to robust private information retrieval")
  Member "novel polynomial basis and its application to reed solomon erasure codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proof of all verifiable computation in a nutshell")
  Member "faster polynomial multiplication over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generic reductions for in place polynomial multiplication")

Question: Please tell me which class the source paper 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)