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 "polar coding for achieving the capacity of marginal channels in nonbinary input setting"):
  Abstract: Achieving information-theoretic security using explicit coding scheme in which unlimited computational power for eavesdropper is assumed, is one of the main topics is security consideration. It is shown that polar codes are capacity achieving codes and have a low complexity in encoding and decoding. It has been proven that polar codes reach to secrecy capacity in the binary-input wiretap channels in symmetric settings for which the wiretapper's channel is degraded with respect to the main channel. The first task of this paper is to propose a coding scheme to achieve secrecy capacity in asymmetric nonbinary-input channels while keeping reliability and security conditions satisfied. Our assumption is that the wiretap channel is stochastically degraded with respect to the main channel and message distribution is unspecified. The main idea is to send information set over good channels for Bob and bad channels for Eve and send random symbols for channels that are good for both. In this scheme the frozen vector is defined over all possible choices using polar codes ensemble concept. We proved that there exists a frozen vector for which the coding scheme satisfies reliability and security conditions. It is further shown that uniform distribution of the message is the necessary condition for achieving secrecy capacity.

Includes members:
  Member "soft decision decoding of reed muller codes recursive lists":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "nested polar codes for wiretap and relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sign bit shaping using polar codes")
  Member "strong secrecy for erasure wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the construction of polar codes for achieving the capacity of marginal channels")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reed muller codes theory and algorithms")
  Member "performance of polar codes for channel and source coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "polarization for arbitrary discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "invertible extractors and wiretap protocols":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "leakage resilient non malleable secret sharing in non compartmentalized models")

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)