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: "properties of codes in rank metric"
  Abstract: We study properties of rank metric and codes in rank metric over finite fields. We show that in rank metric perfect codes do not exist. We derive an existence bound that is the equivalent of the Gilbert--Varshamov bound in Hamming metric. We study the asymptotic behavior of the minimum rank distance of codes satisfying GV. We derive the probability distribution of minimum rank distance for random and random $\F{q}$-linear codes. We give an asymptotic equivalent of their average minimum rank distance and show that random $\F{q}$-linear codes are on GV bound for rank metric. #R##N#We show that the covering density of optimum codes whose codewords can be seen as square matrices is lower bounded by a function depending only on the error-correcting capability of the codes. We show that there are quasi-perfect codes in rank metric over fields of characteristic 2.

Connected through hyperedge HE-1 (induced by source paper "hamming and simplex codes for the sum rank metric"):
  with members:
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "partial spreads in random network coding"
    - "on the locality of codeword symbols"
    - "multishot codes for network coding using rank metric codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (induced by source paper "improved veron identification and signature schemes in the rank metric"):
  with members:
    - "wave a new code based signature scheme"
    - "ranksign an efficient signature algorithm based on the rank metric"
    - "efficient encryption from random quasi cyclic codes"
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"
    - "a new algorithm for solving ring lpn with a reducible polynomial"
    - "on the complexity of the rank syndrome decoding problem"
    - "a new zero knowledge code based identification scheme with reduced communication"

Connected through hyperedge HE-3 (induced by source paper "low rank parity check codes new decoding algorithms and applications to cryptography"):
  with members:
    - "ranksynd a prng based on rank metric"
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "cryptanalysis of two mceliece cryptosystems based on quasi cyclic codes"

Connected through hyperedge HE-4 (induced by source paper "multiple rate channel codes in texttt gf p n 2"):
  with members:
    - "syndrome coupled rate compatible error correcting codes"
    - "a new ensemble of rate compatible ldpc codes"
    - "packing and covering properties of rank metric codes"

Connected through hyperedge HE-5 (induced by source paper "on deep holes of gabidulin codes"):
  with members:
    - "explicit deep holes of reed solomon codes"
    - "on deep holes of projective reed solomon codes"
    - "gabidulin decoding via minimal bases of linearized polynomial modules"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric codes"
    - "properties of codes with the rank metric"
    - "on deciding deep holes of reed solomon codes"

Connected through hyperedge HE-6 (induced by source paper "ranksign an efficient signature algorithm based on the rank metric"):
  with members:
    - "on the hardness of the decoding and the minimum distance problems for rank codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "communication over finite field matrix channels"

Connected through hyperedge HE-7 (induced by source paper "relative generalized rank weight of linear codes and its applications to network coding"):
  with members:
    - "generalized rank weights a duality statement"
    - "new parameters of linear codes expressing security performance of universal secure network coding"
    - "universal secure network coding via rank metric codes"
    - "secure multiplex network coding"
    - "vulnerability of mrd code based universal secure network coding against stronger eavesdroppers"
    - "secure network coding for wiretap networks of type ii"
    - "on metrics for error correction in network coding"
    - "mds codes on the erasure erasure wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "on the similarities between generalized rank and hamming weights and their applications to network coding"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "generalized rank weights a duality statement"
    - "generalized rank weights duality and griesmer bound"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"

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.DM(Discrete Mathematics)