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 "polar decreasing monomial cartesian codes"):
  Abstract: We prove that families of polar codes with multiple kernels over certain symmetric channels can be viewed as polar decreasing monomial-Cartesian codes, offering a unified treatment for such codes, over any finite field. We define decreasing monomial-Cartesian codes as the evaluation of a set of monomials closed under divisibility over a Cartesian product. Polar decreasing monomial-Cartesian codes are decreasing monomial-Cartesian codes whose sets of monomials are closed respect a partial order inspired by the recent work of Bardet, Dragoi, Otmani, and Tillich ["Algebraic properties of polar codes from a new polynomial formalism," 2016 IEEE International Symposium on Information Theory (ISIT)]. Extending the main theorem of Mori and Tanaka ["Source and Channel Polarization Over Finite Fields and Reed-Solomon Matrices," in IEEE Transactions on Information Theory, vol. 60, no. 5, pp. 2720--2736, May 2014], we prove that any sequence of invertible matrices over an arbitrary field satisfying certain conditions polarizes any symmetric over the field channel. In addition, we prove that the dual of a decreasing monomial-Cartesian code is monomially equivalent to a decreasing monomial-Cartesian code. Defining the minimal generating set for a set of monomials, we use it to describe the length, dimension and minimum distance of a decreasing monomial-Cartesian code.

Includes members:
  Member "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on steane enlargement of quantum codes from cartesian product point sets")
  Member "design of polar codes in 5g new radio":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "multi kernel polar codes proof of polarization and error exponents":
    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 "partially symmetric monomial codes")
  Member "fast 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 "multi kernel construction of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "on the second hamming weight of some reed muller type codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)