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: "generalized rank weights duality and griesmer bound"
  Abstract: We consider linear codes over some fixed finite field extension over an arbitrary finite field. Gabidulin introduced the rank weight for such codes, associating a matrix to a codeword and studied basic properties of these so-called rank metric codes, in analogy with codes endowed with the classical Hamming distance. Inspired by the characterization of wiretap II codes in terms of generalized Hamming weights by Wei, Kurihara \textit{et al.} defined some generalized rank weights and showed their interest in secure network coding. In this paper, we derive a statement for generalized rank weights of the dual code, completely analogous to Wei's one for generalized Hamming weights. We then establish a Griesmer bound for these generalized rank weights and discuss the equality case.

Connected through hyperedge HE-1 (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"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "generalized rank weights a duality statement"
    - "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"

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)