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: "rank metric codes and their duality theory"
  Abstract: We compare the two duality theories of rank-metric codes proposed by Delsarte and Gabidulin, proving that the former generalizes the latter. We also give an elementary proof of MacWilliams identities for the general case of Delsarte rank-metric codes. The identities which we derive are very easy to handle, and allow us to re-establish in a very concise way the main results of the theory of rank-metric codes first proved by Delsarte employing the theory of association schemes and regular semilattices. We also show that our identities imply as a corollary the original MacWilliams identities established by Delsarte. We describe how the minimum and maximum rank of a rank-metric code relate to the minimum and maximum rank of the dual code, giving some bounds and characterizing the codes attaining them. Then we study optimal anticodes in the rank metric, describing them in terms of optimal codes (namely, MRD codes). In particular, we prove that the dual of an optimal anticode is an optimal anticode. Finally, as an application of our results to a classical problem in enumerative combinatorics, we derive both a recursive and an explicit formula for the number of $k \times m$ matrices over a finite field with given rank and $h$-trace.

Connected through hyperedge HE-1 (induced by source paper "degenerate flag varieties in network coding"):
  with members:
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (induced by source paper "rank metric codes"):
  with members:
    - "rank metric codes and q polymatroids"
    - "codes endowed with the rank metric"
    - "on defining generalized rank weights"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "generalized weights an anticode approach"

Connected through hyperedge HE-3 (induced by source paper "a polymatroid approach to generalized weights of rank metric codes"):
  with members:
    - "rank metric codes"
    - "rank metric codes and q polymatroids"
    - "on defining generalized rank weights"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "generalized weights an anticode approach"

Connected through hyperedge HE-4 (induced by source paper "mathbb f _ q n linear rank distance codes and their distinguishers"):
  with members:
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "automorphism groups of gabidulin like codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"

Connected through hyperedge HE-5 (induced by source paper "rank metric codes generalized binomial moments and their zeta functions"):
  with members:
    - "rank metric codes"
    - "on dually almost mrd codes"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "generalized weights an anticode approach"

Connected through hyperedge HE-6 (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"
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "partition balanced families of codes and asymptotic enumeration in coding theory"):
  with members:
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "rank metric codes and q polymatroids"):
  with members:
    - "codes endowed with the rank metric"
    - "on defining generalized rank weights"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "unifying notions of generalized weights for universal security on wire tap networks"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "generalized weights an anticode approach"
    - "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)