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: "pir array codes with optimal pir rate"
  Abstract: There has been much recent interest in Private information Retrieval (PIR) in models where a database is stored across several servers using coding techniques from distributed storage, rather than being simply replicated. In particular, a recent breakthrough result of Fazelli, Vardy and Yaakobi introduces the notion of a PIR code and a PIR array code, and uses this notion to produce efficient protocols. #R##N#In this paper we are interested in designing PIR array codes. We consider the case when we have $m$ servers, with each server storing a fraction $(1/\omegaR)$ of the bits of the database; here $\omegaR$ is a fixed rational number with $\omegaR > 1$. We study the maximum PIR rate of a PIR array code with the $k$-PIR property (which enables a $k$-server PIR protocol to be emulated on the $m$ servers), where the PIR rate is defined to be $k/m$. We present upper bounds on the achievable rate, some constructions, and ideas how to obtain PIR array codes with the highest possible PIR rate. In particular, we present constructions that asymptotically meet our upper bounds, and the exact largest PIR rate is obtained when $1 < \omegaR \leq 2$.

Connected through hyperedge HE-1 (induced by source paper "array codes for functional pir and batch codes"):
  with members:
    - "bounds on the length of functional pir and batch codes"
    - "construction of parallel random i o codes using coset coding with hamming codes"
    - "nearly optimal constructions of pir and batch codes"
    - "pir array codes with optimal virtual server rate"
    - "on private information retrieval array codes"
    - "pir with low storage overhead coding instead of replication"
    - "bounds for batch codes with restricted query size"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-2 (induced by source paper "the role of coded side information in single server private information retrieval"):
  with members:
    - "on an equivalence between single server pir with side information and locally recoverable codes"
    - "private information retrieval with private coded side information the multi server case"
    - "single server single message online private information retrieval with side information"
    - "single server multi message individually private information retrieval with side information"
    - "multi server private information retrieval with coded side information"
    - "multi message private information retrieval with private side information"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "the capacity of private information retrieval with private side information under storage constraints"

Connected through hyperedge HE-3 (induced by source paper "constructions of batch codes via finite geometry"):
  with members:
    - "bounds on the length of functional pir and batch codes"
    - "nearly optimal constructions of pir and batch codes"
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"
    - "pir with low storage overhead coding instead of replication"
    - "achieving arbitrary locality and availability in binary codes"
    - "locality and availability in distributed storage"
    - "optimal combinatorial batch codes based on block designs"

Connected through hyperedge HE-4 (induced by source paper "batch and pir codes and their connections to locally repairable codes"):
  with members:
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"
    - "cooperative local repair in distributed storage"
    - "pir with low storage overhead coding instead of replication"
    - "private information retrieval for coded storage"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"
    - "repair locality with multiple erasure tolerance"

Connected through hyperedge HE-5 (induced by source paper "asynchronous batch and pir codes from hypergraphs"):
  with members:
    - "lower bound on the redundancy of pir codes"
    - "pir with low storage overhead coding instead of replication"
    - "bounds for batch codes with restricted query size"
    - "linear batch codes"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-6 (induced by source paper "pir array codes with optimal virtual server rate"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "nearly optimal constructions of pir and batch codes"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "locality and availability of array codes constructed from subspaces"
    - "lower bound on the redundancy of pir codes"
    - "pir schemes with small download complexity and low storage requirements"
    - "private information retrieval from coded databases with colluding servers"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"

Connected through hyperedge HE-7 (induced by source paper "multiround private information retrieval capacity and storage overhead"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "pir array codes with optimal virtual server rate"
    - "on the impact of a single edge on the network coding capacity"
    - "on private information retrieval array codes"
    - "the capacity of robust private information retrieval with colluding databases"
    - "lower bound on the redundancy of pir codes"
    - "pir schemes with small download complexity and low storage requirements"
    - "the capacity of symmetric private information retrieval"

Connected through hyperedge HE-8 (induced by source paper "private information retrieval from coded databases with colluding servers"):
  with members:
    - "on private information retrieval array codes"
    - "the capacity of robust private information retrieval with colluding databases"
    - "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"
    - "pir with low storage overhead coding instead of replication"
    - "2 server pir with sub polynomial communication"

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)