human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "the capacity of private information retrieval from heterogeneous uncoded caching databases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "latent variable private information retrieval")
  Member "an optimal iterative placement algorithm for pir from heterogeneous storage constrained databases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "heterogeneous computation assignments in coded elastic computing")
  Member "capacity achieving private information retrieval codes from mds coded databases with minimum message size":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "the capacity of private information retrieval from uncoded storage constrained databases":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "latent variable private information retrieval")
  Member "batch and pir codes and their connections to locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "on the fundamental limit of private information retrieval for coded distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity of private linear computation for coded databases")
  Member "private information retrieval from mds coded data in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "latent variable private information retrieval")
  Member "on sub packetization and access number of capacity achieving pir schemes for mds coded non colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "towards practical private information retrieval from mds array codes")

Question: Please tell me which class the source paper 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)