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 with the rank metric"
  Abstract: In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD codes and sphere-packing bound cannot be attained. We also establish bounds on the rank covering radius of maximal codes, and show that all MRD codes are maximal codes and all the MRD codes known so far achieve the maximum rank covering radius.

Connected through hyperedge HE-1 (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 in rank metric"
    - "on deciding deep holes of reed solomon codes"

Connected through hyperedge HE-2 (induced by source paper "constant rank codes and their connection to constant dimension codes"):
  with members:
    - "recursive code construction for random networks"
    - "construction and covering properties of constant dimension codes"
    - "on metrics for error correction in network coding"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"
    - "bounds on covering codes with the rank metric"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (induced by source paper "a rank metric approach to error control in random network coding"):
  with members:
    - "on metrics for error correction in network coding"
    - "coding for errors and erasures in random network coding"
    - "johnson type bounds on constant dimension codes"

Connected through hyperedge HE-4 (induced by source paper "security for wiretap networks via rank metric codes"):
  with members:
    - "on wiretap networks ii"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-5 (induced by source paper "packing and covering properties of rank metric codes"):
  with members:
    - "constant rank codes"
    - "a rank metric approach to error control in random network coding"
    - "constant rank codes and their connection to constant dimension codes"
    - "decoder error probability of mrd codes"
    - "properties of codes in rank metric"

Connected through hyperedge HE-6 (induced by source paper "properties of rank metric codes"):
  with members:
    - "decoder error probability of mrd codes"
    - "properties of codes in rank metric"
    - "properties of subspace subcodes of optimum codes in rank metric"

Connected through hyperedge HE-7 (induced by source paper "macwilliams identity for codes with the rank metric"):
  with members:
    - "decoder error probability of mrd codes"
    - "properties of codes in rank metric"

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)