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 with low storage overhead coding instead of replication"
  Abstract: Private information retrieval (PIR) protocols allow a user to retrieve a data item from a database without revealing any information about the identity of the item being retrieved. Specifically, in information-theoretic $k$-server PIR, the database is replicated among $k$ non-communicating servers, and each server learns nothing about the item retrieved by the user. The cost of PIR protocols is usually measured in terms of their communication complexity, which is the total number of bits exchanged between the user and the servers, and storage overhead, which is the ratio between the total number of bits stored on all the servers and the number of bits in the database. Since single-server information-theoretic PIR is impossible, the storage overhead of all existing PIR protocols is at least $2$. #R##N#In this work, we show that information-theoretic PIR can be achieved with storage overhead arbitrarily close to the optimal value of $1$, without sacrificing the communication complexity. Specifically, we prove that all known $k$-server PIR protocols can be efficiently emulated, while preserving both privacy and communication complexity but significantly reducing the storage overhead. To this end, we distribute the $n$ bits of the database among $s+r$ servers, each storing $n/s$ coded bits (rather than replicas). For every fixed $k$, the resulting storage overhead $(s+r)/s$ approaches $1$ as $s$ grows; explicitly we have $r\le k\sqrt{s}(1+o(1))$. Moreover, in the special case $k = 2$, the storage overhead is only $1 + \frac{1}{s}$. In order to achieve these results, we introduce and study a new kind of binary linear codes, called here $k$-server PIR codes. We then show how such codes can be constructed, and we establish several bounds on the parameters of $k$-server PIR codes. Finally, we briefly discuss extensions of our results to nonbinary alphabets, to robust PIR, and to $t$-private PIR.

Connected through hyperedge HE-1 (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"):
  with members:
    - "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes"
    - "load balancing performance in distributed storage with regular balanced redundancy"
    - "analyzing the download time of availability codes"
    - "service rate region of content access from erasure coded storage"
    - "simplex queues for hot data download"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on distributed storage allocations of large files for maximum service rate"
    - "on the service capacity region of accessing erasure coded content"

Connected through hyperedge HE-2 (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 array codes with optimal pir rate"
    - "bounds for batch codes with restricted query size"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-3 (induced by source paper "pir codes with short block length"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "determining the generalized hamming weight hierarchy of the binary projective reed muller code"
    - "lengthening and extending binary private information retrieval codes"
    - "t private information retrieval schemes using transitive codes"
    - "locality via partially lifted codes"
    - "lower bound on the redundancy of pir codes"
    - "achieving arbitrary locality and availability in binary codes"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-4 (induced by source paper "improved storage for efficient private information retrieval"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "staircase pir universally robust private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from a cellular network with caching at the edge"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "the capacity of private information retrieval with private side information under storage constraints"

Connected through hyperedge HE-5 (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-6 (induced by source paper "weakly private information retrieval"):
  with members:
    - "technical privacy metrics a systematic survey"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "on the access complexity of pir schemes"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "achieving maximum distance separable private information retrieval capacity with linear codes"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"
    - "the capacity of robust private information retrieval with colluding databases"
    - "the capacity of private information retrieval"

Connected through hyperedge HE-7 (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 array codes with optimal pir rate"
    - "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-8 (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"
    - "pir array codes with optimal pir rate"
    - "cooperative local repair in distributed storage"
    - "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"

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)