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 "channel polarization through the lens of blackwell measures"):
  Abstract: Each memoryless binary-input channel (BIC) can be uniquely described by its Blackwell measure, which is a probability distribution on the unit interval $[0,1]$ with mean $1/2$. Conversely, any such probability distribution defines a BIC. Viewing each BIC through the lens of its Blackwell measure, this paper provides a unified framework for analyzing the evolution of a variety of channel functionals under Arikan's polar transform. These include the symmetric capacity, Bhattacharyya parameter, moments of information density, Hellinger affinity, Gallager's reliability function, and the Bayesian information gain. An explicit general characterization is derived for the evolution of the Blackwell measure under Arikan's polar transform. The evolution of the Blackwell measure is specified for symmetric BICs based on their decomposition into binary symmetric (sub)-channels (BSCs). As a byproduct, a simple algorithm is designed and simulated for computing the successive polarization of symmetric BICs. It is shown that all channel functionals that can be expressed as an expectation of a convex function with respect to the Blackwell measure of the channel polarize on the class of symmetric BICs. For this broad class, a necessary and sufficient condition is established which determines whether the bounded random process associated to a channel functional is a martingale, submartingale, or supermartingale. This condition is numerically verifiable for all known channel functionals.

Includes members:
  Member "general strong polarization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reed muller codes theory and algorithms")
  Member "polar codes for broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes simplicity random codes durability")
  Member "varentropy decreases under the polar transform":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "guesswork subject to a total entropy budget")
  Member "finite length scaling for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reed muller codes theory and algorithms")
  Member "re proving channel polarization theorems an extremality and robustness analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder")
  Member "polar codes speed of polarization and polynomial gap to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "polar codes for the two user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes simplicity random codes durability")
  Member "on the construction of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar codes and their quantum domain counterparts")

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)