human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (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"):
  Abstract: Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight distribution. We determine the weight distributions of some shortened codes and punctured codes of these three-weight subcodes. These shortened and punctured codes contain some codes that have the same parameters as the best ternary linear codes known in the database maintained by Markus Grassl at this http URL. These three-weight subcodes with a special weight distribution do not satisfy the conditions of the Assmus-Mattson theorem and do not admit $2$-transitive or $2$-homogeneous automorphism groups in general. By employing the theory of projective geometries and projective generalized Reed-Muller codes, we prove that they still hold $2$-designs. We also determine the parameters of these $2$-designs. This paper mainly confirms some recent conjectures of Ding and Li regarding Steiner systems and $2$-designs from a special type of ternary projective codes.

Includes members:
  Member "an infinite family of steiner systems s 2 4 2 m from cyclic codes":
    also connected through other hyperedges:
      (none)
  Member "infinite families of 2 designs and 3 designs from linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an infinite family of linear codes supporting 4 designs")

Question: Please tell me which class the source paper 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)