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: "polynomial evaluation over finite fields new algorithms and complexity bounds"
  Abstract: An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation in the decoding of Reed-Solomon codes are highlighted.

Connected through hyperedge HE-1 (induced by source paper "enhanced public key security for the mceliece cryptosystem"):
  with members:
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"
    - "an efficient cca2 secure variant of the mceliece cryptosystem in the standard model"
    - "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes"
    - "a distinguisher based attack on a variant of mceliece s cryptosystem based on reed solomon codes"
    - "a cca2 secure variant of the mceliece cryptosystem"
    - "error correcting pairs for a public key cryptosystem"

Connected through hyperedge HE-2 (induced by source paper "on the decoding complexity of cyclic codes up to the bch bound"):
  with members:
    - "efficient evaluation of polynomials over finite fields"

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)