human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
  Abstract: A (tandem) duplication of length    ${k} $    is an insertion of an exact copy of a substring of length    ${k} $    next to its original position. This and related types of impairments are of relevance in modeling communication in the presence of synchronization errors, as well as in several information storage applications. We demonstrate that Levenshtein’s construction of binary codes correcting insertions of zeros is, with minor modifications, applicable also to channels with arbitrary alphabets and with  duplication  errors of arbitrary (but fixed) length    ${k} $   . Furthermore, we derive bounds on the cardinality of optimal    ${q} $   -ary codes correcting up to    ${t} $    duplications of length    ${k} $    and establish the following corollaries in the asymptotic regime of growing block length: 1) the presented family of codes is optimal for every    ${q, t, k} $   , in the sense of the asymptotic scaling of code redundancy; 2) the upper bound, when specialized to    ${q=2} $   ,    ${k=1} $   , improves upon Levenshtein’s bound for every    ${t\geq 3} $   ; and 3) the bounds coincide for    ${t=1} $   , thus yielding the exact asymptotic behavior of the size of optimal single-duplication-correcting codes.

Connected through hyperedge HE-1 (induced by source paper "optimal constant weight codes under l_1 metric"):
  with members:
    - "single error detection and correction for duplication and substitution channels"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "constructions of optimal and near optimal multiply constant weight codes"
    - "systematic error correcting codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-2 (induced by source paper "uncertainty of reconstruction with list decoding from uniform tandem duplication noise"):
  with members:
    - "codes correcting all patterns of tandem duplication errors of maximum length 3"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "duplication correcting codes"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "coding for racetrack memories"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-3 (induced by source paper "duplication with transposition distance to the root for q ary strings"):
  with members:
    - "zero error capacity of duplication channels"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "efficient encoding decoding of irreducible words for codes correcting tandem duplications"
    - "duplication correcting codes"

Connected through hyperedge HE-4 (induced by source paper "reconstruction codes for dna sequences with uniform tandem duplication errors"):
  with members:
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "rank modulation codes for dna storage"
    - "duplication correcting codes"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "coding for racetrack memories"
    - "codes in the damerau distance for dna storage"
    - "asymmetric lee distance codes for dna based storage"

Connected through hyperedge HE-5 (induced by source paper "capacity results for the noisy shuffling channel"):
  with members:
    - "anchor based correction of substitutions in indexed sets"
    - "sequence subset distance and coding for error control in dna based data storage"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a characterization of the dna data storage channel"
    - "fundamental limits of dna storage systems"
    - "exact reconstruction from insertions in synchronization codes"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-6 (induced by source paper "on conflict free dna codes"):
  with members:
    - "properties and constructions of constrained codes for dna based data storage"
    - "the art of dna strings sixteen years of dna coding theory"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "natural data storage a review on sending information from now to then via nature"
    - "dna codes that avoid secondary structures"

Connected through hyperedge HE-7 (induced by source paper "runlength limited sequences and shift correcting codes asymptotic analysis"):
  with members:
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a note on parallel asynchronous channels with arbitrary skews"
    - "zero error capacity of p ary shift channels and fifo queues"
    - "zero error capacity of a class of timing channels"
    - "constant weight and constant charge binary run length limited codes"

Connected through hyperedge HE-8 (induced by source paper "zero error capacity of duplication channels"):
  with members:
    - "runlength limited sequences and shift correcting codes asymptotic analysis"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "the capacity of some p olya string models"
    - "sharp analytical capacity upper bounds for sticky and related channels"
    - "on the capacity of channels with timing synchronization errors"

Question: Please tell me which class the center node 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)