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: "list decoding of deletions using guess check codes"
  Abstract: Guess & Check (GC) codes are systematic binary codes that can correct multiple deletions, with high probability. GC codes have logarithmic redundancy in the length of the codeword $n$. The encoding and decoding algorithms of these codes are deterministic and run in polynomial time for a constant number of deletions $\delta$. The unique decoding properties of GC codes were examined in a previous work by the authors. In this paper, we investigate the list decoding performance of GC codes. Namely, we study the average size and the maximum size of the list obtained by a GC decoder for a constant number of deletions $\delta$. The theoretical results show that: (i) the average size of the list approaches $1$ as $n$ grows; and (ii) there exists an infinite sequence of GC codes whose maximum list size in upper bounded by a constant that is independent of $n$. We also provide numerical simulations on the list decoding performance of GC codes for multiple values of $n$ and $\delta$.

Connected through hyperedge HE-1 (induced by source paper "multilayer codes for synchronization from deletions and insertions"):
  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"
    - "list decoding of insertions and deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "edit distance sketching streaming and document exchange"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "synchronization from deletions through interactive communication"

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)