human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "an overview of capacity results for synchronization channels"):
  Abstract: Synchronization channels, such as the well-known deletion channel, are surprisingly harder to analyze than memoryless channels, and they are a source of many fundamental problems in information theory and theoretical computer science. #R##N#One of the most basic open problems regarding synchronization channels is the derivation of an exact expression for their capacity. Unfortunately, most of the classic information-theoretic techniques at our disposal fail spectacularly when applied to synchronization channels. Therefore, new approaches must be considered to tackle this problem. This survey gives an account of the great effort made over the past few decades to better understand the (broadly defined) capacity of synchronization channels, including both the main results and the novel techniques underlying them. Besides the usual notion of channel capacity, we also discuss the zero-error capacity of synchronization channels.

Includes members:
  Member "coding for deletion channels with multiple traces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the error probability of maximum likelihood decoding over two deletion channels")
  Member "coded trace reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "coded trace reconstruction in a constant number of traces":
    also connected through other hyperedges:
      (none)
  Member "optimally resilient codes for list decoding from insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covering codes for insertions and deletions")
  Member "zero error capacity of duplication channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "variable length coding for zero error channel capacity")
  Member "approximating edit distance within constant factor in truly sub quadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "maximum likelihood upper bounds on the capacities of discrete information stable channels":
    also connected through other hyperedges:
      (none)
  Member "sharp analytical capacity upper bounds for sticky and related channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "zero error capacity of duplication channels")

Question: Please tell me which class the source paper 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)