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 "coded caching via projective geometry a new low subpacketization scheme"):
  Abstract: Coded Caching is a promising solution to reduce the peak traffic in broadcast networks by prefetching the popular content close to end users and using coded transmissions. One of the chief issues of most coded caching schemes in literature is the issue of large $\textit{subpacketization}$, i.e., they require each file to be divided into a large number of subfiles. In this work, we present a coded caching scheme using line graphs of bipartite graphs in conjunction with projective geometries over finite fields. The presented scheme achieves a rate $\Theta(\frac{K}{\log_q{K}})$ ($K$ being the number of users, $q$ is some prime power) with $\textit{subexponential}$ subpacketization $q^{O((\log_q{K})^2)}$ when cached fraction is upper bounded by a constant ($\frac{M}{N}\leq \frac{1}{q^\alpha}$) for some positive integer $\alpha$). Compared to earlier schemes, the presented scheme has a lower subpacketization (albeit possessing a higher rate). We also present a new subpacketization dependent lower bound on the rate for caching schemes in which each subfile is cached in the same number of users. Compared to the previously known bounds, this bound seems to perform better for a range of parameters of the caching system.

Includes members:
  Member "coded caching via line graphs of bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "placement delivery array design through strong edge coloring of bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "optimal placement delivery arrays with minimum number of rows":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "on the placement delivery array design for centralized coded caching scheme":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "coded caching schemes with reduced subpacketization from linear block codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "on the optimality of uncoded cache placement":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)