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: "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.

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"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "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"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "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"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "efficient encoding decoding of irreducible words for codes correcting tandem duplications"
    - "duplication correcting codes"

Connected through hyperedge HE-4 (induced by source paper "coding for sequence reconstruction for single edits"):
  with members:
    - "coded trace reconstruction"
    - "coding for racetrack memories"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-5 (induced by source paper "some enumeration problems in the duplication loss model of genome rearrangement"):
  with members:
    - "error correction in flash memories via codes in the ulam metric"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-6 (induced by source paper "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"):
  with members:
    - "runlength limited sequences and shift correcting codes asymptotic analysis"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "duplication correcting codes"

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)