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 "on the automorphism groups of binary linear codes"):
  Abstract: Let C be a binary linear code and suppose that its automorphism group contains a non trivial subgroup G. What can we say about C knowing G? In this paper we collect some answers to this question in the cases G=C_p, G=C_2p and G=D_2p (p an odd prime), with a particular regard to the case in which C is self-dual. Furthermore we generalize some methods used in other papers on this subject. Finally we give a short survey on the problem of determining the automorphism group of a putative self-dual [72,36,16] code, in order to show where these methods can be applied.

Includes members:
  Member "the automorphism group of a self dual 72 36 16 code is not an elementary abelian group of order 8":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some new results on the self dual 120 60 24 code")
  Member "the automorphism group of a self dual 72 36 16 binary code does not contain elements of order 6":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "some new results on the self dual 120 60 24 code")
  Member "an extremal 72 36 16 binary code has no automorphism group containing z2xz4 q_8 or z_ 10":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the automorphism group of a self dual 72 36 16 code is not an elementary abelian group of order 8")

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)