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 extension theorems and the local global property for codes over rings"
  Abstract: The MacWilliams extension theorem is investigated for various weight functions over finite Frobenius rings. The problem is reformulated in terms of a local-global property for subgroups of the general linear group. Among other things, it is shown that the extension theorem holds true for poset weights if and only if the underlying poset is hierarchical. Specifically, the Rosenbloom-Tsfasman weight for vector codes satisfies the extension theorem, whereas the Niederreiter-Rosenbloom-Tsfasman weight for matrix codes does not. A short character-theoretic proof of the well-known MacWilliams extension theorem for the homogeneous weight is provided. Moreover it is shown that the extension theorem carries over to direct products of weights, but not to symmetrized products.

Connected through hyperedge HE-1 (induced by source paper "an enumeration of the equivalence classes of self dual matrix codes"):
  with members:
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (induced by source paper "the homogeneous weight partition and its character theoretic dual"):
  with members:
    - "fourier reflexive partitions and macwilliams identities for additive codes"
    - "partitions of frobenius rings induced by the homogeneous weight"
    - "good random matrices over finite fields"

Connected through hyperedge HE-3 (induced by source paper "fourier reflexive partitions and macwilliams identities for additive codes"):
  with members:
    - "partitions of frobenius rings induced by the homogeneous weight"
    - "classification of poset block spaces admitting macwilliams type identity"
    - "second order weight distributions"
    - "on the existence of universally decodable matrices"
    - "the partition weight enumerator of mds codes and its applications"

Connected through hyperedge HE-4 (induced by source paper "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"):
  with members:
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-5 (induced by source paper "partitions of frobenius rings induced by the homogeneous weight"):
  with members:
    - "fourier reflexive partitions and macwilliams identities for additive codes"
    - "homogeneous weights of matrix product codes over finite principal ideal rings"

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)