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: "error correction of multidimensional bursts"
  Abstract: In this paper we present several constructions to generate codes for correcting a multidimensional cluster-error. The goal is to correct a cluster-error whose shape can be a box-error, a Lee sphere error, or an error with an arbitrary shape. Our codes have very low redundancy, close to optimal, and large range of parameters of arrays and clusters. Our main results are summarized as follows: 1) A construction of two-dimensional codes capable to correct a rectangular-error with considerably more flexible parameters from previously known constructions. Another advantage of this construction is that it is easily generalized for D dimensions. 2) A novel method based on D colorings of the D-dimensional space for constructing D-dimensional codes correcting D-dimensional cluster-error of various shapes. This method is applied efficiently to correct a D-dimensional cluster error of parameters not covered efficiently by previous onstructions. 3) A transformation of the D-dimensional space into another D-dimensional space such that a D-dimensional Lee sphere is transformed into a shape located in a D-dimensional box of a relatively small size. We use the previous constructions to correct a D-dimensional error whose shape is a D-dimensional Lee sphere. 4) Applying the coloring method to correct more efficiently a two-dimensional error whose shape is a Lee sphere. The D-dimensional case is also discussed. 5) A construction of one-dimensional codes capable to correct a burst-error of length b in which the number of erroneous positions is relatively small compared to b. This construction is generalized for D-dimensional codes. 6) Applying the constructions correcting a Lee sphere error and a cluster-error with small number of erroneous positions, to correct an arbitrary cluster-error.

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"
    - "diameter perfect lee codes"

Connected through hyperedge HE-2 (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"
    - "diameter perfect lee codes"
    - "quasi cross lattice tilings with applications to flash memory"
    - "product constructions for perfect lee codes"

Connected through hyperedge HE-3 (induced by source paper "coding for the lee and manhattan metrics with weighing matrices"):
  with members:
    - "product constructions for perfect lee codes"
    - "complementary sets generalized reed muller codes and power control for ofdm"

Connected through hyperedge HE-4 (induced by source paper "product constructions for perfect lee codes"):
  with members:
    - "dense error correcting codes in the lee metric"
    - "codes in permutations and error correction for rank modulation"
    - "z4 linear hadamard and extended perfect codes"

Connected through hyperedge HE-5 (induced by source paper "decoding q ary lattices in the lee metric"):
  with members:
    - "dense error correcting codes in the lee metric"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-6 (induced by source paper "simple and robust binary self location patterns"):
  with members:
    - "sequence folding lattice tiling and multidimensional coding"

Connected through hyperedge HE-7 (induced by source paper "dense error correcting codes in the lee metric"):
  with members:
    - "codes in permutations and error correction for rank modulation"
    - "complementary sets generalized reed muller codes and power control for ofdm"
    - "z4 linear hadamard and extended perfect codes"

Connected through hyperedge HE-8 (induced by source paper "sequence folding lattice tiling and multidimensional coding"):
  with members:
    - "high dimensional error correcting 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)