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: "an upper bound of singleton type for componentwise products of linear codes"
  Abstract: We give an upper bound that relates the dimensions of some given number of linear codes, with the minimum distance of their componentwise product. A typical result is as follows: given t linear codes Ci of parameters [n,ki]q with full support, one can find codewords ci ∈ Ci such that 1 ≤ w(c1*⋯*ct) ≤ max(t-1, n+t-(k1+⋯+kt)).

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"
    - "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:
    - "critical pairs for the product singleton bound"
    - "squares of random linear codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "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 "critical pairs for the product singleton bound"):
  with members:
    - "linear independence of rank 1 matrices and the dimension of products of codes"
    - "squares of random linear codes"
    - "on products and powers of linear codes under componentwise multiplication"

Connected through hyperedge HE-4 (induced by source paper "on products and powers of linear codes under componentwise multiplication"):
  with members:
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"
    - "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"

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)