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 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.

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"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "sub quadratic decoding of gabidulin codes"
    - "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 matrix weights of matrix codes for universal security on wire tap networks"
    - "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 matrix weights of matrix codes for universal security on wire tap networks"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-4 (induced by source paper "a geometric approach to rank metric codes and a classification of constant weight codes"):
  with members:
    - "on defining generalized rank weights"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "generalized rank weights a duality statement"

Connected through hyperedge HE-5 (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"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "private information retrieval from coded databases with colluding servers"
    - "rank error correcting pairs"
    - "convolutional codes in rank metric with application to random 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"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "unifying notions of generalized weights for universal security on wire tap networks"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes"):
  with members:
    - "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "coding across unicast sessions can increase the secure message capacity"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "on secure network coding for two unicast sessions studying butterflies"
    - "coding against a limited view adversary the effect of causality and feedback"

Connected through hyperedge HE-8 (induced by source paper "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"):
  with members:
    - "secure network code for adaptive and active attacks with no randomness in intermediate nodes"
    - "universal construction of cheater identifiable secret sharing against rushing cheaters without honest majority"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "coding against a limited view adversary the effect of causality and feedback"
    - "non asymptotic and asymptotic analyses of information processing on markov chains"

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)