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: "squares of random linear codes"
  Abstract: Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code "typically" fill the whole space? We give a positive answer, for codes of dimension $k$ and length roughly $\frac{1}{2}k^2$ or smaller. Moreover, the convergence speed is exponential if the difference $k(k+1)/2-n$ is at least linear in $k$. The proof uses random coding and combinatorial arguments, together with algebraic tools involving the precise computation of the number of quadratic forms of a given rank, and the number of their zeros.

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"
    - "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 "high dimensional affine codes whose square has a designed minimum distance"):
  with members:
    - "squares of matrix product codes"
    - "on squares of cyclic codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "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-3 (induced by source paper "on squares of cyclic codes"):
  with members:
    - "critical pairs for the product singleton bound"
    - "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-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"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-5 (induced by source paper "an efficient structural attack on nist submission dags"):
  with members:
    - "on the security of some compact keys for mceliece scheme"
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "a polynomial time attack on the bbcrs scheme"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "folding alternant and goppa codes with non trivial automorphism groups"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-6 (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"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "key reduction of mceliece s cryptosystem using list decoding"

Connected through hyperedge HE-7 (induced by source paper "recovering short secret keys of rlce in polynomial time"):
  with members:
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "a polynomial time attack on the bbcrs scheme"
    - "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"
    - "enhanced public key security for the mceliece cryptosystem"

Connected through hyperedge HE-8 (induced by source paper "on asymptotically good ramp secret sharing schemes"):
  with members:
    - "new lower bounds on the generalized hamming weights of ag codes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "new asymptotic metrics for relative generalized hamming weight"
    - "strongly secure ramp secret sharing schemes for general access structures"

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)