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: "tilings with n dimensional chairs and their applications to asymmetric codes"
  Abstract: An $n$-dimensional chair consists of an $n$-dimensional box from which a smaller $n$-dimensional box is removed. A tiling of an $n$-dimensional chair has two nice applications in coding for write-once memories. The first one is in the design of codes which correct asymmetric errors with limited-magnitude. The second one is in the design of $n$ cells $q$-ary write-once memory codes. We show an equivalence between the design of a tiling with an integer lattice and the design of a tiling from a generalization of splitting (or of Sidon sequences). A tiling of an $n$-dimensional chair can define a perfect code for correcting asymmetric errors with limited-magnitude. We present constructions for such tilings and prove cases where perfect codes for these type of errors do not exist.

Connected through hyperedge HE-1 (induced by source paper "some new results on splitter sets"):
  with members:
    - "asymmetric single magnitude four error correcting codes"
    - "correcting codes for asymmetric single magnitude four error"
    - "on the existence of perfect splitter sets"
    - "on the non existence of lattice tilings by quasi crosses"
    - "quasi cross lattice tilings with applications to flash memory"

Connected through hyperedge HE-2 (induced by source paper "on the existence of perfect splitter sets"):
  with members:
    - "on the non existence of lattice tilings by quasi crosses"
    - "quasi cross lattice tilings with applications to flash memory"
    - "a general upper bound on the size of constant weight conflict avoiding codes"

Connected through hyperedge HE-3 (induced by source paper "asymmetric single magnitude four error correcting codes"):
  with members:
    - "optimal equi difference conflict avoiding codes"
    - "on q ary codes correcting all unidirectional errors of a limited magnitude"

Connected through hyperedge HE-4 (induced by source paper "correcting codes for asymmetric single magnitude four error"):
  with members:
    - "asymmetric single magnitude four error correcting codes"

Connected through hyperedge HE-5 (induced by source paper "on the non existence of lattice tilings by quasi crosses"):
  with members:
    - "diameter perfect lee codes"
    - "quasi cross lattice tilings with applications to flash memory"
    - "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)