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 two weight and three weight codes and their applications in secret sharing"
  Abstract: In this paper, a class of two-weight and three-weight linear codes over $\gf(p)$ is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes. These codes have applications also in authentication codes, association schemes, and strongly regular graphs, in addition to their applications in consumer electronics, communication and data storage systems.

Connected through hyperedge HE-1 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes"):
  with members:
    - "a note on the generalized hamming weights of reed muller codes"
    - "a class of cyclotomic linear codes and their generalized hamming weights"
    - "new lower bounds on the generalized hamming weights of ag codes"
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "the weight hierarchy of some reducible cyclic codes"
    - "linear codes from some 2 designs"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "weight hierarchies and weight distributions of two families of p ary linear codes"):
  with members:
    - "two weight and three weight linear codes based on weil sums"
    - "a note on the generalized hamming weights of reed muller codes"
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "the weight hierarchy of some reducible cyclic codes"
    - "linear codes from some 2 designs"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-3 (induced by source paper "weight distributions of six families of 3 weight binary linear codes"):
  with members:
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "linear codes from some 2 designs"

Connected through hyperedge HE-4 (induced by source paper "minimal linear codes constructed from functions"):
  with members:
    - "the parameters of minimal linear codes"
    - "minimal linear codes from characteristic functions"
    - "minimal linear codes over finite fields"
    - "two new families of two weight codes"
    - "complete weight enumerators of a family of three weight linear codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from a generic construction"
    - "linear codes from some 2 designs"

Connected through hyperedge HE-5 (induced by source paper "full characterization of minimal linear codes as cutting blocking sets"):
  with members:
    - "an inductive construction of minimal codes"
    - "minimal linear codes arising from blocking sets"
    - "the parameters of minimal linear codes"
    - "minimal linear codes from characteristic functions"
    - "minimal linear codes over finite fields"
    - "a new class of three weight linear codes from weakly regular plateaued functions"
    - "it is indeed a fundamental construction of all linear codes"
    - "linear codes with two or three weights from weakly regular bent functions"

Connected through hyperedge HE-6 (induced by source paper "two classes of linear codes and their generalized hamming weights"):
  with members:
    - "a note on the generalized hamming weights of reed muller codes"
    - "a class of cyclotomic linear codes and their generalized hamming weights"
    - "the weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes"
    - "on the weight hierarchy of locally repairable codes"
    - "the second generalized hamming weight of some evaluation codes arising from a projective torus"
    - "the weight hierarchy of some reducible cyclic codes"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-7 (induced by source paper "several classes of two weight and three weight linear codes"):
  with members:
    - "two weight and three weight linear codes based on weil sums"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of three weight and five weight linear codes"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of three weight cyclic codes"

Connected through hyperedge HE-8 (induced by source paper "the parameters of minimal linear codes"):
  with members:
    - "two new families of two weight codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from a generic construction"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "towards secure two party computation from the wire tap channel"

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)