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 "sublinear latency for simplified successive cancellation decoding of polar codes"):
  Abstract: In this work we analyze the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. We show that, unlike conventional successive cancellation decoding, whose latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, we show that the latency of SSC decoding is $O(N^{1-1/\mu})$, where $N$ is the block length and $\mu$ is the scaling exponent of the transmission channel, which captures the speed at which the rate tends to capacity. We also provide numerical results demonstrating the tightness of the bound and the fact that asymptotically most of the savings in latency comes from the parallel decoding of the constituent codes comprising the polar code.

Includes members:
  Member "log logarithmic time pruned polar coding":
    also connected through other hyperedges:
      (none)
  Member "polar codes with exponentially small error at finite block length":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "log logarithmic time pruned polar coding")
  Member "polar code moderate deviation recovering the scaling exponent":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "log logarithmic time pruned polar coding")
  Member "partitioned list decoding of polar codes analysis and improvement of finite length performance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design of polar codes in 5g new radio")
  Member "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes simplicity random codes durability")
  Member "fast and flexible successive cancellation list decoders for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "binary linear codes with optimal scaling polar codes with large kernels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "partitioned successive cancellation list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "partially permuted multi trellis belief propagation for polar codes")

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)