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: "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
  Abstract: We propose three private information retrieval (PIR) protocols for distributed storage systems (DSSs) where data is stored using an arbitrary linear code. The first two protocols, named Protocol 1 and Protocol 2, achieve privacy for the scenario with noncolluding nodes. Protocol 1 requires a file size that is exponential in the number of files in the system, while the file size required for Protocol 2 is independent of the number of files and is hence simpler. We prove that, for certain linear codes, Protocol 1 achieves the PIR capacity, i.e., its PIR rate (the ratio of the amount of retrieved stored data per unit of downloaded data) is the maximum possible for any given (finite and infinite) number of files, and Protocol 2 achieves the asymptotic PIR capacity (with infinitely large number of files in the DSS). In particular, we provide a sufficient and a necessary condition for a code to be PIR capacity-achieving and prove that cyclic codes, Reed-Muller (RM) codes, and optimal information locality local reconstruction codes achieve both the finite PIR capacity (i.e., with any given number of files) and the asymptotic PIR capacity with Protocols 1 and 2, respectively. Furthermore, we present a third protocol, Protocol 3, for the scenario with multiple colluding nodes, which can be seen as an improvement of a protocol recently introduced by Freij-Hollanti et al. We also present an algorithm to optimize the PIR rate of the proposed protocol. Finally, we provide a particular class of codes that is suitable for this protocol and show that RM codes achieve the maximum possible PIR rate for the protocol.

Connected through hyperedge HE-1 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases"):
  with members:
    - "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"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "converse for multi server single message pir with side information"

Connected through hyperedge HE-2 (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-3 (induced by source paper "private proximity retrieval codes"):
  with members:
    - "capacity of private linear computation for coded databases"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private computation of systematically encoded data with colluding servers"
    - "private polynomial computation from lagrange encoding"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private function retrieval"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "the capacity of private computation"

Connected through hyperedge HE-4 (induced by source paper "private information retrieval over random linear networks"):
  with members:
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "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"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "t private information retrieval schemes using transitive codes"
    - "sub quadratic decoding of gabidulin codes"

Connected through hyperedge HE-5 (induced by source paper "private information retrieval from a cellular network with caching at the edge"):
  with members:
    - "converse for multi server single message pir with side information"
    - "the capacity of private information retrieval from decentralized uncoded caching databases"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "cache aided private information retrieval with partially known uncoded prefetching fundamental limits"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "optimizing mds coded caching in wireless networks with device to device communication"

Connected through hyperedge HE-6 (induced by source paper "private polynomial computation from lagrange encoding"):
  with members:
    - "codedprivateml a fast and privacy preserving framework for distributed machine learning"
    - "achievable rate of private function retrieval from mds coded databases"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "one shot pir refinement and lifting"
    - "capacity of private linear computation for coded databases"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "private information retrieval from mds coded data in distributed storage systems"

Connected through hyperedge HE-7 (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"
    - "private function retrieval"

Connected through hyperedge HE-8 (induced by source paper "private streaming with convolutional codes"):
  with members:
    - "on the capacity of private information retrieval from coded colluding and adversarial servers"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "t private information retrieval schemes using transitive codes"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "the capacity of robust private information retrieval with colluding databases"
    - "private information retrieval from coded databases with colluding servers"

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)