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: "on the security of a loidreau s rank metric code based encryption scheme"
  Abstract: We present a polynomial time attack of a rank metric code based encryption scheme due to Loidreau for some parameters.

Connected through hyperedge HE-1 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants"):
  with members:
    - "invariants and inequivalence of linear rank metric codes"
    - "random construction of partial mds codes"
    - "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "generalized gabidulin codes over fields of any characteristic"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "further generalisations of twisted gabidulin codes"
    - "space time codes based on rank metric codes and their decoding"

Connected through hyperedge HE-2 (induced by source paper "interleaving loidreau s rank metric cryptosystem"):
  with members:
    - "low rank parity check codes new decoding algorithms and applications to cryptography"
    - "decoding high order interleaved rank metric codes"
    - "on decoding and applications of interleaved goppa codes"
    - "a public key cryptosystem from 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-3 (induced by source paper "invariants and inequivalence of linear rank metric codes"):
  with members:
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"

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)