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 "high dimensional affine codes whose square has a designed minimum distance"):
  Abstract: Given a linear code $\mathcal{C}$, its square code $\mathcal{C}^{(2)}$ is the span of all component-wise products of two elements of $\mathcal{C}$. Motivated by applications in multi-party computation, our purpose with this work is to answer the following question: which families of affine variety codes have simultaneously high dimension $k(\mathcal{C})$ and high minimum distance of $\mathcal{C}^{(2)}$, $d(\mathcal{C}^{(2)})$? More precisely, given a designed minimum distance $d$ we compute an affine variety code $\mathcal{C}$ such that $d(\mathcal{C}^{(2)})\geq d$ and that the dimension of $\mathcal{C}$ is high. The best construction that we propose comes from hyperbolic codes when $d\ge q$ and from weighted Reed-Muller codes otherwise.

Includes members:
  Member "squares of matrix product codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "properties of constacyclic codes under the schur product")
  Member "on squares of cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "squares of matrix product 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 "squares of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "squares of matrix product codes")
  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 "squares of matrix product codes")
  Member "polynomial time attack on wild mceliece over quadratic extensions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "squares of matrix product codes")
  Member "distinguisher based attacks on public key cryptosystems using reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "encryption scheme based on expanded reed solomon codes")
  Member "asymptotically good binary linear codes with asymptotically good self intersection spans":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "squares of matrix product 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)