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 virtual server 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 PIR 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/s)$ of the bits of the database; here $s$ is a fixed rational number with $s > 1$. A PIR array code with the $k$-PIR property enables a $k$-server PIR protocol (with $k\leq m$) to be emulated on $m$ servers, with the overall storage requirements of the protocol being reduced. The communication complexity of a PIR protocol reduces as $k$ grows, so the virtual server rate, defined to be $k/m$, is an important parameter. We study the maximum virtual server rate of a PIR array code with the $k$-PIR property. We present upper bounds on the achievable virtual server rate, some constructions, and ideas how to obtain PIR array codes with the highest possible virtual server rate. In particular, we present constructions that asymptotically meet our upper bounds, and the exact largest virtual server rate is obtained when $1 < s \leq 2$. #R##N#A $k$-PIR code (and similarly a $k$-PIR array code) is also a locally repairable code with symbol availability $k-1$. Such a code ensures $k$ parallel reads for each information symbol. So the virtual server rate is very closely related to the symbol availability of the code when used as a locally repairable code. The results of this paper are discussed also in this context, where subspace codes also have an important role.

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"
    - "on private information retrieval array codes"
    - "pir array codes with optimal pir rate"
    - "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 "breaking the mds pir capacity barrier via joint storage coding"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "an optimal iterative placement algorithm for pir from heterogeneous storage constrained databases"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on the fundamental limit of private information retrieval for coded distributed storage"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "on sub packetization and access number of capacity achieving pir schemes for mds coded non colluding servers"

Connected through hyperedge HE-3 (induced by source paper "private information retrieval in graph based replication systems"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private computation of systematically encoded data with colluding servers"
    - "codes for graph erasures"
    - "private information retrieval from storage constrained databases coded caching meets pir"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "codes for erasures over directed graphs"
    - "multiround private information retrieval capacity and storage overhead"
    - "the capacity of robust private information retrieval with colluding databases"

Connected through hyperedge HE-4 (induced by source paper "private information retrieval from mds coded data in distributed storage systems"):
  with members:
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "robust private information retrieval on coded data"
    - "blind interference alignment for private information retrieval"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"
    - "the capacity of robust private information retrieval with colluding databases"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"

Connected through hyperedge HE-5 (induced by source paper "private information retrieval schemes with regenerating codes"):
  with members:
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "t private information retrieval schemes using transitive codes"
    - "the capacity of robust private information retrieval with colluding databases"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "private information retrieval for coded storage"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-6 (induced by source paper "locality and availability of array codes constructed from subspaces"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "lengthening and extending binary private information retrieval codes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "locality via partially lifted codes"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"

Connected through hyperedge HE-7 (induced by source paper "a general private information retrieval scheme for mds coded databases with colluding servers"):
  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"
    - "private information retrieval schemes for coded data with arbitrary collusion patterns"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "multiround private information retrieval capacity and storage overhead"
    - "on private information retrieval array codes"

Connected through hyperedge HE-8 (induced by source paper "private information retrieval with side information"):
  with members:
    - "private broadcasting an index coding approach"
    - "the capacity of robust private information retrieval with colluding databases"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "pir with low storage overhead coding instead of replication"
    - "private information retrieval for coded storage"
    - "blind index coding"

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)