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 products and powers of linear codes under componentwise multiplication"
  Abstract: In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that could otherwise probably not fit in a regular research paper. On the other hand, more advanced results and applications are only quickly mentioned with references to the literature. We also point out a few open problems. #R##N#Our presentation alternates between two points of view, which the theory intertwines in an essential way: that of combinatorial coding, and that of algebraic geometry. #R##N#In appendices that can be read independently, we investigate topics in multilinear algebra over finite fields, notably we establish a criterion for a symmetric multilinear map to admit a symmetric algorithm, or equivalently, for a symmetric tensor to decompose as a sum of elementary symmetric tensors.

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"
    - "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"
    - "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:
    - "critical pairs for the product singleton bound"
    - "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"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"

Connected through hyperedge HE-3 (induced by source paper "the quadratic hull of a code and the geometric view on multiplication algorithms"):
  with members:
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "bilinear complexity of algebras and the chudnovsky chudnovsky interpolation method"

Connected through hyperedge HE-4 (induced by source paper "properties of constacyclic codes under the schur product"):
  with members:
    - "squares of matrix product codes"
    - "on squares of cyclic 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"

Connected through hyperedge HE-5 (induced by source paper "structural properties of twisted reed solomon codes with applications to cryptography"):
  with members:
    - "twisted reed solomon codes"
    - "fast computation of the roots of polynomials over the ring of power series"
    - "squares of random linear codes"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "key reduction of mceliece s cryptosystem using list decoding"

Connected through hyperedge HE-6 (induced by source paper "algebraic properties of polar codes from a new polynomial formalism"):
  with members:
    - "the fractality of polar and reed muller codes"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "a polynomial time attack against algebraic geometry code based public key cryptosystems"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "squares of random linear codes"):
  with members:
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "connections between construction d and related constructions of lattices"
    - "new identities relating wild goppa codes"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"
    - "bilinear complexity of algebras and the chudnovsky chudnovsky interpolation method"

Connected through hyperedge HE-8 (induced by source paper "linear independence of rank 1 matrices and the dimension of products of codes"):
  with members:
    - "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"
    - "bilinear complexity of algebras and the chudnovsky chudnovsky interpolation method"

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)