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: "on the similarities between generalized rank and hamming weights and their applications to network coding"
  Abstract: Rank weights and generalized rank weights have been proven to characterize error and erasure correction, and information leakage in linear network coding, in the same way as Hamming weights and generalized Hamming weights describe classical error and erasure correction, and information leakage in wire-tap channels of type II and code-based secret sharing. Although many similarities between both cases have been established and proven in the literature, many other known results in the Hamming case, such as bounds or characterizations of weight-preserving maps, have not been translated to the rank case yet, or in some cases have been proven after developing a different machinery. The aim of this paper is to further relate both weights and generalized weights, show that the results and proofs in both cases are usually essentially the same, and see the significance of these similarities in network coding. Some of the new results in the rank case also have new consequences in the Hamming case.

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"
    - "generalized weights an anticode approach"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "generalized rank weights a duality statement"

Connected through hyperedge HE-2 (induced by source paper "theory of supports for linear codes endowed with the sum rank metric"):
  with members:
    - "private information retrieval from locally repairable databases with colluding servers"
    - "on defining generalized rank weights"
    - "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"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "private information retrieval from coded databases with colluding servers"
    - "rank error correcting pairs"
    - "relative generalized rank weight of linear codes and its applications to 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"
    - "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-4 (induced by source paper "universal secure rank metric coding schemes with optimal communication overheads"):
  with members:
    - "rank metric codes with local recoverability"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "communication efficient secret sharing"
    - "repairing reed solomon codes"
    - "staircase codes for secret sharing with optimal communication and read overheads"
    - "a family of optimal locally recoverable codes"
    - "on the locality of codeword symbols"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-5 (induced by source paper "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"):
  with members:
    - "generalized gabidulin codes over fields of any characteristic"
    - "matroidal structure of skew polynomial rings with application to network coding"
    - "convolutional codes in rank metric with application to random network coding"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "generalization of gabidulin codes over fields of rational functions"
    - "universal secure network coding via rank metric codes"
    - "on partial unit memory codes based on gabidulin codes"
    - "multishot codes for network coding using rank metric codes"

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

Connected through hyperedge HE-7 (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"
    - "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"
    - "generalized rank weights a duality statement"

Connected through hyperedge HE-8 (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"
    - "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"
    - "generalized rank weights a duality statement"
    - "universal secure network coding via rank metric 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)