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 "squares of matrix product codes"):
  Abstract: Abstract   The component-wise or Schur product    C  ⁎    C    ′      of two linear error-correcting codes C and      C    ′      over certain finite field is the linear code spanned by all component-wise products of a codeword in C with a codeword in      C    ′     . When    C  =    C    ′     , we call the product the square of C and denote it      C    ⁎  2     . Motivated by several applications of squares of linear codes in the area of cryptography, in this paper we study squares of so-called matrix-product codes, a general construction that allows to obtain new longer codes from several “constituent” codes. We show that in many cases we can relate the square of a matrix-product code to the squares and products of their constituent codes, which allow us to give bounds or even determine its minimum distance. We consider the well-known    (  u  ,  u  +  v  )   -construction, or Plotkin sum (which is a special case of a matrix-product code) and determine which parameters we can obtain when the constituent codes are certain cyclic codes. In addition, we use the same techniques to study the squares of other matrix-product codes, for example when the defining matrix is Vandermonde (where the minimum distance is in a certain sense maximal with respect to matrix-product codes).

Includes members:
  Member "on squares of cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymmetric entanglement assisted quantum error correcting codes and bch codes")
  Member "private information retrieval from coded databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "critical pairs for the product singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on squares of cyclic codes")
  Member "squares of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "high dimensional affine codes whose square has a designed minimum distance")
  Member "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "encryption scheme based on expanded reed solomon codes")
  Member "polynomial time attack on wild mceliece over quadratic extensions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "encryption scheme based on expanded reed solomon codes")
  Member "an upper bound of singleton type for componentwise products of linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on squares of cyclic codes")
  Member "on products and powers of linear codes under componentwise multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on squares of cyclic 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)