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 matrix weights of matrix codes for universal security on wire tap networks"):
  Abstract: Universal security over a network with linear network coding has been intensively studied. However, previous linear codes and code pairs used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new parameters (relative dimension/rank support profile and relative generalized matrix weights) for code pairs that are linear over the field used in the network, measuring the universal security performance of these code pairs. For one code and non-square matrices, generalized metrix weights coincide with the existing Delsarte generalized weights, hence we prove the conection between these latter weights and secure network coding. The proposed new parameters enable us to use optimal universal secure linear codes on noiseless networks for all possible parameters, as opposed to previous works, and also enable us to add universal security to the recently proposed list-decodable rank-metric codes by Guruswami et al. We give several properties of the new parameters: monotonicity, Singleton-type lower and upper bounds, a duality theorem, and definitions and characterizations of equivalences and degenerateness of linear codes. Finally, we show that our parameters strictly extend relative dimension/length profile and relative generalized Hamming weights, respectively, and relative dimension/intersection profile and relative generalized rank weights, respectively. The duality theorems for generalized Hamming weights and generalized rank weights can be deduced as special cases of the duality theorem for generalized matrix weights.

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 "generalized weights an anticode approach":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rank metric codes")
  Member "rank metric codes and their duality theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "degenerate flag varieties in network coding")
  Member "relative generalized hamming weights of one point algebraic geometric codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on asymptotically good ramp secret sharing schemes")
  Member "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")

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)