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: "fast systematic encoding of multiplicity codes"
  Abstract: We present quasi-linear time systematic encoding algorithms for multiplicity codes. The algorithms have their origins in the fast multivariate interpolation and evaluation algorithms of van der Hoeven and Schost (2013), which we generalise to address certain Hermite-type interpolation and evaluation problems. By providing fast encoding algorithms for multiplicity codes, we remove an obstruction on the road to the practical application of the private information retrieval protocol of Augot, Levy-dit-Vehel and Shikfa (2014).

Connected through hyperedge HE-1 (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"
    - "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"
    - "an in place truncated fourier transform and applications to polynomial multiplication"

Connected through hyperedge HE-2 (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"
    - "faster multiplication for long binary polynomials"
    - "novel polynomial basis and its application to reed solomon erasure codes"
    - "a cache friendly truncated fft"

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.IT(Information Theory)