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 "generalized rank weights of reducible codes optimal cases and related properties"):
  Abstract: Reducible codes for the rank metric were introduced for cryptographic purposes. They have fast encoding and decoding algorithms, include maximum rank distance (MRD) codes and can correct many rank errors beyond half of their minimum rank distance, which makes them suitable for error-correction in network coding. In this paper, we study their security behaviour against information leakage on networks when applied as coset coding schemes, giving the following main results: 1) we give lower and upper bounds on their generalized rank weights (GRWs), which measure worst-case information leakage to the wire-tapper, 2) we find new parameters for which these codes are MRD (meaning that their first GRW is optimal), and use the previous bounds to estimate their higher GRWs, 3) we show that all linear (over the extension field) codes whose GRWs are all optimal for fixed packet and code sizes but varying length are reducible codes up to rank equivalence, and 4) we show that the information leaked to a wire-tapper when using reducible codes is often much less than the worst case given by their (optimal in some cases) GRWs. We conclude with some secondary related properties: Conditions to be rank equivalent to cartesian products of linear codes, conditions to be rank degenerate, duality properties and MRD ranks.

Includes members:
  Member "on defining generalized rank weights":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rank metric codes")
  Member "unifying notions of generalized weights for universal security on wire tap networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rank metric codes and q polymatroids")
  Member "relative generalized rank weight of linear codes and its applications to network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  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 weights an anticode approach":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rank metric codes")
  Member "generalized rank weights a duality statement":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a geometric approach to rank metric codes and a classification of constant weight codes")
  Member "universal secure network coding via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")

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)