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: "on the non existence of linear perfect lee codes the zhang ge condition and a new polynomial criterion"
  Abstract: The Golomb-Welch conjecture (1968) states that there are no $e$-perfect Lee codes in $\mathbb{Z}^n$ for $n\geq 3$ and $e\geq 2$. This conjecture remains open even for linear codes. A recent result of Zhang and Ge establishes the non-existence of linear $e$-perfect Lee codes in $\mathbb{Z}^n$ for infinitely many dimensions $n$, for $e=3$ and $4$. In this paper we extend this result in two ways. First, using the non-existence criterion of Zhang and Ge together with a generalized version of Lucas' theorem we extend the above result for almost all $e$ (i.e. a subset of positive integers with density $1$). Namely, if $e$ contains a digit $1$ in its base-$3$ representation which is not in the unit place (e.g. $e=3,4$) there are no linear $e$-perfect Lee codes in $\mathbb{Z}^n$ for infinitely many dimensions $n$. Next, based on a family of polynomials (the $Q$-polynomials), we present a new criterion for the non-existence of certain lattice tilings. This criterion depends on a prime $p$ and a tile $B$. For $p=3$ and $B$ being a Lee ball we recover the criterion of Zhang and Ge.

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)