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 "asynchronous batch and pir codes from hypergraphs"):
  Abstract: We propose a new model of asynchronous batch codes that allow for parallel recovery of information symbols from a coded database in an asynchronous manner, i.e. when different queries take different time to process. Then, we show that the graph-based batch codes studied in Rawat et al., IEEE Trans. on Inform. Theory, Apr. 2016, are asynchronous. Further, we demonstrate that hypergraphs of Berge girth at least 4, respectively at least 3, yield graph-based asynchronous batch codes, respectively private information retrieval (PIR) codes. We prove the hypergraph-theoretic proposition that the maximum number of hyperedges in a hypergraph of a fixed Berge girth equals the quantity in a certain generalization of the hypergraph-theoretic (6,3)-problem, first posed by Brown, Erd\H os and S\'os. We then apply the constructions and bounds by Erd\H os, Frankl and R\"odl about this generalization of the (6,3)-problem, known as the (3$r$-3,$r$)-problem, to obtain batch code constructions and bounds on the redundancy of the graph-based asynchronous batch and PIR codes. Finally, we show that the optimal redundancy $\rho(k)$ of graph-based asynchronous batch codes of dimension $k$ with the query size $t=3$ is $2\sqrt{k}$. Moreover, for a general fixed value of $t \ge 4$, $\rho(k) = O\left({k}^{1/(2-\epsilon)}\right)$ for any small $\epsilon>0$. For a general value of $t \ge 4$, $\lim_{k \rightarrow \infty} \rho(k)/\sqrt{k} = \infty$.

Includes members:
  Member "lower bound on the redundancy of pir codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pir codes with short block length")
  Member "pir array codes with optimal pir rate":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "array codes for functional pir and batch codes")
  Member "pir with low storage overhead coding instead of replication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "bounds for batch codes with restricted query size":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "array codes for functional pir and batch codes")
  Member "linear batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "a survey on network codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")

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)