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: "duals of affine grassmann codes and their relatives"
  Abstract: Affine Grassmann codes are a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. These codes were introduced in a recent work by Beelen Here, we consider, more generally, affine Grassmann codes of a given level. We explicitly determine the dual of an affine Grassmann code of any level and compute its minimum distance. Further, we ameliorate the results by Beelen concerning the automorphism group of affine Grassmann codes. Finally, we prove that affine Grassmann codes and their duals have the property that they are linear codes generated by their minimum-weight codewords. This provides a clean analogue of a corresponding result for generalized Reed-Muller codes.

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"
    - "weight spectrum of codes associated with the grassmannian g 3 7"
    - "affine grassmann codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-2 (induced by source paper "minimum distance and the minimum weight codewords of schubert codes"):
  with members:
    - "automorphism groups of grassmann codes"

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"
    - "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-4 (induced by source paper "higher weights of affine grassmann codes and their duals"):
  with members:
    - "automorphism groups of grassmann codes"
    - "affine grassmann codes"

Connected through hyperedge HE-5 (induced by source paper "automorphism groups of grassmann codes"):
  with members:
    - "affine grassmann codes"

Connected through hyperedge HE-6 (induced by source paper "weight spectrum of codes associated with the grassmannian g 3 7"):
  with members:
    - "affine 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)