human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on sub packetization of capacity achieving pir schemes for mds coded databases"
  Abstract: Consider the problem of private information retrieval (PIR) over a distributed storage system where $M$ records are stored across $N$ servers by using an $[N,K]$ MDS code. For simplicity, this problem is usually referred as the coded-PIR problem. The capacity of coded-PIR with privacy against any individual server was determined by Banawan and Ulukus in 2016, i.e., $\mathcal{C}_{\tiny C-PIR}=(1+\frac{K}{N}+\dots+\frac{K^{M-1}}{N^{M-1}})^{-1}$. They also presented a linear capacity-achieving scheme with sub-packetization $KN^{M}$. In this paper we focus on minimizing the sub-packetization for linear capacity-achieving coded-PIR schemes. We prove that the sub-packetization for all linear capacity-achieving coded-PIR schemes in the nontrivial cases (i.e. $N>K\geq 1$ and $M>1$) must be no less than $Kn^{M-1}$, where $n=N/{\rm gcd}(N,K)$. Moreover, we design a linear capacity-achieving coded-PIR scheme with sub-packetization $Kn^{M-1}$ for all $N>K\geq 1$ and $M>1$. Therefore, $Kn^{M-1}$ is the optimal sub-packetization for linear capacity-achieving coded-PIR schemes.

Connected through hyperedge HE-1 (induced by source paper "capacity of private linear computation for coded databases"):
  with members:
    - "achievable rate of private function retrieval from mds coded databases"
    - "asymmetry helps improved private information retrieval protocols for distributed storage"
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "on the fundamental limit of private information retrieval for coded distributed storage"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the asymptotic capacity of private search"
    - "private computation of systematically encoded data with colluding servers"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"

Connected through hyperedge HE-2 (induced by source paper "on the access complexity of pir schemes"):
  with members:
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private information retrieval from transversal designs"
    - "pir schemes with small download complexity and low storage requirements"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "optimal download cost of private information retrieval for arbitrary message length"
    - "private information retrieval for coded storage"

Question: Please tell me which class the center node 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)