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: "weight spectrum of codes associated with the grassmannian g 3 7"
  Abstract: In this paper we consider the problem of determining the weight spectrum of q-ary codes C(3,m) associated with Grassmann varieties G(3,m). For m=6 this was done by Nogin. We derive a formula for the weight of a codeword of C(3,m), in terms of certain varieties associated with alternating trilinear forms on (F_q)^m. The classification of such forms under the action of the general linear group GL(m,F_q) is the other component that is required to calculate the spectrum of C(3,m). For m=7, we explicitly determine the varieties mentioned above. The classification problem for alternating 3-forms on (F_q)^7 was solved by Cohen and Helminck, which we then use to determine the spectrum of C(3,7).

Connected through hyperedge HE-1 (induced by source paper "point line incidence on grassmannians and majority logic decoding of grassmann codes"):
  with members:
    - "automorphism groups of grassmann codes"
    - "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:
    - "automorphism groups of grassmann codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-3 (induced by source paper "enumerative coding for line polar grassmannians with applications to codes"):
  with members:
    - "minimum distance of symplectic grassmann codes"
    - "automorphism groups of grassmann codes"
    - "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-4 (induced by source paper "enumerative coding for line polar grassmannians"):
  with members:
    - "minimum distance of symplectic grassmann codes"
    - "automorphism groups of grassmann codes"
    - "enumerative coding for grassmannian space"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-5 (induced by source paper "an asymptotic formula in q for the number of n k q ary mds codes"):
  with members:
    - "automorphism groups of grassmann codes"

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)