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: "polynomial time decodable codes for the binary deletion channel"
  Abstract: In the random deletion channel, each bit is deleted independently with probability $p$. For the random deletion channel, the existence of codes of rate $(1-p)/9$, and thus bounded away from $0$ for any $p   0$.

Connected through hyperedge HE-1 (induced by source paper "optimal codes correcting a burst of deletions of variable length"):
  with members:
    - "zero error capacity of duplication channels"
    - "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"
    - "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-2 (induced by source paper "coded trace reconstruction in a constant number of traces"):
  with members:
    - "coding for deletion channels with multiple traces"
    - "coded trace reconstruction"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "capacity upper bounds for deletion type channels"
    - "average case reconstruction for the deletion channel subpolynomially many traces suffice"
    - "synchronization strings explicit constructions local decoding and applications"

Connected through hyperedge HE-3 (induced by source paper "bit flipping moment balancing schemes for insertion deletion and substitution error correction"):
  with members:
    - "synchronization strings list decoding for insertions and deletions"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "synchronization strings efficient and fast deterministic constructions over small alphabets"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "coding against deletions in oblivious and online models"
    - "codes correcting a burst of deletions or insertions"

Connected through hyperedge HE-4 (induced by source paper "covering codes for insertions and deletions"):
  with members:
    - "an overview of capacity results for synchronization channels"
    - "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"
    - "optimally resilient codes for list decoding from insertions and deletions"
    - "an improved bound on the fraction of correctable deletions"
    - "locality sensitive hashing without false negatives"
    - "coding for interactive communication correcting insertions and deletions"
    - "generalized sphere packing bound"
    - "a characterization of the number of subsequences obtained via the deletion channel"

Connected through hyperedge HE-5 (induced by source paper "explicit and efficient constructions of coding schemes for the binary deletion channel and the poisson repeat channel"):
  with members:
    - "capacity upper bounds for deletion type channels"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "an improved bound on the fraction of correctable deletions"
    - "deletion codes in the high noise and high rate regimes"
    - "a new bound for the capacity of the deletion channel with high deletion probabilities"

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)