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: "automorphism groups of grassmann codes"
  Abstract: Abstract   We use a theorem of Chow (1949) on line-preserving bijections of Grassmannians to determine the automorphism group of Grassmann codes. Further, we analyze the automorphisms of the big cell of a Grassmannian and then use it to settle an open question of Beelen et al. (2010) concerning the permutation automorphism groups of affine Grassmann codes. Finally, we prove an analogue of Chowʼs theorem for the case of Schubert divisors in Grassmannians and then use it to determine the automorphism group of linear codes associated to such Schubert divisors. In the course of this work, we also give an alternative short proof of MacWilliams theorem concerning the equivalence of linear codes and a characterization of maximal linear subspaces of Schubert divisors in Grassmannians.

Connected through hyperedge HE-1 (induced by source paper "point line incidence on grassmannians and majority logic decoding of grassmann codes"):
  with members:
    - "weight spectrum of codes associated with the grassmannian g 3 7"
    - "duals of affine grassmann codes and their relatives"
    - "affine grassmann codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-2 (induced by source paper "majority logic decoding for certain schubert codes using lines in schubert varieties"):
  with members:
    - "weight spectrum of codes associated with the grassmannian g 3 7"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-3 (induced by source paper "minimum distance and the minimum weight codewords of schubert codes"):
  with members:
    - "duals of affine grassmann codes and their relatives"

Connected through hyperedge HE-4 (induced by source paper "enumerative coding for line polar grassmannians with applications to codes"):
  with members:
    - "minimum distance of symplectic grassmann codes"
    - "weight spectrum of codes associated with the grassmannian g 3 7"
    - "duals of affine grassmann codes and their relatives"
    - "enumerative coding for grassmannian space"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-5 (induced by source paper "higher weights of affine grassmann codes and their duals"):
  with members:
    - "duals of affine grassmann codes and their relatives"
    - "affine grassmann codes"

Connected through hyperedge HE-6 (induced by source paper "enumerative coding for line polar grassmannians"):
  with members:
    - "minimum distance of symplectic grassmann codes"
    - "weight spectrum of codes associated with the grassmannian g 3 7"
    - "enumerative coding for grassmannian space"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-7 (induced by source paper "an asymptotic formula in q for the number of n k q ary mds codes"):
  with members:
    - "weight spectrum of codes associated with the grassmannian g 3 7"

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)