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: "codes from zero divisors and units in group rings"
  Abstract: We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic codes are ideals in the group ring over a cyclic group. The fresh focus is on the encodings themselves, which only under very limited conditions result in ideals. We use the result that a group ring is isomorphic to a certain well-defined ring of matrices, and thus every group ring element has an associated matrix. This allows matrix algebra to be used as needed in the study and production of codes, enabling the creation of standard generator and check matrices. Group rings are a fruitful source of units and zero-divisors from which new codes result. Many code properties, such as being LDPC or self-dual, may be expressed as properties within the group ring thus enabling the construction of codes with these properties. The methods are general enabling the construction of codes with many types of group rings. There is no restriction on the ring and thus codes over the integers, over matrix rings or even over group rings themselves are possible and fruitful.

Connected through hyperedge HE-1 (induced by source paper "maximum distance separable codes to order"):
  with members:
    - "linear complementary dual maximum distance separable codes"
    - "coding theory the unit derived methodology"
    - "entanglement assisted quantum error correcting codes from units"
    - "solving underdetermined systems with error correcting codes"
    - "systems of mds codes from units and idempotents"

Connected through hyperedge HE-2 (induced by source paper "linear complementary dual maximum distance separable codes"):
  with members:
    - "coding theory the unit derived methodology"
    - "linear codes over fq which are equivalent to lcd codes"
    - "new characterization and parametrization of lcd codes"
    - "complementary dual algebraic geometry codes"
    - "systems of mds codes from units and idempotents"

Connected through hyperedge HE-3 (induced by source paper "mds codes over finite fields"):
  with members:
    - "coding theory the unit derived methodology"
    - "systems of mds codes from units and idempotents"

Connected through hyperedge HE-4 (induced by source paper "coding theory the unit derived methodology"):
  with members:
    - "solving underdetermined systems with error correcting codes"
    - "systems of mds codes from units and idempotents"
    - "convolutional codes from units in matrix and group rings"
    - "self dual dual containing and related quantum codes from group rings"

Connected through hyperedge HE-5 (induced by source paper "quantum error correcting codes the unit derived strategy"):
  with members:
    - "coding theory the unit derived methodology"
    - "systems of mds codes from units and idempotents"
    - "self dual dual containing and related quantum codes from group rings"

Connected through hyperedge HE-6 (induced by source paper "construction and encoding of qc ldpc codes using group rings"):
  with members:
    - "ldpc lattice codes for full duplex relay channels"
    - "channel coding the road to channel capacity"

Connected through hyperedge HE-7 (induced by source paper "solving underdetermined systems with error correcting codes"):
  with members:
    - "systems of mds codes from units and idempotents"

Connected through hyperedge HE-8 (induced by source paper "cryptography key exchange public key"):
  with members:
    - "systems of mds codes from units and idempotents"

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)