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 "codes differentially delta uniform functions and t designs"):
  Abstract: Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the automorphism groups are two ways for proving that a code has sufficient regularity for supporting $t$-designs. However, some linear codes hold $t$-designs, although they do not satisfy the conditions in the Assmus-Mattson Theorem and do not admit a $t$-transitive or $t$-homogeneous group as a subgroup of their automorphisms. The major objective of this paper is to develop a theory for explaining such codes and obtaining such new codes and hence new $t$-designs. To this end, a general theory for punctured and shortened codes of linear codes supporting $t$-designs is established, a generalized Assmus-Mattson theorem is developed, and a link between $2$-designs and differentially $\delta$-uniform functions and $2$-designs is built. With these general results, binary codes with new parameters and known weight distributions are obtained, new $2$-designs and Steiner system $S(2, 4, 2^n)$ are produced in this paper.

Includes members:
  Member "on the boomerang uniformity of quadratic permutations over f 2 n":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "4 uniform bct permutations from generalized butterfly structure")
  Member "infinite families of 2 designs and 3 designs from linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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)