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 "constructions of transitive latin hypercubes"):
  Abstract: A function f : { 0 , ? , q - 1 } n ? { 0 , ? , q - 1 } invertible in each argument is called a latin hypercube. A collection ( π 0 , π 1 , ? , π n ) of permutations of { 0 , ? , q - 1 } is called an autotopism of a latin hypercube f if π 0 f ( x 1 , ? , x n ) = f ( π 1 x 1 , ? , π n x n ) for all x 1 , ? , x n . We call a latin hypercube isotopically transitive (topolinear) if its group of autotopisms acts transitively (regularly) on all q n collections of argument values. We prove that the number of nonequivalent topolinear latin hypercubes grows exponentially with respect to n if q is even and exponentially with respect to n 2 if q is divisible by a square. We show a connection of the class of isotopically transitive latin squares with the class of G-loops, known in noncommutative algebra, and establish the existence of a topolinear latin square that is not a group isotope. We characterize the class of isotopically transitive latin hypercubes of orders q = 4 and q = 5 .

Includes members:
  Member "on the classification of mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new mds self dual codes from generalized reed solomon codes")
  Member "propelinear 1 perfect codes from quadratic functions":
    also connected through other hyperedges:
      (none)

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)