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: "generalized rank weights a duality statement"
  Abstract: We consider linear codes over some fixed finite field extension over an arbitrary finite field. Gabidulin introduced rank metric codes, by endowing linear codes over the extension field with a rank weight over the base field and studied their basic properties in analogy with linear codes and the classical Hamming distance. Inspired by the characterization of wiretap II codes in terms of generalized Hamming weights by Wei, Kurihara et al. defined some generalized rank weights and showed their relevance for secure network coding. In this paper, we derive a statement for generalized rank weights of the dual code, completely analogous to Wei's one for generalized Hamming weights and we characterize the equality case of the r-generalized Singleton bound for the generalized rank weights, in terms of the rank weight of the dual code.

Connected through hyperedge HE-1 (induced by source paper "a geometric approach to rank metric codes and a classification of constant weight codes"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"

Connected through hyperedge HE-2 (induced by source paper "rank weights for arbitrary finite field extensions"):
  with members:
    - "on defining generalized rank weights"

Connected through hyperedge HE-3 (induced by source paper "on defining generalized rank weights"):
  with members:
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "generalization of gabidulin codes over fields of rational functions"
    - "new parameters of linear codes expressing security performance of universal secure network coding"

Connected through hyperedge HE-4 (induced by source paper "relative generalized matrix weights of matrix codes for universal security on wire tap networks"):
  with members:
    - "on defining generalized rank weights"
    - "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"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"

Connected through hyperedge HE-5 (induced by source paper "on dually almost mrd codes"):
  with members:
    - "algebraic structures of mrd codes"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on self dual mrd codes"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-6 (induced by source paper "unifying notions of generalized weights for universal security on wire tap networks"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-7 (induced by source paper "generalized rank weights of reducible codes optimal cases and related properties"):
  with members:
    - "on defining generalized rank weights"
    - "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"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "generalized weights an anticode approach"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-8 (induced by source paper "rank equivalent and rank degenerate skew cyclic codes"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on the roots and minimum rank distance of skew cyclic codes"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "on metrics for error correction in 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)