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 "binary polar codes are optimised codes for bitwise multistage decoding"):
  Abstract: Polar codes are considered the latest major breakthrough in coding theory. Polar codes were introduced by Arikan in 2008. It is shown that the binary polar codes are the same as the optimised codes for bitwise multistage decoding, which have been discovered before by Stolte in 2002. The equivalence between the techniques used for the constructions and decodings of both codes is established.

Includes members:
  Member "recursive constructions and their maximum likelihood decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "circular buffer rate matched polar codes")
  Member "performance limits and practical decoding of interleaved reed solomon polar concatenated codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "threshold secure coding with shared key")
  Member "from polar to reed muller codes a technique to improve the finite length performance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "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 construct polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "polar codes for the m user mac":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "entropic matroids and their representation")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reed muller codes theory and algorithms")

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)