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 class of three weight linear codes and their complete weight enumerators"
  Abstract: Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime p, we propose a class of p-ary linear codes by choosing a proper defining set. Their weight enumerators and complete weight enumerators are presented explicitly. Our results show that they are linear codes with three weights and suitable for the constructions of authentication codes and secret sharing schemes.

Connected through hyperedge HE-1 (induced by source paper "a construction of linear codes and their complete weight enumerators"):
  with members:
    - "complete weight enumerators of a family of three weight linear codes"
    - "complete weight enumerators of some linear codes"
    - "complete weight enumerators of two classes of linear codes"
    - "linear codes from some 2 designs"
    - "a class of three weight and five weight linear codes"
    - "a class of linear codes with three weights"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-2 (induced by source paper "complete weight enumerators of two classes of linear codes"):
  with members:
    - "complete weight enumerators of a family of three weight linear codes"
    - "complete weight enumerators of some linear codes"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of linear codes with three weights"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a class of three weight cyclic codes"
    - "five families of three weight ternary cyclic codes and their duals"

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)