human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes"):
  with members:
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "sub quadratic decoding of gabidulin codes"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "convolutional codes in rank metric with application to random network coding"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "bounds on list decoding of rank metric codes"
    - "universal secure network coding via rank metric codes"
    - "on partial unit memory codes based on gabidulin codes"

Connected through hyperedge HE-2 (induced by source paper "rank metric codes"):
  with members:
    - "rank metric codes and q polymatroids"
    - "codes endowed with the rank metric"
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-3 (induced by source paper "a polymatroid approach to generalized weights of rank metric codes"):
  with members:
    - "rank metric codes"
    - "rank metric codes and q polymatroids"
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-4 (induced by source paper "theory of supports for linear codes endowed with the sum rank metric"):
  with members:
    - "private information retrieval from locally repairable databases with colluding servers"
    - "on defining generalized rank weights"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "private information retrieval from coded databases with colluding servers"
    - "rank error correcting pairs"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "convolutional codes in rank metric with application to random network coding"

Connected through hyperedge HE-5 (induced by source paper "partitions of matrix spaces with an application to q rook polynomials"):
  with members:
    - "a polymatroid approach to generalized weights of rank metric codes"
    - "rank metric codes and q polymatroids"
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "codes endowed with the rank metric"
    - "adversarial network coding"
    - "algebraic structures of mrd codes"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"

Connected through hyperedge HE-6 (induced by source paper "rank metric codes and q polymatroids"):
  with members:
    - "codes endowed with the rank metric"
    - "on defining generalized rank weights"
    - "unifying notions of generalized weights for universal security on wire tap networks"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "coding for errors and erasures in random network coding"

Question: Please tell me which class the center node 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)