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 "quasi perfect lee codes of radius 2 and arbitrarily large dimension"):
  Abstract: A construction of two-quasi-perfect Lee codes is given over the space    $\mathbb Z_{p}^{n}$    for    $p$    prime,    $p\equiv \pm 5\pmod {12}$   , and    $n=2[{p}/{4}]$   . It is known that there are infinitely many such primes. Golomb and Welch conjectured that perfect codes for the Lee metric do not exist for dimension    $n\geq 3$    and radius    $r\geq 2$   . This conjecture was proved to be true for large radii as well as for low dimensions. The codes found are very close to be perfect, which exhibits the hardness of the conjecture. A series of computations show that related graphs are Ramanujan, which could provide further connections between coding and graph theories.

Includes members:
  Member "a new approach towards the golomb welch conjecture":
    also connected through other hyperedges:
      - 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")
  Member "coding for the lee and manhattan metrics with weighing matrices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounds for the l_1 distance of q ary lattices obtained via constructions d d and overline d")
  Member "a generalization of lee codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "50 years of the golomb welch conjecture")
  Member "diameter perfect lee codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the set of dimensions for which there are no linear perfect 2 error correcting lee codes has positive density")
  Member "product constructions for perfect lee codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "50 years of the golomb welch conjecture")

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)