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 bounded weight codes"
  Abstract: The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a non-asymptotic improvement of the second Johnson bound and are tight for certain values of the parameters.

Connected through hyperedge HE-1 (induced by source paper "semidefinite programming bounds for error correcting codes"):
  with members:
    - "bounds for projective codes from semidefinite programming"
    - "bounds for binary codes relative to pseudo distances of k points"
    - "semidefinite programming harmonic analysis and coding theory"

Connected through hyperedge HE-2 (induced by source paper "bounds on the size and asymptotic rate of subblock constrained codes"):
  with members:
    - "new bounds and constructions for multiply constant weight codes"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "multiply constant weight codes and the reliability of loop physically unclonable functions"
    - "generalized sphere packing bound"
    - "constructions of optimal and near optimal multiply constant weight codes"

Connected through hyperedge HE-3 (induced by source paper "skip sliding window codes"):
  with members:
    - "energy harvesting wireless communications a review of recent advances"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "constrained codes for joint energy and information transfer"

Connected through hyperedge HE-4 (induced by source paper "estimates on the size of symbol weight codes"):
  with members:
    - "coded modulation for power line communications"
    - "linear size optimal q ary constant weight codes and constant composition codes"
    - "group divisible codes and their application in the construction of optimal constant composition codes of weight three"

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)