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: "private information retrieval in distributed storage systems using an arbitrary linear code"
  Abstract: We propose an information-theoretic private information retrieval (PIR) scheme for distributed storage systems where data is stored using a linear systematic code of rate $R > 1/2$. The proposed scheme generalizes the PIR scheme for data stored using maximum distance separable codes recently proposed by Tajeddine and El Rouayheb for the scenario of a single spy node. We further propose an algorithm to optimize the communication price of privacy (cPoP) using the structure of the underlying linear code. As an example, we apply the proposed algorithm to several distributed storage codes, showing that the cPoP can be significantly reduced by exploiting the structure of the distributed storage code.

Connected through hyperedge HE-1 (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"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "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"

Connected through hyperedge HE-2 (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"
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "sok of used cryptography in blockchain"):
  with members:
    - "sef a secure fountain architecture for slashing storage costs in blockchains"
    - "dfinity technology overview series consensus system"
    - "celer network bring internet scale to every blockchain"
    - "raziel private and verifiable smart contracts on blockchains"
    - "blendcac a blockchain enabled decentralized capability based access control for iots"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "a survey on security and privacy issues of bitcoin"
    - "privacy preserving and efficient aggregation based on blockchain for power grid communications in smart communities"

Connected through hyperedge HE-4 (induced by source paper "private information retrieval from locally repairable databases with colluding servers"):
  with members:
    - "maximally recoverable codes with hierarchical locality"
    - "one shot pir refinement and lifting"
    - "private information retrieval over networks"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "bounds and constructions of codes with multiple localities"

Connected through hyperedge HE-5 (induced by source paper "on the information leakage in private information retrieval systems"):
  with members:
    - "weakly private information retrieval"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "the capacity of private information retrieval with eavesdroppers"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of cache aided private information retrieval"
    - "the capacity of private information retrieval from byzantine and colluding databases"

Connected through hyperedge HE-6 (induced by source paper "private information retrieval from mds array codes with near optimal repair bandwidth"):
  with members:
    - "a new capacity achieving private information retrieval scheme with almost optimal file length for coded servers"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "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"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"

Connected through hyperedge HE-7 (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"
    - "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-8 (induced by source paper "weighted lifted codes local correctabilities and application to robust private information retrieval"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private information retrieval from coded databases with colluding servers"
    - "a storage efficient and robust private information retrieval scheme allowing few servers"
    - "high rate locally correctable codes via lifting"
    - "new affine invariant codes from lifting"
    - "weighted reed muller codes revisited"

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)