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: "infinite families of 2 designs and 3 designs from linear codes"
  Abstract: The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear or nonlinear code is $t=3$. Sporadic $4$-designs and $5$-designs were derived from some linear codes of certain parameters. The major objective of this paper is to construct many infinite families of $2$-designs and $3$-designs from linear codes. The parameters of some known $t$-designs are also derived. In addition, many conjectured infinite families of $2$-designs are also presented.

Connected through hyperedge HE-1 (induced by source paper "an infinite family of linear codes supporting 4 designs"):
  with members:
    - "infinite families of near mds codes holding t designs"
    - "some binary bch codes with length n 2 m 1"
    - "the minimum distance of some narrow sense primitive bch codes"

Connected through hyperedge HE-2 (induced by source paper "the parameters of a family of linear codes"):
  with members:
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-3 (induced by source paper "infinite families of near mds codes holding t designs"):
  with members:
    - "some binary bch codes with length n 2 m 1"
    - "the minimum distance of some narrow sense primitive bch codes"

Connected through hyperedge HE-4 (induced by source paper "combinatorial t designs from quadratic functions"):
  with members:
    - "steiner systems s 2 4 frac 3 m 1 2 and 2 designs from ternary linear codes of length frac 3 m 1 2"
    - "infinite families of 3 designs from apn functions"

Connected through hyperedge HE-5 (induced by source paper "steiner systems s 2 4 frac 3 m 1 2 and 2 designs from ternary linear codes of length frac 3 m 1 2"):
  with members:
    - "an infinite family of steiner systems s 2 4 2 m from cyclic codes"

Connected through hyperedge HE-6 (induced by source paper "codes differentially delta uniform functions and t designs"):
  with members:
    - "on the boomerang uniformity of quadratic permutations over f 2 n"

Connected through hyperedge HE-7 (induced by source paper "infinite families of 3 designs from apn functions"):
  with members:
    - "solving x 2 k 1 x a 0 in mathbb f _ 2 n with gcd n k 1"

Connected through hyperedge HE-8 (induced by source paper "an infinite family of steiner systems s 2 4 2 m from cyclic codes"):
  with members:
    - "another generalization of the reed muller codes"

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)