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 "partially symmetric monomial codes"):
  Abstract: A framework of monomial codes is considered, which includes linear codes generated by the evaluation of certain monomials. Polar and Reed-Muller codes are the two best-known representatives of such codes, which can be considered as two extreme cases from a certain point of view. #R##N#We introduce a new family of codes, partially symmetric codes. Partially symmetric monomial codes have a smaller group of automorphisms than RM codes and are in some sense "between" Reed-Muller and polar codes. A lower bound on their parameters is introduced along with the explicit construction which achieves it. Structural properties of these codes are demonstrated and it is shown that in some cases partially monomial codes also have a recursive structure.

Includes members:
  Member "permutation decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scan list decoding of polar codes")
  Member "recursive projection aggregation decoding of reed muller codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reed muller codes theory and algorithms")
  Member "a new permutation decoding method for reed muller codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "perm2vec graph permutation selection for decoding of error correction codes using self attention")
  Member "soft decision decoding of reed muller codes recursive lists":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "polar decreasing monomial cartesian codes")
  Member "reed muller codes achieve capacity on erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reed muller codes polarize")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "performance of polar codes for channel and source coding":
    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)