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 weights an anticode approach"
  Abstract: In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with Frobenius-closed spaces. Then we characterize both generalized Hamming and rank weights of a code in terms of the intersection of the code with optimal anticodes in the respective metrics. Inspired by this description, we propose a new algebraic invariant, which we call "Delsarte generalized weights", for Delsarte rank-metric codes based on optimal anticodes of matrices. We show that our invariant refines the generalized rank weights for Gabidulin codes proposed by Kurihara, Matsumoto and Uyematsu, and establish a series of properties of Delsarte generalized weights. In particular, we characterize Delsarte optimal codes and anticodes in terms of their generalized weights. We also present a duality theory for the new algebraic invariant, proving that the Delsarte generalized weights of a code completely determine the Delsarte generalized weights of the dual code. Our results extend the theory of generalized rank weights for Gabidulin codes. Finally, we prove the analogue for Gabidulin codes of a theorem of Wei, proving that their generalized rank weights characterize the worst-case security drops of a Gabidulin rank-metric code.

Connected through hyperedge HE-1 (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"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-2 (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"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-3 (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"
    - "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"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "generalized rank weights a duality statement"

Connected through hyperedge HE-4 (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"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-5 (induced by source paper "tensor representation of rank metric codes"):
  with members:
    - "codes endowed with the rank metric"

Connected through hyperedge HE-6 (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"
    - "relative generalized rank weight of linear codes and its applications to network coding"

Connected through hyperedge HE-7 (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"
    - "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"
    - "rank metric codes and their duality theory"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-8 (induced by source paper "on defining generalized rank weights"):
  with members:
    - "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"
    - "generalization of gabidulin codes over fields of rational functions"
    - "generalized rank weights a duality statement"
    - "new parameters of linear codes expressing security performance of universal secure 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)