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 "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes"):
  Abstract: A monomial-Cartesian code is an evaluation code defined by evaluating a set of monomials over a Cartesian product. It is a generalization of some families of codes in the literature, for instance toric codes, affine Cartesian codes and $J$-affine variety codes. In this work we use the vanishing ideal of the Cartesian product to give a description of the dual of a monomial-Cartesian code. Then we use such description of the dual to prove the existence of quantum error correcting codes and MDS quantum error correcting codes. Finally we show that the direct product of monomial-Cartesian codes is a locally recoverable code with $t$-availability if at least $t$ of the components are locally recoverable codes.

Includes members:
  Member "locally recoverable codes with local error detection":
    also connected through other hyperedges:
      (none)
  Member "affine cartesian codes with complementary duals":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "explicit optimal length locally repairable codes of distance 5")
  Member "on the distance of stabilizer quantum codes from j affine variety codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymmetric entanglement assisted quantum error correcting codes and bch codes")
  Member "stabilizer quantum codes from j affine variety codes and a new steane like enlargement":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "locally recoverable j affine variety codes")
  Member "lattice polytopes in coding theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "toric codes multiplicative structure and decoding")
  Member "a family of optimal locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a locality based approach for coded computation")
  Member "on the second hamming weight of some reed muller type codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar decreasing monomial cartesian codes")
  Member "weighted reed muller codes revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar decreasing monomial cartesian 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)