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: "codes and designs related to lifted mrd codes"
  Abstract: The lifted maximum rank distance codes are considered. It is shown that these codes form structures which are transversal designs and also have some similarity to q-analog of transversal designs. Upper bounds on the sizes of codes which contain the lifted maximum rank distance codes are derived. A new construction for codes which attain one of these upper bounds is given. Low density parity check codes are derived from the lifted maximum rank distance codes and some of these codes are quasi-cyclic codes attaining the Griesmer bound.

Connected through hyperedge HE-1 (induced by source paper "optimal binary locally repairable codes via anticodes"):
  with members:
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "explicit maximally recoverable codes with locality"
    - "optimal locally repairable codes via rank metric codes"

Connected through hyperedge HE-2 (induced by source paper "list decoding of lifted gabidulin codes via the plucker embedding"):
  with members:
    - "cyclic orbit codes"
    - "bounds on list decoding gabidulin codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "plucker embedding of cyclic orbit codes"
    - "new improvements on the echelon ferrers construction"
    - "recursive code construction for random networks"

Connected through hyperedge HE-3 (induced by source paper "new lower bounds for constant dimension codes"):
  with members:
    - "a lower bound for constant dimension codes from multi component lifted mrd codes"
    - "new improvements on the echelon ferrers construction"
    - "recursive code construction for random networks"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "spread codes and spread decoding in network coding"
    - "a rank metric approach to error control in random network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"
    - "constant rank codes and their connection to constant dimension codes"

Connected through hyperedge HE-4 (induced by source paper "a singleton bound for lattice schemes"):
  with members:
    - "linearity and complements in projective space"
    - "network coding with modular lattices"
    - "projective space codes for the injection metric"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random 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.IT(Information Theory)