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: "checkable codes from group rings"
  Abstract: We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in the case where the group is a finite abelian group and the ring is a finite field. This characterization leads to many good examples, among which two checkable codes and two shortened codes have minimum distance better than the lower bound given in Grassl's online table. Furthermore, when a group ring is code-checkable, it is shown that every code in such a group ring admits a generator, and that its dual is also generated by an element which may be deduced directly from a check element of the original code. These are analogous to the generator and parity-check polynomials of cyclic codes. In addition, the structures of reversible and complementary dual checkable codes are established as generalizations of reversible and complementary dual cyclic codes.

Connected through hyperedge HE-1 (induced by source paper "group codes over fields are asymptotically good"):
  with members:
    - "on checkable codes in group algebras"

Connected through hyperedge HE-2 (induced by source paper "css like constructions of asymmetric quantum codes"):
  with members:
    - "pure asymmetric quantum mds codes from css construction a complete characterization"
    - "additive asymmetric quantum codes"
    - "nonbinary quantum cyclic and subsystem codes over asymmetrically decohered quantum channels"
    - "on quantum and classical error control codes constructions and applications"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

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)