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: "constructions for q ary constant weight codes"
  Abstract: This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary constant-weight codes and sets of pairwise disjoint combinatorial designs of various types

Connected through hyperedge HE-1 (induced by source paper "scw codes for maximum likelihood detection in diffusive molecular communications without channel state information"):
  with members:
    - "on the design of matched filters for molecule counting receivers"
    - "diffusive mobile molecular communications over time variant channels"
    - "on the capacity of diffusion based molecular timing channels"
    - "channel estimation for diffusive molecular communications"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "improving receiver performance of diffusive molecular communication with enzymes"

Connected through hyperedge HE-2 (induced by source paper "scw codes for optimal csi free detection in diffusive molecular communications"):
  with members:
    - "diffusive mobile molecular communications over time variant channels"
    - "channel estimation for diffusive molecular communications"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "improving receiver performance of diffusive molecular communication with enzymes"

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

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

Connected through hyperedge HE-5 (induced by source paper "linear size optimal q ary constant weight codes and constant composition codes"):
  with members:
    - "group divisible codes and their application in the construction of optimal constant composition codes of weight three"
    - "improved lower bounds for constant gc content dna codes"
    - "the sizes of optimal q ary codes of weight three and distance four a complete solution"
    - "the pbd closure of constant composition codes"
    - "channel coding the road to channel capacity"

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)