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: "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
  Abstract: We propose a private information retrieval (PIR) protocol for distributed storage systems with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the maximum distance separable (MDS) PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-Muller codes satisfy the sufficient condition and are thus MDS-PIR capacity-achieving.

Connected through hyperedge HE-1 (induced by source paper "latent variable private information retrieval"):
  with members:
    - "x secure t private information retrieval from mds coded storage with byzantine and unresponsive servers"
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "the capacity of private information retrieval from uncoded storage constrained 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"
    - "multi message private information retrieval with private side information"

Connected through hyperedge HE-2 (induced by source paper "private sequential function computation"):
  with members:
    - "private inner product retrieval for distributed machine learning"
    - "on the capacity of computation broadcast"
    - "private information retrieval with private coded side information the multi server case"
    - "on the asymptotic capacity of x secure t private information retrieval with graph based replicated storage"
    - "private polynomial computation for noncolluding coded databases"
    - "on the upload versus download cost for secure and private matrix multiplication"
    - "private proximity retrieval codes"
    - "achievable rate of private function retrieval from mds coded databases"

Connected through hyperedge HE-3 (induced by source paper "the capacity of multi round private information retrieval from byzantine databases"):
  with members:
    - "staircase pir universally robust private information retrieval"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "asymmetry helps improved private information retrieval protocols for distributed storage"
    - "private information retrieval from a cellular network with caching at the edge"
    - "lifting private information retrieval from two to any number of messages"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "a capacity achieving t pir scheme based on mds array codes"):
  with members:
    - "building capacity achieving pir schemes with optimal sub packetization over small fields"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "t private information retrieval schemes using transitive codes"
    - "the capacity of robust private information retrieval with colluding databases"
    - "the capacity of symmetric private information retrieval"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "capacity achieving private information retrieval codes with optimal message size and upload cost"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "linear network coding over rings part ii vector codes and non commutative alphabets"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "linear network coding over rings part i scalar codes and commutative alphabets"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of cache aided private information retrieval"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "the capacity of private information retrieval from byzantine and colluding databases"

Connected through hyperedge HE-6 (induced by source paper "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"):
  with members:
    - "the capacity of multi round private information retrieval from byzantine databases"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "multi message private information retrieval with private side information"
    - "the capacity of private information retrieval with eavesdroppers"
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "single server multi message private information retrieval with side information"
    - "multi file private information retrieval from mds coded databases with colluding servers"

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"
    - "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"
    - "private function retrieval"

Connected through hyperedge HE-8 (induced by source paper "asymmetry helps improved private information retrieval protocols for distributed storage"):
  with members:
    - "on the fundamental limit of private information retrieval for coded distributed storage"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "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"
    - "the capacity of private information retrieval from coded databases"

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)