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: "breaking the mds pir capacity barrier via joint storage coding"
  Abstract: The capacity of private information retrieval (PIR) from databases coded using maximum distance separable (MDS) codes has been previously characterized by Banawan and Ulukus, where it was assumed that the messages are encoded and stored separably into the databases. This assumption was also usually taken in other related works in the literature, and this capacity is usually referred to as the MDS-PIR capacity colloquially. In this work, we considered the question if and when this capacity barrier can be broken through joint encoding and storing of the messages. Our main results are two classes of novel code constructions which allow joint encoding as well as the corresponding PIR protocols, which indeed outperform the separate MDS-coded systems. Moreover, we show that a simple but novel expansion technique allows us to generalize these two classes of codes, resulting in a wider range of the cases where this capacity barrier can be broken.

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"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "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 "towards practical private information retrieval from mds array codes"):
  with members:
    - "a new capacity achieving private information retrieval scheme with almost optimal file length for coded servers"
    - "on the pir capacity of msr codes"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "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 schemes with regenerating codes"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"

Connected through hyperedge HE-3 (induced by source paper "on the storage cost of private information retrieval"):
  with members:
    - "how to use undiscovered information inequalities direct applications of the copy lemma"
    - "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "improved storage for efficient private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "on the capacity of locally decodable codes"
    - "the capacity of private information retrieval with partially known private side information"

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)