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 "reconstruction codes for dna sequences with uniform tandem duplication errors"):
  Abstract: DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction problem, which is applicable whenever multiple reads of noisy data are available. This strategy is uniquely suited to the medium, which inherently replicates stored data in multiple distinct ways, caused by mutations. We consider noise introduced solely by uniform tandem-duplication, and utilize the relation to constantweight integer codes in the Manhattan metric. By bounding the intersection of the cross-polytope with hyperplanes, we prove the existence of reconstruction codes with full rate, as well as suggest a construction for a family of reconstruction codes.

Includes members:
  Member "bounds and constructions for multi symbol duplication error correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "codes in the space of multisets coding for permutation channels with impairments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "rank modulation codes for dna storage":
    also connected through other hyperedges:
      (none)
  Member "duplication correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "uncertainty of reconstruction with list decoding from uniform tandem duplication noise")
  Member "bounds on codes correcting tandem and palindromic duplications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "uncertainty of reconstruction with list decoding from uniform tandem duplication noise")
  Member "coding for racetrack memories":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the error probability of maximum likelihood decoding over two deletion channels")
  Member "codes in the damerau distance for dna storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "guess check codes for deletions insertions and synchronization")

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)