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: "bounds on ordered codes and orthogonal arrays"
  Abstract: We derive new estimates of the size of codes and orthogonal arrays in the ordered Hamming space (the Niederreiter-Rosenbloom-Tsfasman space). We also show that the eigenvalues of the ordered Hamming scheme, the association scheme that describes the combinatorics of the space, are given by the multivariable Krawtchouk polynomials, and establish some of their properties.

Connected through hyperedge HE-1 (induced by source paper "polynomial invariant theory and shape enumerator of self dual codes in the nrt metric"):
  with members:
    - "a standard form for generator matrices with respect to the niederreiter rosenbloom tsfasman metric"
    - "algebraic independence and blackbox identity testing"

Connected through hyperedge HE-2 (induced by source paper "linear codes on posets with extension property"):
  with members:
    - "the packing radius of a code and partitioning problems the case for poset metrics"
    - "classification of poset block spaces admitting macwilliams type identity"
    - "a standard form for generator matrices with respect to the niederreiter rosenbloom tsfasman metric"

Connected through hyperedge HE-3 (induced by source paper "bounds for complexity of syndrome decoding for poset metrics"):
  with members:
    - "the packing radius of a code and partitioning problems the case for poset metrics"
    - "a standard form for generator matrices with respect to the niederreiter rosenbloom tsfasman metric"

Connected through hyperedge HE-4 (induced by source paper "polar codes for q ary channels q 2 r"):
  with members:
    - "multilevel polarization of polar codes over arbitrary discrete memoryless channels"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "mutual information matroids and extremal dependencies"
    - "polar codes for the m user mac"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-5 (induced by source paper "coding in the presence of semantic value of information unequal error protection using poset decoders"):
  with members:
    - "classification of poset block spaces admitting macwilliams type identity"
    - "unequal error protection an information theoretic perspective"

Connected through hyperedge HE-6 (induced by source paper "applications of semidefinite programming to coding theory"):
  with members:
    - "bounds for binary codes relative to pseudo distances of k points"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-7 (induced by source paper "near mds poset codes and distributions"):
  with members:
    - "on the existence of universally decodable matrices"

Connected through hyperedge HE-8 (induced by source paper "semidefinite programming harmonic analysis and coding theory"):
  with members:
    - "linear programming bounds for unitary space time codes"

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)