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: "asymptotically good binary linear codes with asymptotically good self intersection spans"
  Abstract: If C is a binary linear code, let C h2i be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging in this family, the C h2i also form an asymptotically good family. For this we use algebraic-geometry codes, concatenation, and a fair amount of bilinear algebra. More precisely, the two main ingredients used in our construction are, first, a description of the symmetric square of an odd degree extension field in terms only of field operations of small degree, and second, a recent result of Garcia-Stichtenoth-Bassa-Beelen on the number of points of curves on such an odd degree extension field.

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"
    - "on products and powers of linear codes under componentwise multiplication"

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"
    - "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"

Connected through hyperedge HE-3 (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"
    - "on products and powers of linear codes under componentwise multiplication"

Connected through hyperedge HE-4 (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"
    - "on products and powers of linear codes under componentwise multiplication"
    - "bilinear complexity of algebras and the chudnovsky chudnovsky interpolation method"

Connected through hyperedge HE-5 (induced by source paper "on products and powers of linear codes under componentwise multiplication"):
  with members:
    - "an upper bound of singleton type for componentwise products of linear codes"
    - "bilinear complexity of algebras and the chudnovsky chudnovsky interpolation method"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"

Connected through hyperedge HE-6 (induced by source paper "an upper bound of singleton type for componentwise products of linear codes"):
  with members:
    - "on products and powers of linear codes under componentwise multiplication"
    - "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)