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: "on the non existence of lattice tilings by quasi crosses"
  Abstract: We study necessary conditions for the existence of lattice tilings of $\R^n$ by quasi-crosses. We prove non-existence results, and focus in particular on the two smallest unclassified shapes, the $(3,1,n)$-quasi-cross and the $(3,2,n)$-quasi-cross. We show that for dimensions $n\leq 250$, apart from the known constructions, there are no lattice tilings of $\R^n$ by $(3,1,n)$-quasi-crosses except for ten remaining cases, and no lattice tilings of $\R^n$ by $(3,2,n)$-quasi-crosses except for eleven remaining cases.

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"
    - "tilings with n dimensional chairs and their applications to asymmetric codes"
    - "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:
    - "tilings with n dimensional chairs and their applications to asymmetric codes"
    - "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 "generalized sphere packing bound"):
  with members:
    - "upper bounds on the size of grain correcting codes"
    - "bounds for projective codes from semidefinite programming"
    - "correcting grain errors in magnetic media"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "linearity and complements in projective space"
    - "write channel model for bit patterned media recording"
    - "coding for high density recording on a 1 d granular magnetic medium"
    - "coding for errors and erasures in random network coding"

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)