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: "novel polynomial basis and its application to reed solomon erasure codes"
  Abstract: In this paper, we present a new basis of polynomial over finite fields of characteristic two and then apply it to the encoding/decoding of Reed-Solomon erasure codes. The proposed polynomial basis allows that $h$-point polynomial evaluation can be computed in $O(h\log_2(h))$ finite field operations with small leading constant. As compared with the canonical polynomial basis, the proposed basis improves the arithmetic complexity of addition, multiplication, and the determination of polynomial degree from $O(h\log_2(h)\log_2\log_2(h))$ to $O(h\log_2(h))$. Based on this basis, we then develop the encoding and erasure decoding algorithms for the $(n=2^r,k)$ Reed-Solomon codes. Thanks to the efficiency of transform based on the polynomial basis, the encoding can be completed in $O(n\log_2(k))$ finite field operations, and the erasure decoding in $O(n\log_2(n))$ finite field operations. To the best of our knowledge, this is the first approach supporting Reed-Solomon erasure codes over characteristic-2 finite fields while achieving a complexity of $O(n\log_2(n))$, in both additive and multiplicative complexities. As the complexity leading factor is small, the algorithms are advantageous in practical applications.

Connected through hyperedge HE-1 (induced by source paper "proof of all verifiable computation in a nutshell"):
  with members:
    - "deep fri sampling outside the box improves soundness"

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"
    - "faster polynomial multiplication over finite fields"
    - "an in place truncated fourier transform and applications to polynomial multiplication"

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"
    - "a cache friendly truncated fft"

Connected through hyperedge HE-4 (induced by source paper "fraud and data availability proofs maximising light client security and scaling blockchains with dishonest majorities"):
  with members:
    - "erasure code based low storage blockchain node"
    - "consensus in the age of blockchains"
    - "chainspace a sharded smart contracts platform"

Connected through hyperedge HE-5 (induced by source paper "frobenius additive fast fourier transform"):
  with members:
    - "faster multiplication for long binary polynomials"
    - "fft algorithm for binary extension finite fields and its application to reed solomon codes"
    - "faster polynomial multiplication over finite fields"

Connected through hyperedge HE-6 (induced by source paper "multiplying boolean polynomials with frobenius partitions in additive fast fourier transform"):
  with members:
    - "faster 64 bit universal hashing using carry less multiplications"

Connected through hyperedge HE-7 (induced by source paper "a complete classification of partial mds maximally recoverable codes with one global parity"):
  with members:
    - "explicit maximally recoverable codes with locality"
    - "partial mds codes and their application to raid type of architectures"

Connected through hyperedge HE-8 (induced by source paper "coding for improved throughput performance in network switches"):
  with members:
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"
    - "when do redundant requests reduce latency"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "coding for fast content download"
    - "the mds queue analysing the latency performance of erasure codes"
    - "a survey on network codes for distributed storage"

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)