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 "on the existence of perfect splitter sets"):
  Abstract: Given integers $k_1, k_2$ with $0\le k_1<k_2$, the determinations of all positive integers $q$ for which there exists a perfect Splitter $B[-k_1, k_2](q)$ set is a wide open question in general. In this paper, we obtain new necessary and sufficient conditions for an odd prime $p$ such that there exists a nonsingular perfect $B[-1,3](p)$ set. We also give some necessary conditions for the existence of purely singular perfect splitter sets. In particular, we determine all perfect $B[-k_1, k_2](2^n)$ sets for any positive integers $k_1,k_2$ with $k_1+k_2\ge4$. We also prove that there are infinitely many prime $p$ such that there exists a perfect $B[-1,3](p)$ set.

Includes members:
  Member "on the non existence of lattice tilings by quasi crosses":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some new results on splitter sets")
  Member "tilings with n dimensional chairs and their applications to asymmetric codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "some new results on splitter sets")
  Member "quasi cross lattice tilings with applications to flash memory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "some new results on splitter sets")
  Member "a general upper bound on the size of constant weight conflict avoiding codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "partially user irrepressible sequence sets and conflict avoiding codes")

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)