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 "duplication correcting codes"):
  Abstract: In this work, we propose constructions that correct duplications of multiple consecutive symbols. These errors are known as tandem duplications, where a sequence of symbols is repeated; respectively as palindromic duplications, where a sequence is repeated in reversed order. We compare the redundancies of these constructions with code size upper bounds that are obtained from sphere packing arguments. Proving that an upper bound on the code cardinality for tandem deletions is also an upper bound for inserting tandem duplications, we derive the bounds based on this special tandem deletion error as this results in tighter bounds. Our upper bounds on the cardinality directly imply lower bounds on the redundancy which we compare with the redundancy of the best known construction correcting arbitrary burst insertions. Our results indicate that the correction of palindromic duplications requires more redundancy than the correction of tandem duplications and both significantly less than arbitrary burst insertions.

Includes members:
  Member "bounds on codes correcting tandem and palindromic duplications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "uncertainty of reconstruction with list decoding from uniform tandem duplication noise")
  Member "duplication correcting codes for data storage in the dna of living organisms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "codes correcting a burst of deletions or insertions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "generalized sphere packing bound":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "covering codes for insertions and deletions")
  Member "non asymptotic upper bounds for deletion correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exact reconstruction from insertions in synchronization codes")
  Member "constant weight and constant charge binary run length limited codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "runlength limited sequences and shift correcting codes asymptotic analysis")

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)