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: "codes correcting a burst of deletions or insertions"
  Abstract: This paper studies codes that correct bursts of deletions. Namely, a code will be called a $b$-burst-deletion-correcting code if it can correct a deletion of any $b$ consecutive bits. While the lower bound on the redundancy of such codes was shown by Levenshtein to be asymptotically $\log(n)+b-1$, the redundancy of the best code construction by Cheng et al. is $b(\log (n/b+1))$. In this paper we close on this gap and provide codes with redundancy at most $\log(n) + (b-1)\log(\log(n)) +b -\log(b)$. #R##N#We also derive a non-asymptotic upper bound on the size of $b$-burst-deletion-correcting codes and extend the burst deletion model to two more cases: 1) A deletion burst of at most $b$ consecutive bits and 2) A deletion burst of size at most $b$ (not necessarily consecutive). We extend our code construction for the first case and study the second case for $b=3,4$. The equivalent models for insertions are also studied and are shown to be equivalent to correcting the corresponding burst of deletions.

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"
    - "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"
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-2 (induced by source paper "the error probability of maximum likelihood decoding over two deletion channels"):
  with members:
    - "coding for sequence reconstruction for single edits"
    - "tutorial on algebraic deletion correction codes"
    - "coding for deletion channels with multiple traces"
    - "from clustering supersequences to entropy minimizing subsequences for single and double deletions"
    - "average case reconstruction for the deletion channel subpolynomially many traces suffice"
    - "coding for racetrack memories"
    - "fundamental bounds and approaches to sequence reconstruction from nanopore sequencers"
    - "optimal mean based algorithms for trace reconstruction"

Connected through hyperedge HE-3 (induced by source paper "weight enumerators for number theoretic codes and cardinalities of non binary vt codes"):
  with members:
    - "applications of gaussian binomials to coding theory for deletion error correction"
    - "an explicit formula for a weight enumerator of linear congruence codes"

Connected through hyperedge HE-4 (induced by source paper "capacity approaching constrained codes with error correction for dna based data storage"):
  with members:
    - "optimal codes correcting a single indel edit for dna based data storage"

Connected through hyperedge HE-5 (induced by source paper "on list decoding of insertion and deletion errors"):
  with members:
    - "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"
    - "on the list decodability of insertions and deletions"
    - "synchronization strings list decoding for insertions and deletions"
    - "list decoding of insertions and deletions"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-6 (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"
    - "polynomial time decodable codes for the binary deletion channel"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "explicit formulas for the weight enumerators of some classes of deletion correcting codes"):
  with members:
    - "an improved bound on the fraction of correctable deletions"
    - "on an almost universal hash function family with applications to authentication and secrecy codes"
    - "new multiple insertion deletion correcting codes for non binary alphabets"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-8 (induced by source paper "tutorial on algebraic deletion correction codes"):
  with members:
    - "capacity upper bounds for deletion type channels"
    - "codes correcting two deletions"
    - "efficient systematic encoding of non binary vt codes"
    - "efficient low redundancy codes for correcting multiple deletions"

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)