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: "zero error capacity of duplication channels"
  Abstract: This paper is motivated by the problem of error-free communication through the i.i.d. duplication channel which acts on the transmitted sequence by inserting a random number of duplicates of each symbol next to the original symbol. A construction of optimal codes correcting all patterns of errors of this type is described, and the zero-error capacity of the duplication channel is determined. A generalization of these results to channel models in which blocks of $ \ell $ consecutive symbols are being duplicated, and which are inspired by DNA-based data storage systems where the stored molecules are subject to tandem-duplication mutations, is also given.

Connected through hyperedge HE-1 (induced by source paper "variable length coding for zero error channel capacity"):
  with members:
    - "bounds on the reliability of typewriter channels"
    - "zero error capacity of p ary shift channels and fifo queues"
    - "the rho capacity of a graph"
    - "uncertain wiretap channels and secure estimation"
    - "rate distance tradeoff for codes above graph capacity"
    - "secure estimation and zero error secrecy capacity"
    - "graph information ratio"
    - "new lower bounds for the shannon capacity of odd cycles"

Connected through hyperedge HE-2 (induced by source paper "optimal codes correcting a burst of deletions of variable length"):
  with members:
    - "optimal k deletion correcting codes"
    - "optimal document exchange and new codes for insertions and deletions"
    - "an improvement of non binary code correcting single b burst of insertions or deletions"
    - "polynomial time decodable codes for the binary deletion channel"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-3 (induced by source paper "duplication with transposition distance to the root for q ary strings"):
  with members:
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "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 "an overview of capacity results for synchronization channels"):
  with members:
    - "coding for deletion channels with multiple traces"
    - "coded trace reconstruction"
    - "coded trace reconstruction in a constant number of traces"
    - "optimally resilient codes for list decoding from insertions and deletions"
    - "approximating edit distance within constant factor in truly sub quadratic time"
    - "maximum likelihood upper bounds on the capacities of discrete information stable channels"
    - "sharp analytical capacity upper bounds for sticky and related channels"
    - "on the list decodability of insertions and deletions"

Connected through hyperedge HE-5 (induced by source paper "codes correcting all patterns of tandem duplication errors of maximum length 3"):
  with members:
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "efficient encoding decoding of irreducible words for codes correcting tandem duplications"

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)