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 "critical pairs for the product singleton bound"):
  Abstract: We characterize product-maximum distance separable (PMDS) pairs of linear codes, i.e., pairs of codes    $C$    and    $D$    whose product under coordinatewise multiplication has maximum possible minimum distance as a function of the code length and the dimensions    $\dim C$    and    $\dim D$   . We prove in particular, for    $C=D$   , that if the square of the code    $C$    has minimum distance at least 2, and    $(C,C)$    is a PMDS pair, then either    $C$    is a generalized Reed–Solomon code, or    $C$    is a direct sum of self-dual codes. In passing we establish coding-theory analogues of classical theorems of additive combinatorics.

Includes members:
  Member "linear independence of rank 1 matrices and the dimension of products of codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomial time attack on wild mceliece over quadratic extensions")
  Member "squares of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "squares of matrix product codes")
  Member "an upper bound of singleton type for componentwise products of linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "squares of matrix product codes")
  Member "on products and powers of linear codes under componentwise multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)