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: "cyclotomic ffts with reduced additive complexities based on a novel common subexpression elimination algorithm"
  Abstract: In this paper, we first propose a novel common subexpression elimination (CSE) algorithm for matrix-vector multiplications over characteristic-2 fields. As opposed to previously proposed CSE algorithms, which usually focus on complexity savings due to recurrences of subexpressions, our CSE algorithm achieves two types of complexity reductions, differential savings and recurrence savings, by taking advantage of the cancelation property of characteristic-2 fields. Using our CSE algorithm, we reduce the additive complexities of cyclotomic fast Fourier transforms (CFFTs). Using a weighted sum of the numbers of multiplications and additions as a metric, our CFFTs achieve smaller total complexities than previously proposed CFFTs and other FFTs, requiring both fewer multiplications and fewer additions in many cases.

Connected through hyperedge HE-1 (induced by source paper "normalized cyclic convolution the case of even length"):
  with members:
    - "composite cyclotomic fourier transforms with reduced complexities"

Connected through hyperedge HE-2 (induced by source paper "novel polynomial basis and its application to reed solomon erasure codes"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "composite cyclotomic fourier transforms with reduced complexities"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "fnt based reed solomon erasure codes"
    - "efficient erasure decoding of reed solomon codes"

Connected through hyperedge HE-3 (induced by source paper "rank metric decoder architectures for random linear network coding with error control"):
  with members:
    - "fast encoding and decoding of gabidulin codes"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-4 (induced by source paper "reduced complexity decoders of long reed solomon codes based on composite cyclotomic fourier transforms"):
  with members:
    - "composite cyclotomic fourier transforms with reduced complexities"
    - "reduced complexity reed solomon decoders based on cyclotomic ffts"

Connected through hyperedge HE-5 (induced by source paper "computational complexity of cyclotomic fast fourier transforms over characteristic 2 fields"):
  with members:
    - "reduced complexity reed solomon decoders based on cyclotomic ffts"

Connected through hyperedge HE-6 (induced by source paper "prime factor cyclotomic fourier transforms with reduced complexity over finite fields"):
  with members:
    - "cyclotomic fft of length 2047 based on a novel 11 point cyclic convolution"

Connected through hyperedge HE-7 (induced by source paper "reduced complexity reed solomon decoders based on cyclotomic ffts"):
  with members:
    - "finding roots of polynomials over finite fields"

Connected through hyperedge HE-8 (induced by source paper "complexity analysis of reed solomon decoding over gf 2 m without using syndromes"):
  with members:
    - "a simple algorithm for decoding reed solomon codes and its relation to the welch berlekamp algorithm"

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)