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: "diameter perfect lee codes"
  Abstract: Lee codes have been intensively studied for more than 40 years. Interest in these codes has been triggered by the Golomb-Welch conjecture on the existence of the perfect error-correcting Lee codes. In this paper, we deal with the existence and enumeration of diameter perfect Lee codes. As main results, we determine all q for which there exists a linear diameter-4 perfect Lee code of word length n over Zq, and prove that for each n ≥ 3, there are uncountable many diameter-4 perfect Lee codes of word length n over Z. This is in a strict contrast with perfect error-correcting Lee codes of word length n over Z as there is a unique such code for n=3, and its is conjectured that this is always the case when 2n+1 is a prime. We produce diameter perfect Lee codes by an algebraic construction that is based on a group homomorphism. This will allow us to design an efficient algorithm for their decoding. We hope that this construction will turn out to be useful far beyond the scope of this paper.

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"
    - "a new approach towards the golomb welch conjecture"
    - "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"
    - "a new approach towards the golomb welch conjecture"

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 new approach towards the golomb welch conjecture"
    - "a generalization of 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:
    - "a new approach towards the golomb welch conjecture"
    - "coding for the lee and manhattan metrics with weighing matrices"
    - "a generalization of 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"
    - "a new approach towards the golomb welch conjecture"

Connected through hyperedge HE-6 (induced by source paper "a new approach towards the golomb welch conjecture"):
  with members:
    - "a generalization of lee codes"
    - "product constructions for perfect lee codes"

Connected through hyperedge HE-7 (induced by source paper "on the non existence of lattice tilings by quasi crosses"):
  with members:
    - "tilings with n dimensional chairs and their applications to asymmetric codes"
    - "quasi cross lattice tilings with applications to flash memory"
    - "product constructions for perfect lee codes"

Connected through hyperedge HE-8 (induced by source paper "a generalization of lee codes"):
  with members:
    - "product constructions for 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)