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: "quasi cross lattice tilings with applications to flash memory"
  Abstract: We consider lattice tilings of $\R^n$ by a shape we call a $(\kp,\km,n)$-quasi-cross. Such lattices form perfect error-correcting codes which correct a single limited-magnitude error with prescribed maximal-magnitudes of positive error and negative error (the ratio of which is called the balance ratio). These codes can be used to correct both disturb and retention errors in flash memories, which are characterized by having limited magnitudes and different signs. #R##N#We construct infinite families of perfect codes for any rational balance ratio, and provide a specific construction for $(2,1,n)$-quasi-cross lattice tiling. The constructions are related to group splitting and modular $B_1$ sequences. We also study bounds on the parameters of lattice-tilings by quasi-crosses, connecting the arm lengths of the quasi-crosses and the dimension. We also prove constraints on group splitting, a specific case of which shows that the parameters of the lattice tiling of $(2,1,n)$-quasi-crosses is the only ones possible.

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"
    - "tilings with n dimensional chairs and their applications to asymmetric codes"

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"
    - "tilings with n dimensional chairs and their applications to asymmetric codes"
    - "a general upper bound on the size of constant weight conflict avoiding codes"

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"
    - "diameter perfect lee codes"
    - "product constructions for perfect lee codes"
    - "error correction of multidimensional bursts"

Connected through hyperedge HE-4 (induced by source paper "on error detection in asymmetric channels"):
  with members:
    - "on q ary codes correcting all unidirectional errors of a limited magnitude"

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"
    - "tilings with n dimensional chairs and their applications to asymmetric codes"
    - "product constructions for perfect lee codes"

Connected through hyperedge HE-6 (induced by source paper "diameter perfect lee codes"):
  with members:
    - "a generalization of lee codes"
    - "product constructions for perfect lee codes"

Connected through hyperedge HE-7 (induced by source paper "tilings with n dimensional chairs and their applications to asymmetric codes"):
  with members:
    - "new constructions of wom codes using the wozencraft ensemble"

Connected through hyperedge HE-8 (induced by source paper "on the labeling problem of permutation group codes under the infinity metric"):
  with members:
    - "generalized gray codes for local rank modulation"
    - "computing the ball size of frequency permutations under chebyshev distance"
    - "constructions of rank modulation codes"
    - "constant weight gray codes for local rank modulation"
    - "codes in permutations and error correction for rank modulation"
    - "correcting limited magnitude errors in the rank modulation scheme"

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)