human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "on defining generalized rank weights":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rank metric codes")
  Member "relative generalized rank weight of linear codes and its applications to network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "rank weight hierarchy of some classes of cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rank metric codes generalized binomial moments and their zeta functions")
  Member "relative generalized hamming weights of one point algebraic geometric codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on asymptotically good ramp secret sharing schemes")
  Member "generalized rank weights a duality statement":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a geometric approach to rank metric codes and a classification of constant weight codes")
  Member "generalized rank weights duality and griesmer bound":
    also connected through other hyperedges:
      (none)
  Member "universal secure network coding via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "on metrics for error correction in network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "point line incidence on grassmannians and majority logic decoding of grassmann codes")

Question: Please tell me which class the source paper 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)