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: "on the fundamental limit of private information retrieval for coded distributed storage"
  Abstract: We consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. It was recently shown that if data is stored using a particular class of non-MDS linear codes, the MDS-PIR capacity, i.e., the maximum possible PIR rate for MDS-coded DSSs, can be achieved. For this class of codes, we prove that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the PIR capacity is known. For other codes, we provide asymmetric PIR protocols that achieve a strictly larger PIR rate compared to existing symmetric PIR protocols.

Connected through hyperedge HE-1 (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"
    - "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"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"

Connected through hyperedge HE-2 (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"
    - "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-3 (induced by source paper "asymmetry helps improved private information retrieval protocols for distributed storage"):
  with members:
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "t private information retrieval schemes using transitive codes"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "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"
    - "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"
    - "pir schemes with small download complexity and low storage requirements"
    - "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)