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 "some new results on splitter sets"):
  Abstract: Splitter sets have been widely studied due to their applications in flash memories, and their close relations with lattice tilings and conflict avoiding codes. In this paper, we give necessary and sufficient conditions for the existence of nonsingular perfect splitter sets, $B[-k_1,k_2](p)$ sets, where $0\le k_{1}\leq k_{2}=4$. Meanwhile, constructions of nonsingular perfect splitter sets are given. When perfect splitter sets do not exist, we present four new constructions of quasi-perfect splitter sets. Finally, we give a connection between nonsingular splitter sets and Cayley graphs, and as a byproduct, a general lower bound on the maximum size of nonsingular splitter sets is given.

Includes members:
  Member "asymmetric single magnitude four error correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "correcting codes for asymmetric single magnitude four error")
  Member "correcting codes for asymmetric single magnitude four error":
    also connected through other hyperedges:
      (none)
  Member "on the existence of perfect splitter sets":
    also connected through other hyperedges:
      (none)
  Member "on the non existence of lattice tilings by quasi crosses":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the existence of perfect splitter sets")
  Member "tilings with n dimensional chairs and their applications to asymmetric codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the existence of perfect splitter sets")
  Member "quasi cross lattice tilings with applications to flash memory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the existence of perfect splitter sets")

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)