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: "asymmetric lee distance codes for dna based storage"
  Abstract: We consider a new family of codes, termed asymmetric Lee distance codes, that arise in the design and implementation of DNA-based storage systems and systems with parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes; furthermore, symbol confusability is dictated by their underlying binary representation. Our contributions are two-fold. First, we demonstrate that the new distance represents a linear combination of the Lee and Hamming distance and derive upper bounds on the size of the codes under this metric based on linear programming techniques. Second, we propose a number of code constructions which imply lower bounds.

Connected through hyperedge HE-1 (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"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "the capacity of associated subsequence retrieval"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "fundamental limits of dna storage systems"
    - "rates of dna sequence profiles for practical values of read lengths"
    - "partial dna assembly a rate distortion perspective"
    - "do read errors matter for genome assembly"
    - "codes for dna sequence profiles"
    - "optimal dna shotgun sequencing noisy reads are as good as noiseless reads"
    - "information theory of dna shotgun sequencing"

Connected through hyperedge HE-3 (induced by source paper "set codes with small intersections and small discrepancies"):
  with members:
    - "codes for dna sequence profiles"
    - "approximating bin packing within o log opt log log opt bins"
    - "optimal private halfspace counting via discrepancy"

Connected through hyperedge HE-4 (induced by source paper "on coding over sliced information"):
  with members:
    - "coding over sets for dna storage"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "fundamental limits of dna storage systems"
    - "a rewritable random access dna based storage system"
    - "perfect codes in the discrete simplex"
    - "analysis of boolean functions"

Connected through hyperedge HE-5 (induced by source paper "mutually uncorrelated primers for dna based data storage"):
  with members:
    - "mutually uncorrelated codes for dna storage"
    - "codes in the damerau distance for dna storage"
    - "non overlapping codes"
    - "a rewritable random access dna based storage system"

Connected through hyperedge HE-6 (induced by source paper "exact reconstruction from insertions in synchronization codes"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "string reconstruction from substring compositions"
    - "codes for dna storage channels"
    - "a characterization of the number of subsequences obtained via the deletion channel"

Connected through hyperedge HE-7 (induced by source paper "modular non repeating codes for dna storage"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "a rewritable random access dna based storage system"
    - "on optimal family of codes for dna storage"
    - "codes for dna storage channels"
    - "loopy belief propagation for approximate inference an empirical study"
    - "a generic top down dynamic programming approach to prefix free coding"
    - "dna codes that avoid secondary structures"

Connected through hyperedge HE-8 (induced by source paper "rates of dna sequence profiles for practical values of read lengths"):
  with members:
    - "mutually uncorrelated codes for dna storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "sets represented as the length n factors of a word"

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)