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 "circular shift linear network codes with arbitrary odd block lengths"):
  Abstract: Circular-shift linear network coding (LNC) is a class of vector LNC with low encoding and decoding complexities, and with local encoding kernels chosen from cyclic permutation matrices. When    $L$    is a prime with primitive root 2, it was recently shown that a scalar linear solution over GF(   $2^{L-1}$   ) induces an    $L$   -dimensional circular-shift linear solution at rate    $(L-1)/L$   . In this paper, we prove that for arbitrary odd    $L$   , every scalar linear solution over GF(   $2^{m_{L}}$   ), where    $m_{L}$    refers to the multiplicative order of 2 modulo    $L$   , can induce an    $L$   -dimensional circular-shift linear solution at a certain rate. Based on the generalized connection, we further prove that for such    $L$    with    $m_{L}$    beyond a threshold, every multicast network has an    $L$   -dimensional circular-shift linear solution at rate    $\phi (L)/L$   , where    $\phi (L)$    is the Euler’s totient function of    $L$   . An efficient algorithm for constructing such a solution is designed. Finally, we prove that every multicast network is asymptotically circular-shift linearly solvable.

Includes members:
  Member "circular shift linear network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "delay complexity trade off of random linear network coding in wireless broadcast")
  Member "linear network coding over rings part ii vector codes and non commutative alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "a class of non linearly solvable networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a local perspective on the edge removal problem")
  Member "on the message dimensions of vector linearly solvable networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "on vector linear solvability of multicast networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "vector network coding based on subspace codes outperforms scalar linear network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")

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)