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: "efficiently decodable insertion deletion codes for high noise and high rate regimes"
  Abstract: This work constructs codes that are efficiently decodable from a constant fraction of \emph{worst-case} insertion and deletion errors in three parameter settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant rate for error fraction approaching 1 over fixed alphabet size; and (iii) Constant rate codes over an alphabet of size $k$ for error fraction approaching $(k-1)/(k+1)$. When errors are constrained to deletions alone, efficiently decodable codes in each of these regimes were constructed recently. We complete the picture by constructing similar codes that are efficiently decodable in the insertion/deletion regime.

Connected through hyperedge HE-1 (induced by source paper "locally decodable codes with randomized encoding"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "block edit errors with transpositions deterministic document exchange protocols and almost optimal binary codes"
    - "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"
    - "an improved bound on the fraction of correctable deletions"

Connected through hyperedge HE-2 (induced by source paper "optimally resilient codes for list decoding from insertions and deletions"):
  with members:
    - "list decoding of insertion and deletion codes"
    - "explicit constructions of two dimensional reed solomon codes in high insertion and deletion noise regime"
    - "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"
    - "on the list decodability of insertions and deletions"
    - "general strong polarization"
    - "synchronization strings list decoding for insertions and deletions"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "optimal document exchange and new codes for insertions and deletions"

Connected through hyperedge HE-3 (induced by source paper "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"):
  with members:
    - "approximating edit distance within constant factor in truly sub quadratic time"
    - "multivariate fine grained complexity of longest common subsequence"
    - "approximating edit distance in truly subquadratic time quantum and mapreduce"
    - "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"

Connected through hyperedge HE-4 (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"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-5 (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"
    - "coding against deletions in oblivious and online models"
    - "codes correcting a burst of deletions or insertions"

Connected through hyperedge HE-6 (induced by source paper "explicit constructions of two dimensional reed solomon codes in high insertion and deletion noise regime"):
  with members:
    - "on list decoding of insertion and deletion errors"
    - "on the list decodability of insertions and deletions"
    - "synchronization strings list decoding for insertions and deletions"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "optimal rate list decoding via derivative codes"
    - "maximum likelihood decoding of reed solomon codes is np hard"

Connected through hyperedge HE-7 (induced by source paper "block edit errors with transpositions deterministic document exchange protocols and almost optimal binary codes"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "optimal document exchange and new codes 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"
    - "edit distance sketching streaming and document exchange"

Connected through hyperedge HE-8 (induced by source paper "optimal document exchange and new codes for insertions and deletions"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "edit distance sketching streaming and document exchange"
    - "an improved bound on the fraction of correctable deletions"
    - "efficient deterministic single round document exchange for edit distance"

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)