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 "sign bit shaping using polar codes"):
  Abstract: A new polar coding scheme for higher order modulation is presented. The proposed scheme is based on multi-level coding (MLC) with natural labeling, where the bit-level corresponding to the sign-bit is generated in dependence on the previous bit-levels, such that the modulated symbols are distributed according to a target non-uniform distribution resulting in a shaping gain. This is realized by replacing the polar encoder in the sign-bit level by a successive cancellation (SC) decoder, such that the overall complexity is not increased compared to a conventional MLC scheme with polar codes. Numerical simulations show significant performance improvements of the proposed approach compared to conventional transmission schemes with uniform symbol distribution. By using more complex decoders (e.g. SC list decoder), the proposed scheme outperforms Gallager's random coding bound.

Includes members:
  Member "probabilistically shaped multi level coding with polar codes for fading channels":
    also connected through other hyperedges:
      (none)
  Member "code constructions for physical unclonable functions and biometric secrecy systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "efficient polar code construction for higher order modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite level quantization procedures for construction and decoding of polar codes")
  Member "polar codes for broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes simplicity random codes durability")
  Member "llr based successive cancellation list decoding 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 achieve the capacity of asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "achievable rates for shaped bit metric decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "achievable information rates for probabilistic amplitude shaping a minimum randomness approach via random sign coding arguments")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)