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: "a new approach towards the golomb welch conjecture"
  Abstract: The Golomb-Welch conjecture deals with the existence of perfect e-error correcting Lee codes of word length n, PL(n,e) codes. Although there are many papers on the topic, the conjecture is still far from being solved. In this paper we initiate the study of an invariant connected to abelian groups that enables us to reformulate the conjecture, and then to prove the non-existence of linear PL(n,2) codes for [email protected]?12. Using this new approach we also construct the first quasi-perfect Lee codes for dimension n=3, and show that, for fixed n, there are only finitely many such codes over Z.

Connected through hyperedge HE-1 (induced by source paper "the set of dimensions for which there are no linear perfect 2 error correcting lee codes has positive density"):
  with members:
    - "50 years of the golomb welch conjecture"
    - "diameter perfect lee codes"
    - "error correction of multidimensional bursts"

Connected through hyperedge HE-2 (induced by source paper "on the non existence of linear perfect lee codes the zhang ge condition and a new polynomial criterion"):
  with members:
    - "the set of dimensions for which there are no linear perfect 2 error correcting lee codes has positive density"
    - "50 years of the golomb welch conjecture"
    - "diameter perfect lee codes"

Connected through hyperedge HE-3 (induced by source paper "50 years of the golomb welch conjecture"):
  with members:
    - "quasi perfect lee codes of radius 2 and arbitrarily large dimension"
    - "an algebraic geometric approach to nivat s conjecture"
    - "a generalization of lee codes"
    - "diameter perfect lee codes"
    - "quasi cross lattice tilings with applications to flash memory"
    - "product constructions for perfect lee codes"
    - "error correction of multidimensional bursts"

Connected through hyperedge HE-4 (induced by source paper "quasi perfect lee codes of radius 2 and arbitrarily large dimension"):
  with members:
    - "coding for the lee and manhattan metrics with weighing matrices"
    - "a generalization of lee codes"
    - "diameter perfect lee codes"
    - "product constructions for perfect lee codes"

Connected through hyperedge HE-5 (induced by source paper "quasi perfect codes in the ell_p metric"):
  with members:
    - "quasi perfect lee codes of radius 2 and arbitrarily large dimension"
    - "diameter perfect lee 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)