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 "rank equivalent and rank degenerate skew cyclic codes"):
  Abstract: Two skew cyclic codes can be equivalent for the Hamming metric only if they have the same length, and only the zero code is degenerate. The situation is completely different for the rank metric, where lengths of codes correspond to the number of outgoing links from the source when applying the code on a network. We study rank equivalences between skew cyclic codes of different lengths and, with the aim of finding the skew cyclic code of smallest length that is rank equivalent to a given one, we define different types of length for a given skew cyclic code, relate them and compute them in most cases. We give different characterizations of rank degenerate skew cyclic codes using conventional polynomials and linearized polynomials. Some known results on the rank weight hierarchy of cyclic codes for some lengths are obtained as particular cases and extended to all lengths and to all skew cyclic codes. Finally, we prove that the smallest length of a linear code that is rank equivalent to a given skew cyclic code can be attained by a pseudo-skew cyclic code. Throughout the paper, we find new relations between linear skew cyclic codes and their Galois closures.

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 "on the roots and minimum rank distance of skew cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "on the similarities between generalized rank and hamming weights and their applications to network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a geometric approach to rank metric codes and a classification of constant weight codes")
  Member "rank weight hierarchy of some classes of cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rank metric codes generalized binomial moments and their zeta functions")
  Member "generalized rank weights a duality statement":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a geometric approach to rank metric codes and a classification of constant weight codes")
  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)