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: "multilayer codes for synchronization from deletions"
  Abstract: Consider two remote nodes, each having a binary sequence. The sequence at one node differs from the other by a small number of deletions. The node with the shorter sequence wishes to reconstruct the longer sequence using minimal information from the other node. In this paper, we devise a coding scheme for this one-way synchronization model. The scheme is based on multiple layers of Varshamov-Tenenglots codes combined with off-the-shelf linear error-correcting codes.

Connected through hyperedge HE-1 (induced by source paper "list decoding of deletions using guess check codes"):
  with members:
    - "list decoding of insertions and deletions"
    - "codes correcting two 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-2 (induced by source paper "efficient systematic encoding of non binary vt codes"):
  with members:
    - "coding for segmented edit channels"
    - "guess check codes for deletions and synchronization"
    - "new multiple insertion deletion correcting codes for non binary alphabets"
    - "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)