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 "distance distributions of cyclic orbit codes"):
  Abstract: The distance distribution of a code is the vector whose $i^\text{th}$ entry is the number of pairs of codewords with distance $i$. We investigate the structure of the distance distribution for cyclic orbit codes, which are subspace codes generated by the action of $\mathbb{F}_{q^n}^*$ on an $\mathbb{F}_q$-subspace $U$ of $\mathbb{F}_{q^n}$. We show that for optimal full-length orbit codes the distance distribution depends only on $q,\,n$, and the dimension of $U$. For full-length orbit codes with lower minimum distance, we provide partial results towards a characterization of the distance distribution, especially in the case that any two codewords intersect in a space of dimension at most 2. Finally, we briefly address the distance distribution of a union of optimal full-length orbit codes.

Includes members:
  Member "construction of sidon spaces with applications to coding":
    also connected through other hyperedges:
      (none)
  Member "constructions of cyclic constant dimension codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cliques in projective space and construction of cyclic grassmannian codes")
  Member "construction of subspace codes through linkage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new constructions of subspace codes using subsets of mrd codes in several blocks")
  Member "subspace polynomials and cyclic subspace codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cliques in projective space and construction of cyclic grassmannian codes")
  Member "subspace codes based on graph matchings ferrers diagrams and pending blocks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a hierarchical based greedy algorithm for echelon ferrers construction")
  Member "cyclic orbit codes and stabilizer subfields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cliques in projective space and construction of cyclic grassmannian codes")
  Member "cyclic orbit codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)