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 "channel coding at low capacity"):
  Abstract: Low-capacity scenarios have become increasingly important in the technology of Internet of Things (IoT) and next generation of mobile networks. Such scenarios require efficient, reliable transmission of information over channels with extremely small capacity. Within these constraints, the performance of state-of-the-art coding techniques is far from optimal in terms of either rate or complexity. Moreover, the current non-asymptotic laws of optimal channel coding provide inaccurate predictions for coding in the low-capacity regime. In this paper, we provide the first comprehensive study of channel coding in the low-capacity regime. We will investigate the fundamental non-asymptotic limits for channel coding as well as challenges that must be overcome for efficient code design in low-capacity scenarios.

Includes members:
  Member "polar codes with a stepped boundary":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast polarization for processes with memory")
  Member "recursive list decoding for reed muller codes":
    also connected through other hyperedges:
      (none)
  Member "beta beta bounds finite blocklength analog of the golden formula":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "second order and moderate deviation analysis of a block fading channel with deterministic and energy harvesting power constraints")
  Member "relaxed polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes simplicity random codes durability")
  Member "achieving the uniform rate region of general multiple access channels by polar coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "binary linear codes with optimal scaling polar codes with large kernels")
  Member "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource allocation for secure multi user downlink miso urllc systems")
  Member "polar codes for broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "asymptotic estimates in information theory with non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite sample analysis of image registration")

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)