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 "rate matching for polar codes based on binary domination"):
  Abstract: In this paper, we investigate the fundamentals of puncturing and shortening for polar codes, based on binary domination which plays a key role in polar code construction. We first prove that the orders of encoder input bits to be made incapable (by puncturing) or to be shortened are governed by binary domination. In particular, we show that binary domination completely determines incapable or shortened bit patterns for polar codes, and that all the possible incapable or shortened bit patterns can be identified. We then present the patterns of the corresponding encoder output bits to be punctured or fixed, when the incapable or shortened bits are given. We also demonstrate that the order and the pattern of puncturing and shortening for polar codes can be aligned. In the previous work on the rate matching for polar codes, puncturing of encoder output bits begins from a low-indexed bit, while shortening starts from a high-indexed bit. Unlike such a conventional approach, we show that encoder output bits can be punctured from high-indexed bits, while keeping the incapable bit pattern exactly the same. This makes it possible to design a unified circular-buffer rate matching (CB-RM) scheme that includes puncturing, shortening, and repetition.

Includes members:
  Member "circular buffer rate matched polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "design of polar codes in 5g new radio")
  Member "on puncturing strategies for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "design of polar codes in 5g new radio")
  Member "low complexity puncturing and shortening of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "algebraic properties of polar codes from a new polynomial formalism":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar decreasing monomial cartesian codes")
  Member "flexible and low complexity encoding and decoding of systematic polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "capacity achieving rate compatible polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a new coding paradigm for the primitive relay channel")
  Member "polar codes with dynamic frozen symbols and their decoding by directed search":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "on the construction and decoding of concatenated polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar like codes and asymptotic tradeoff among block length code rate and error probability")

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)