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 two deletions"
  Abstract: In this work, we investigate the problem of constructing codes capable of correcting two deletions. In particular, we construct a code that requires redundancy approximately 8 log n + O(log log n) bits of redundancy, where n is the length of the code. To the best of the author's knowledge, this represents the best known construction in that it requires the lowest number of redundant bits for a code correcting two deletions.

Connected through hyperedge HE-1 (induced by source paper "optimal k deletion correcting 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"
    - "two deletion correcting codes from indicator vectors"
    - "optimal document exchange and new codes for insertions and deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "deletion codes in the high noise and high rate regimes"

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

Connected through hyperedge HE-3 (induced by source paper "list decoding of deletions using guess check codes"):
  with members:
    - "list decoding of insertions and deletions"
    - "multilayer codes for synchronization from deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "coding against deletions in oblivious and online models"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "deletion codes in the high noise and high rate regimes"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"

Connected through hyperedge HE-4 (induced by source paper "two deletion correcting codes from indicator vectors"):
  with members:
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-5 (induced by source paper "codes for correcting localized deletions"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "guess check codes for deletions insertions and synchronization"
    - "correcting bursty and localized deletions using guess check codes"
    - "codes correcting a burst of deletions or insertions"
    - "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"
    - "efficient file synchronization a distributed source coding approach"

Connected through hyperedge HE-6 (induced by source paper "correcting bursty and localized deletions using guess check codes"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "guess check codes for deletions insertions and synchronization"
    - "polar coding for the binary erasure channel with deletions"
    - "codes correcting a burst of deletions or insertions"
    - "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"
    - "efficient file synchronization a distributed source coding approach"

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)