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 "on list decoding of 5g nr polar codes"):
  Abstract: The 5G standardization process of the 3GPP included polar codes concatenated with distributed cyclic redundancy check (CRC) as a channel coding scheme for downlink control information. Whereas CRC bits allow to improve the performance of successive cancellation list (SCL) decoders by improving distance properties, distributed CRC bits allow for path pruning and decoding early-termination. In this letter, we show how to take advantage of the distributed CRC to improve SCL decoding, proposing various schemes having different early-termination and error correction properties. Simulation results compare the proposed decoding schemes, showing different tradeoffs between error-correction performance and early-termination with different decoder parameters.

Includes members:
  Member "design of polar codes in 5g new radio":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "design and implementation of a polar codes blind detection scheme":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "design of polar codes in 5g new radio")
  Member "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "resource allocation for secure multi user downlink miso urllc systems")
  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")

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)