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: "constant weight and constant charge binary run length limited codes"
  Abstract: Constant-weight and constant-charge binary sequences with constrained run length of zeros are introduced. The weight and charge distribution for these sequences are found. Next, recurrent and direct formulas for calculating the number of these sequences are obtained. By considering these numbers of constant-weight and constant-charge run-length limited (RLL) sequences as coefficients of convergent power series, generating functions are derived. The fact that generating function for enumerating constant-charge RLL sequences does not have a closed form is proved. Subsequently, implementation of encoding and decoding procedures using Cover's enumerative scheme is shown. Based on the obtained results, some examples, such as enumeration of running-digital sum (RDS) constrained RLL sequences or peak-shifts control capability are also provided.

Connected through hyperedge HE-1 (induced by source paper "runlength limited sequences and shift correcting codes asymptotic analysis"):
  with members:
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "bounds and constructions for multi symbol duplication error correcting codes"):
  with members:
    - "bounds on codes correcting tandem and palindromic duplications"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "generalized sphere packing bound"

Connected through hyperedge HE-3 (induced by source paper "duplication correcting codes"):
  with members:
    - "bounds on codes correcting tandem and palindromic duplications"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "codes correcting a burst of deletions or insertions"
    - "generalized sphere packing bound"
    - "non asymptotic upper bounds for deletion correcting codes"

Connected through hyperedge HE-4 (induced by source paper "bounds on codes correcting tandem and palindromic duplications"):
  with members:
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "codes correcting a burst of deletions or insertions"
    - "generalized sphere packing bound"

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)