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: "how many weights can a linear code have"
  Abstract: We study the combinatorial function L(k, q), the maximum number of nonzero weights a linear code of dimension k over \({\mathbb {F}}_q\) can have. We determine it completely for \(q=2,\) and for \(k=2,\) and provide upper and lower bounds in the general case when both k and q are \(\ge 3.\) A refinement L(n, k, q), as well as nonlinear analogues N(M, q) and N(n, M, q), are also introduced and studied.

Connected through hyperedge HE-1 (induced by source paper "how many weights can a cyclic code have"):
  with members:
    - "maximum weight spectrum codes with reduced length"
    - "a note on full weight spectrum codes"
    - "maximum weight spectrum codes"
    - "two weight codes and second order recurrences"
    - "the weights in mds codes"
    - "hamming weights in irreducible cyclic codes"
    - "weight distributions of hamming codes ii"

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)