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 "enumerative coding for line polar grassmannians"):
  Abstract: Codes arising from Grassmannians have been widely investigated, both as generalization of Reed--Muller codes and for applications to network coding. Recently we introduced some new codes, arising from Polar Grassmannians, namely the set of all subspaces of a vector space ${\mathbb F}_q^{2n+1}$ which are totally singular with respect to a given non-degenerate quadratic form. The aim of the present paper is to present an efficient enumerative coding and decoding strategy for line polar Grassmann codes.

Includes members:
  Member "minimum distance of symplectic grassmann codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enumerative coding for line polar grassmannians with applications to codes")
  Member "automorphism groups of grassmann codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "point line incidence on grassmannians and majority logic decoding of grassmann codes")
  Member "weight spectrum of codes associated with the grassmannian g 3 7":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "point line incidence on grassmannians and majority logic decoding of grassmann codes")
  Member "enumerative coding for grassmannian space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the lattice structure of linear subspace codes")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")

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)