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: "maximal ferrers diagram codes constructions and genericity considerations"
  Abstract: This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension of a rank-metric code with given specified Ferrers diagram shape and rank distance. While the conjecture in its generality is wide open, several cases have been established in the literature. This paper contributes further cases of Ferrers diagrams and ranks for which the conjecture holds true. In addition, probabilities for maximal Ferrers diagram codes and MRD codes are investigated. It is shown that for growing field size the limiting probability for the event that randomly chosen matrices with given shape generate a maximal Ferrers diagram code, depends highly on the Ferrers diagram. For instance, for [m x 2]-MRD codes with rank 2 this limiting probability is close to 1/e.

Connected through hyperedge HE-1 (induced by source paper "on some automorphisms of rational functions and their applications in rank metric codes"):
  with members:
    - "low rank parity check codes new decoding algorithms and applications to cryptography"
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "a singleton bound for generalized ferrers diagram rank metric codes"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "subspace codes from ferrers diagrams"

Connected through hyperedge HE-2 (induced by source paper "on the sparseness of certain mrd codes"):
  with members:
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-3 (induced by source paper "partitions of matrix spaces with an application to q rook polynomials"):
  with members:
    - "a polymatroid approach to generalized weights of rank metric codes"
    - "rank metric codes and q polymatroids"
    - "codes endowed with the rank metric"
    - "adversarial network coding"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "algebraic structures of mrd codes"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"

Connected through hyperedge HE-4 (induced by source paper "partition balanced families of codes and asymptotic enumeration in coding theory"):
  with members:
    - "codes endowed with the rank metric"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "repairing the faure loidreau public key cryptosystem"
    - "automorphism groups of gabidulin like codes"
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "algebraic structures of mrd codes"
    - "rank distribution of delsarte codes"
    - "rank metric codes and their duality theory"

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)