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: "polar coding for the binary erasure channel with deletions"
  Abstract: We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a list decoding algorithm with a cyclic redundancy check for this case. The decoding complexity is $O(N^2\log N)$, where $N$ is the blocklength of the code. An important contribution is an optimization of the amount of redundancy added to minimize the overall error probability. Our theoretical results are corroborated by numerical simulations which show that the list size can be reduced to one and the original message can be recovered with high probability as the length of the code grows.

Connected through hyperedge HE-1 (induced by source paper "polar codes for the deletion channel weak and strong polarization"):
  with members:
    - "universal polarization for processes with memory"
    - "capacity upper bounds for deletion type channels"
    - "a simple proof of fast polarization"
    - "fast polarization for processes with memory"
    - "polar coding for processes with memory"
    - "joint successive cancellation decoding of polar codes over intersymbol interference channels"
    - "list decoding of polar codes"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-2 (induced by source paper "correcting bursty and localized deletions using guess check codes"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "codes correcting two deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "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)