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: "a new construction for constant weight codes"
  Abstract: A new construction for constant weight codes is presented. The codes are constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These subspaces form a constant dimension code in the Grassmannian space $\cG_q(n,k)$. Some of the constructed codes are optimal constant weight codes with parameters not known before. An efficient algorithm for error-correction is given for the constructed codes. If the constant dimension code has an efficient encoding and decoding algorithms then also the constructed constant weight code has an efficient encoding and decoding algorithms.

Connected through hyperedge HE-1 (induced by source paper "construction of q ary constant weight sequences using a knuth like approach"):
  with members:
    - "constructions for q ary constant weight codes"

Connected through hyperedge HE-2 (induced by source paper "deterministic construction of rip matrices in compressed sensing from constant weight codes"):
  with members:
    - "on block coherence of frames"
    - "construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property"
    - "robust principal component analysis"
    - "constructions for q ary constant weight codes"

Connected through hyperedge HE-3 (induced by source paper "new explicit binary constant weight codes from reed solomon codes"):
  with members:
    - "new constant weight codes from propagation rules"

Connected through hyperedge HE-4 (induced by source paper "codes on lattices for random saf routing"):
  with members:
    - "network coding with modular lattices"
    - "a matroid framework for noncoherent random network communications"

Connected through hyperedge HE-5 (induced by source paper "construction of codes for network coding"):
  with members:
    - "spread codes and spread decoding in network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"
    - "coding for errors and erasures in random network coding"

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)