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 construction for constant composition codes"
  Abstract: By employing the residue polynomials, we give a construction of constant-composition codes. This construction generalizes the one proposed by Xing (2002). It turns out that when d=3 this construction gives a lower bound of constant-composition codes improving the one by Luo (2003) for some case. Moreover, for d > 3, we give a lower bound on maximal size of constant-composition codes. In particular, our bound for d=5 gives the best possible size of constant-composition codes up to magnitude.

Connected through hyperedge HE-1 (induced by source paper "optimal linear codes constant weight codes and constant composition codes over bbb f_ q"):
  with members:
    - "several classes of cyclic codes with either optimal three weights or a few weights"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "evaluation of the hamming weights of a class of linear codes based on gauss sums"
    - "a class of three weight cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "quaternary constant composition codes with weight four and distances five or six"):
  with members:
    - "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"
    - "improved lower bounds for constant gc content dna codes"
    - "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)