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: "rank weight hierarchy of some classes of cyclic codes"
  Abstract: We study the rank weight hierarchy, thus in particular the rank metric, of cyclic codes over the finite field $\mathbb F_{q^m}$, $q$ a prime power, $m \geq 2$. We establish the rank weight hierarchy for $[n,n-1]$ cyclic codes and characterize $[n,k]$ cyclic codes of rank metric 1 when (1) $k=1$, (2) $n$ and $q$ are coprime, and (3) the characteristic $char(\mathbb F_q)$ divides $n$. Finally, for $n$ and $q$ coprime, cyclic codes of minimal $r$-rank are characterized, and a refinement of the Singleton bound for the rank weight is derived.

Connected through hyperedge HE-1 (induced by source paper "rank metric codes generalized binomial moments and their zeta functions"):
  with members:
    - "rank metric codes"
    - "on dually almost mrd codes"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "on dually almost mrd codes"):
  with members:
    - "algebraic structures of mrd codes"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on self dual mrd codes"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "generalized rank weights a duality statement"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-3 (induced by source paper "generalized rank weights of reducible codes optimal cases and related properties"):
  with members:
    - "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"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "generalized rank weights a duality statement"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-4 (induced by source paper "rank equivalent and rank degenerate skew cyclic codes"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on the roots and minimum rank distance of skew cyclic codes"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized rank weights a duality statement"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-5 (induced by source paper "on the similarities between generalized rank and hamming weights and their applications to network coding"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "generalized rank weights a duality statement"
    - "generalized rank weights duality and griesmer bound"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "on the roots and minimum rank distance of skew cyclic codes"):
  with members:
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "rank metric codes and their duality theory"
    - "on metrics for error correction in 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)