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: "reduced complexity reed solomon decoders based on cyclotomic ffts"
  Abstract: In this paper, we reduce the computational complexities of partial and dual partial cyclotomic FFTs (CFFTs), which are discrete Fourier transforms where spectral and temporal components are constrained, based on their properties as well as a common subexpression elimination algorithm. Our partial CFFTs achieve smaller computational complexities than previously proposed partial CFFTs. Utilizing our CFFTs in both transform- and time-domain Reed-Solomon decoders, we achieve significant complexity reductions.

Connected through hyperedge HE-1 (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"
    - "cyclotomic ffts with reduced additive complexities based on a novel common subexpression elimination algorithm"

Connected through hyperedge HE-2 (induced by source paper "computational complexity of cyclotomic fast fourier transforms over characteristic 2 fields"):
  with members:
    - "cyclotomic ffts with reduced additive complexities based on a novel common subexpression elimination algorithm"

Connected through hyperedge HE-3 (induced by source paper "cyclotomic fft of length 2047 based on a novel 11 point cyclic convolution"):
  with members:
    - "cyclotomic ffts with reduced additive complexities based on a novel common subexpression elimination 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)