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: "asymmetric single magnitude four error correcting codes"
  Abstract: Limited magnitude asymmetric error model is well suited for flash memory. In this paper, we consider the construction of asymmetric codes correcting single error over $\mathbb{Z}_{2^{k}r}$ and which are based on so called $B_{1}[4](2^{k}r)$ set. In fact, we reduce the construction of a maximal size $B_{1}[4](2^{k}r)$ set for $k\geq3$ to the construction of a maximal size $B_{1}[4](2^{k-3}r)$ set. Finally, we give a explicit formula of a maximal size $B_{1}[4](4r)$ set and some lower bounds of a maximal size $B_{1}[4](2r)$ set. By computer searching up to $q\leq106$, we conjecture that those lower bounds are tight.

Connected through hyperedge HE-1 (induced by source paper "some new results on splitter sets"):
  with members:
    - "correcting codes for asymmetric single magnitude four error"
    - "on the existence of perfect splitter sets"
    - "on the non existence of lattice tilings by quasi crosses"
    - "tilings with n dimensional chairs and their applications to asymmetric codes"
    - "quasi cross lattice tilings with applications to flash memory"

Connected through hyperedge HE-2 (induced by source paper "correcting codes for asymmetric single magnitude four error"):
  with members:
    - "tilings with n dimensional chairs and their applications to asymmetric codes"

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)