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 "point line incidence on grassmannians and majority logic decoding of grassmann codes"):
  Abstract: In this article, we consider the decoding problem of Grassmann codes using majority logic. We show that for two points of the Grassmannian, there exists a canonical path between these points once a complete flag is fixed. These paths are used to construct a large set of parity checks orthogonal on a coordinate of the code, resulting in a majority decoding algorithm.

Includes members:
  Member "automorphism groups of grassmann codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "majority logic decoding for certain schubert codes using lines in schubert varieties")
  Member "weight spectrum of codes associated with the grassmannian g 3 7":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "majority logic decoding for certain schubert codes using lines in schubert varieties")
  Member "duals of affine grassmann codes and their relatives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimum distance and the minimum weight codewords of schubert codes")
  Member "affine grassmann codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "higher weights of affine grassmann codes and their duals")
  Member "on metrics for error correction in network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "majority logic decoding for certain schubert codes using lines in schubert varieties")

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)