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 "uncertainty of reconstruction with list decoding from uniform tandem duplication noise"):
  Abstract: We propose a list-decoding scheme for reconstruction codes in the context of uniform-tandem-duplication noise, which can be viewed as an application of the associative memory model to this setting. We find the uncertainty associated with $m>2$ strings (where a previous paper considered $m=2$) in asymptotic terms, where code-words are taken from an error-correcting code. Thus, we find the trade-off between the design minimum distance, the number of errors, the acceptable list size and the resulting uncertainty, which corresponds to the required number of distinct retrieved outputs for successful reconstruction. It is therefore seen that by accepting list-decoding one may decrease coding redundancy, or the required number of reads, or both.

Includes members:
  Member "codes correcting all patterns of tandem duplication errors of maximum length 3":
    also connected through other hyperedges:
      (none)
  Member "reconstruction codes for dna sequences with uniform tandem duplication errors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "bounds and constructions for multi symbol duplication error correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "duplication correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "duplication with transposition distance to the root for q ary strings")
  Member "bounds on codes correcting tandem and palindromic duplications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on list decoding of insertion and deletion errors")
  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 "exact reconstruction from insertions in synchronization codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dna based storage models and fundamental limits")

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)