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: "runlength limited sequences and shift correcting codes asymptotic analysis"
  Abstract: This work is motivated by the problem of error correction in bit-shift channels with the so-called    ${(d,k)} $    input constraints (where successive 1’s are required to be separated by at least    ${d} $    and at most    ${k} $    zeros,    ${0 \leq d   ). Bounds on the size of optimal    ${(d,k)} $   -constrained codes correcting a fixed number of bit-shifts are derived, with a focus on their asymptotic behavior in the large block-length limit. The upper bound is obtained by a packing argument, while the lower bound follows from a construction based on a family of integer lattices. Several properties of    ${(d, k)} $   -constrained sequences that may be of independent interest are established as well; in particular, the exponential growth rate of the number of    ${(d, k)} $   -constrained constant-weight sequences is characterized. The results are relevant for magnetic and optical information storage systems, reader-to-tag RFID channels, and other communication models where bit-shift errors are dominant and where    ${(d, k)} $   -constrained sequences are used for modulation.

Connected through hyperedge HE-1 (induced by source paper "zero error capacity of duplication channels"):
  with members:
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"):
  with members:
    - "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"
    - "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)