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 "exact reconstruction from insertions in synchronization codes"):
  Abstract: This work studies problems in data reconstruction, an important area with numerous applications. In particular, we examine the reconstruction of binary and non-binary sequences from synchronization (insertion/deletion-correcting) codes. These sequences have been corrupted by a fixed number of symbol insertions (larger than the minimum edit distance of the code), yielding a number of distinct traces to be used for reconstruction. We wish to know the minimum number of traces needed for exact reconstruction. This is a general version of a problem tackled by Levenshtein for uncoded sequences. #R##N#We introduce an exact formula for the maximum number of common supersequences shared by sequences at a certain edit distance, yielding an upper bound on the number of distinct traces necessary to guarantee exact reconstruction. Without specific knowledge of the codewords, this upper bound is tight. We apply our results to the famous single deletion/insertion-correcting Varshamov-Tenengolts (VT) codes and show that a significant number of VT codeword pairs achieve the worst-case number of outputs needed for exact reconstruction. We also consider extensions to other channels, such as adversarial deletion and insertion/deletion channels and probabilistic channels.

Includes members:
  Member "codes in the damerau distance for dna storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reconstruction codes for dna sequences with uniform tandem duplication errors")
  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 "asymmetric lee distance codes for dna based storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "codes for dna sequence profiles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "low complexity interactive algorithms for synchronization from deletions insertions and substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "list decoding of deletions using guess check codes")
  Member "string reconstruction from substring compositions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "codes for dna storage channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "modular non repeating codes for dna storage")

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)