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: "macwilliams identity for codes with the rank metric"
  Abstract: The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear codes with the rank metric, and our identity has a different form than that by Delsarte. Using our MacWilliams identity, we also derive related identities for rank metric codes. These identities parallel the binomial and power moment identities derived for codes with the Hamming metric.

Connected through hyperedge HE-1 (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"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "algebraic structures of mrd codes"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"

Connected through hyperedge HE-2 (induced by source paper "codes endowed with the rank metric"):
  with members:
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "rank distribution of delsarte codes"
    - "rank metric codes and their duality theory"
    - "subspace codes from ferrers diagrams"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (induced by source paper "rank distribution of delsarte codes"):
  with members:
    - "algebraic structures of mrd codes"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "generalized weights an anticode approach"
    - "fourier reflexive partitions and macwilliams identities for additive codes"
    - "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"
    - "macwilliams identity for the rank metric"

Connected through hyperedge HE-4 (induced by source paper "characterization of metrics induced by hierarchical posets"):
  with members:
    - "linear codes on posets with extension property"

Connected through hyperedge HE-5 (induced by source paper "rank metric codes and their duality theory"):
  with members:
    - "fourier reflexive partitions and macwilliams identities for additive codes"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "macwilliams identity for the rank metric"

Connected through hyperedge HE-6 (induced by source paper "constant rank codes and their connection to constant dimension codes"):
  with members:
    - "recursive code construction for random networks"
    - "construction and covering properties of constant dimension codes"
    - "on metrics for error correction in network coding"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"
    - "bounds on covering codes with the rank metric"
    - "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)