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: "random construction of partial mds codes"
  Abstract: This work deals with partial MDS (PMDS) codes, a special class of locally repairable codes, used for distributed storage system. We first show that a known construction of these codes, using Gabidulin codes, can be extended to use any maximum rank distance code. Then we define a standard form for the generator matrices of PMDS codes and use this form to give an algebraic description of PMDS generator matrices. This implies that over a sufficiently large finite field a randomly chosen generator matrix in PMDS standard form generates a PMDS code with high probability. This also provides sufficient conditions on the field size for the existence of PMDS codes.

Connected through hyperedge HE-1 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric"):
  with members:
    - "skew polynomial rings and skew cyclic codes"
    - "generalized gabidulin codes over fields of any characteristic"
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "on the roots and minimum rank distance of skew cyclic codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "generalization of gabidulin codes over fields of rational functions"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-2 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants"):
  with members:
    - "on the security of a loidreau s rank metric code based encryption scheme"
    - "invariants and inequivalence of linear rank metric 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-3 (induced by source paper "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"):
  with members:
    - "maximally recoverable codes with hierarchical locality"
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "extended integrated interleaved codes over any field with applications to locally recoverable codes"
    - "how long can optimal locally repairable codes be"
    - "constructions of maximally recoverable local reconstruction codes via function fields"
    - "locally repairable codes with unequal local erasure correction"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"

Connected through hyperedge HE-4 (induced by source paper "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"):
  with members:
    - "systematic maximum sum rank codes"
    - "equivalence and characterizations of linear rank metric codes based on invariants"
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "generalized gabidulin codes over fields of any characteristic"
    - "fuzzy authentication using rank distance"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "further generalisations of twisted 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)