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: "on squares of cyclic codes"
  Abstract: The square    $C^{*2}$    of a linear error correcting code    $C$    is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in    $C$   . Squares of codes have gained attention for several applications mainly in the area of cryptography, and typically in those applications, one is concerned about some of the parameters (dimension and minimum distance) of both    $C^{*2}$    and    $C$   . In this paper, motivated mostly by the study of this problem in the case of linear codes defined over the binary field, squares of cyclic codes are considered. General results on the minimum distance of the squares of cyclic codes are obtained, and constructions of cyclic codes    $C$    with a relatively large dimension of    $C$    and minimum distance of the square    $C^{*2}$    are discussed. In some cases, the constructions lead to codes    $C$    such that both    $C$    and    $C^{*2}$    simultaneously have the largest possible minimum distances for their length and dimensions.

Connected through hyperedge HE-1 (induced by source paper "squares of matrix product codes"):
  with members:
    - "private information retrieval from coded databases with colluding servers"
    - "critical pairs for the product singleton bound"
    - "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 "asymmetric entanglement assisted quantum error correcting codes and bch codes"):
  with members:
    - "entanglement assisted quantum error correcting codes over arbitrary finite fields"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "css like constructions of asymmetric quantum codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"
    - "additive asymmetric quantum codes"

Connected through hyperedge HE-3 (induced by source paper "high dimensional affine codes whose square has a designed minimum distance"):
  with members:
    - "squares of matrix product codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "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"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"

Connected through hyperedge HE-4 (induced by source paper "properties of constacyclic codes under the schur product"):
  with members:
    - "squares of matrix product codes"
    - "recovering short secret keys of rlce in polynomial time"
    - "an efficient structural attack on nist submission dags"
    - "a generalization of quasi twisted codes multi twisted codes"
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "squares of random linear codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

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)