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 "polynomial complexity of polar codes for non binary alphabets key agreement and slepian wolf coding"):
  Abstract: We consider polar codes for memoryless sources with side information and show that the blocklength, construction, encoding and decoding complexities are bounded by a polynomial of the reciprocal of the gap between the compression rate and the conditional entropy. This extends the recent results of Guruswami and Xia to a slightly more general setting, which in turn can be applied to (1) sources with non-binary alphabets, (2) key generation for discrete and Gaussian sources, and (3) Slepian-Wolf coding and multiple accessing. In each of these cases, the complexity scaling with respect to the number of users is also controlled. In particular, we construct coding schemes for these multi-user information theory problems which achieve optimal rates with an overall polynomial complexity.

Includes members:
  Member "key capacity with limited one way communication for product sources":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "accuracy memory tradeoffs and phase transitions in belief propagation")
  Member "polar coding for secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar codes for the two user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes simplicity random codes durability")
  Member "on the construction of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "how to construct polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "polar coding for secure transmission and key agreement":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes for broadcast channels")
  Member "an entropy inequality for q ary random variables and its application to channel polarization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the finite length scaling of ternary polar codes")
  Member "polar codes for the m user mac":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "entropic matroids and their representation")

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)