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 coding over sliced information"):
  Abstract: The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In this paper we analyze the minimal redundancy of binary codes for this channel under substitution errors, and provide several constructions, some of which are shown to be asymptotically optimal. The surprising result in this paper is that while the information vector is sliced into a set of unordered strings, the amount of redundant bits that are required to correct errors is asymptotically equal to the amount required in the classical error correcting paradigm.

Includes members:
  Member "coding over sets for dna storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coded trace reconstruction")
  Member "codes in the space of multisets coding for permutation channels with impairments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "fundamental limits of dna storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dna based storage models and fundamental limits")
  Member "asymmetric lee distance codes for dna based storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reconstruction codes for dna sequences with uniform tandem duplication errors")
  Member "a rewritable random access dna based storage system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "perfect codes in the discrete simplex":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "codes in the space of multisets coding for permutation channels with impairments")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coarse grained complexity for dynamic algorithms")

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)