human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "squares of matrix product codes"):
  with members:
    - "on squares of cyclic codes"
    - "private information retrieval from coded databases with colluding servers"
    - "squares of random linear codes"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "an upper bound of singleton type for componentwise products of linear codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"

Connected through hyperedge HE-2 (induced by source paper "on squares of cyclic codes"):
  with members:
    - "squares of random linear codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "an upper bound of singleton type for componentwise products of linear codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"

Connected through hyperedge HE-3 (induced by source paper "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"):
  with members:
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "the capacity of robust private information retrieval with colluding databases"
    - "the capacity of symmetric private information retrieval"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "symmetric private information retrieval for mds coded distributed storage"

Question: Please tell me which class the center node 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)