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 "equivalence and characterizations of linear rank metric codes based on invariants"):
  Abstract: We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, and the sequence of dimensions of the intersections of itself under several applications of a field automorphism, are invariants for the whole equivalence class of the code. These invariants give rise to easily computable criteria to check if two codes are inequivalent. We derive some concrete values and bounds for these dimension sequences for some known families of rank-metric codes, namely Gabidulin and (generalized) twisted Gabidulin codes. We then derive conditions on the length of the codes with respect to the field extension degree, such that codes from different families cannot be equivalent. Furthermore, we give an exact number of equivalence classes Gabidulin codes and derive bounds on the number of equivalence classes for twisted Gabidulin codes. In the end we use the mentioned sequences to characterize Gabidulin codes in various ways.

Includes members:
  Member "on the security of a loidreau s rank metric code based encryption scheme":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interleaving loidreau s rank metric cryptosystem")
  Member "invariants and inequivalence of linear rank metric codes":
    also connected through other hyperedges:
      (none)
  Member "random construction of partial mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures")
  Member "on the genericity of maximum rank distance and gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on some automorphisms of rational functions and their applications in rank metric codes")
  Member "generalized gabidulin codes over fields of any characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "further generalisations of twisted gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interleaving loidreau s rank metric cryptosystem")

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)