human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "50 years of the golomb welch conjecture"):
  Abstract: Since 1968, when the Golomb--Welch conjecture was raised, it has become the main motive power behind the progress in the area of the perfect Lee codes. Although there is a vast literature on the topic and it is widely believed to be true, this conjecture is far from being solved. In this paper, we provide a survey of papers on the Golomb--Welch conjecture. Further, new results on Golomb--Welch conjecture dealing with perfect Lee codes of large radii are presented. Algebraic ways of tackling the conjecture in the future are discussed as well. Finally, a brief survey of research inspired by the conjecture is given.

Includes members:
  Member "quasi perfect lee codes of radius 2 and arbitrarily large dimension":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quasi perfect codes in the ell_p metric")
  Member "an algebraic geometric approach to nivat s conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low complexity tilings of the plane")
  Member "a new approach towards the golomb welch conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the set of dimensions for which there are no linear perfect 2 error correcting lee codes has positive density")
  Member "a generalization of lee codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quasi perfect lee codes of radius 2 and arbitrarily large dimension")
  Member "diameter perfect lee codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the set of dimensions for which there are no linear perfect 2 error correcting lee codes has positive density")
  Member "quasi cross lattice tilings with applications to flash memory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "some new results on splitter sets")
  Member "product constructions for perfect lee codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cooling codes thermal management coding for high performance interconnects")
  Member "error correction of multidimensional bursts":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the set of dimensions for which there are no linear perfect 2 error correcting lee codes has positive density")

Question: Please tell me which class the source paper 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)