human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "semidefinite programming bounds for error correcting codes"):
  Abstract: This chapter is written for the forthcoming book "A Concise Encyclopedia of Coding Theory" (CRC press), edited by W. Cary Huffman, Jon-Lark Kim, and Patrick Sol\'e. This book will collect short but foundational articles, emphasizing definitions, examples, exhaustive references, and basic facts on the model of the Handbook of Finite Fields. The target audience of the Encyclopedia is upper level undergraduates and graduate students.

Includes members:
  Member "bounds for projective codes from semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient interpolation based decoding of interleaved subspace and gabidulin codes")
  Member "bounds for binary codes relative to pseudo distances of k points":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "applications of semidefinite programming to coding theory")
  Member "on bounded weight codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounds on the size and asymptotic rate of subblock constrained codes")
  Member "semidefinite programming harmonic analysis and coding theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on bounded weight codes")

Question: Please tell me which class the source paper 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)