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 "a lower bound on the interactive capacity of binary memoryless symmetric channels"):
  Abstract: The interactive capacity of a channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably simulated over the channel. It is shown that the interactive capacity of any binary memoryless symmetric (BMS) channel is at least 0.0302 its Shannon capacity. To that end, a rewind-if-error coding scheme for the simpler binary symmetric channel (BSC) is presented, achieving the lower bound for any crossover probability. The scheme is based on extended-Hamming codes combined with randomized error detection. The bound is then shown to hold for any BMS channel using extremes of the Bhattacharyya parameter. Finally, it is shown that the public randomness required for error detection can be reduced to private randomness in a standard fashion, and can be extracted from the channel without affecting the overall asymptotic rate. This gives rise to a fully deterministic interactive coding scheme achieving our lower bound over any BMS channel.

Includes members:
  Member "interactive channel capacity revisited":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions")
  Member "extremes of error exponents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance bounds of concatenated polar coding schemes")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reed muller codes theory and algorithms")

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)