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 codes for broadcast channels with receiver message side information and noncausal state available at the encoder"):
  Abstract: In this paper polar codes are proposed for two receiver broadcast channels with receiver message side information (BCSI) and noncausal state available at the encoder, referred to as BCSI with noncausal state for short, where the two receivers know a priori the private messages intended for each other. This channel generalizes BCSI with common message and Gelfand-Pinsker problem and has applications in cellular communication systems. We establish an achievable rate region for BCSI with noncausal state and show that it is strictly larger than the straightforward extension of the Gelfand-Pinsker result. To achieve the established rate region with polar coding, we present polar codes for the general Gelfand-Pinsker problem, which adopts chaining construction and utilizes causal information to pre-transmit the frozen bits. It is also shown that causal information is necessary to pre-transmit the frozen bits. Based on the result of Gelfand-Pinsker problem, we use the chaining construction method to design polar codes for BCSI with noncausal state. The difficulty is that there are multiple chains sharing common information bit indices. To avoid value assignment conflicts, a nontrivial polarization alignment scheme is presented. It is shown that the proposed rate region is tight for degraded BCSI with noncausal state.

Includes members:
  Member "achieving the uniform rate region of general multiple access channels by polar coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "channel coding at low capacity")
  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 "asymmetric error correction and flash memory rewriting using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a new coding paradigm for the primitive relay channel")
  Member "polar coding for interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "general strong polarization")
  Member "achieving the uniform rate region of multiple access channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "achieving the uniform rate region of general multiple access channels by polar coding")
  Member "polar codes for the two user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "achieving the capacity of any dmc using only polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes simplicity random codes durability")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

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)