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 "relative generalized rank weight of linear codes and its applications to network coding"):
  Abstract: By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code    $ \mathcal {C}_{1}$    of length    $n$    over a field extension    $ \mathbb {F}_{q^{m}}$    and its subcode    $ \mathcal {C}_{2} \subsetneqq \mathcal {C} _{1}$   . One is called the relative dimension/intersection profile (RDIP), and the other is called the relative generalized rank weight (RGRW). We clarify their basic properties and the relation between the RGRW and the minimum rank distance. As applications of the RDIP and the RGRW, the security performance and the error correction capability of secure network coding, guaranteed independently of the underlying network code, are analyzed and clarified. We propose a construction of secure network coding scheme, and analyze its security performance and error correction capability as an example of applications of the RDIP and the RGRW. Silva and Kschischang showed the existence of a secure network coding in which no part of the secret message is revealed to the adversary even if any    $\dim \mathcal {C} _{1} -1$    links are wiretapped, which is guaranteed over any underlying network code. However, the explicit construction of such a scheme remained an open problem. Our new construction is just one instance of secure network coding that solves this open problem.

Includes members:
  Member "generalized rank weights a duality statement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a geometric approach to rank metric codes and a classification of constant weight codes")
  Member "new parameters of linear codes expressing security performance of universal secure network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on defining generalized rank weights")
  Member "universal secure network coding via rank metric 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 "secure multiplex network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes")
  Member "vulnerability of mrd code based universal secure network coding against stronger eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes")
  Member "secure network coding for wiretap networks of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "data secrecy in distributed storage systems under exact repair")
  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")
  Member "mds codes on the erasure erasure wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the storage versus repair bandwidth trade off for clustered storage systems")

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)