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: "a public key cryptosystem from interleaved goppa codes"
  Abstract: In this paper, a code-based public-key cryptosystem based on interleaved Goppa codes is presented. The scheme is based on encrypting several ciphertexts with the same Goppa code and adding a burst error to them. Possible attacks are outlined and the key size of several choices of parameters is compared to those of known schemes for the same security level. For example, for security level 128 bits, we obtain a key size of 696 Kbits whereas the classical McEliece scheme based on Goppa codes using list decoding requires a key size of 1935 Kbits.

Connected through hyperedge HE-1 (induced by source paper "on error decoding of locally repairable and partial mds codes"):
  with members:
    - "on decoding and applications of interleaved goppa codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "improved power decoding of interleaved one point hermitian codes"
    - "list decoding of locally repairable codes"
    - "fractional decoding error correction from partial information"
    - "a complete classification of partial mds maximally recoverable codes with one global parity"
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "maximally recoverable codes for grid like topologies"

Connected through hyperedge HE-2 (induced by source paper "decoding high order interleaved rank metric codes"):
  with members:
    - "on error decoding of locally repairable and partial mds codes"
    - "on decoding and applications of interleaved goppa codes"
    - "improved power decoding of interleaved one point hermitian codes"
    - "on a rank metric code based cryptosystem with small key size"
    - "repairing the faure loidreau public key cryptosystem"
    - "fast multiplication for skew polynomials"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "decoding of interleaved reed solomon codes using improved power decoding"

Connected through hyperedge HE-3 (induced by source paper "interleaving loidreau s rank metric cryptosystem"):
  with members:
    - "low rank parity check codes new decoding algorithms and applications to cryptography"
    - "on the security of a loidreau s rank metric code based encryption scheme"
    - "decoding high order interleaved rank metric codes"
    - "on decoding and applications of interleaved goppa codes"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "repairing the faure loidreau public key cryptosystem"
    - "further generalisations of twisted gabidulin codes"
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"

Connected through hyperedge HE-4 (induced by source paper "on decoding and applications of interleaved goppa codes"):
  with members:
    - "generalization of the ball collision algorithm"
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "on rational interpolation based list decoding and list decoding binary goppa codes"
    - "list decoding of binary goppa codes up to the binary johnson bound"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

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)