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 "demand private coded caching and the exact trade off for n k 2"):
  Abstract: The distributed coded caching problem has been studied extensively in the recent past. While the known coded caching schemes achieve an improved transmission rate, they violate the privacy of the users since in these schemes the demand of one user is revealed to others in the delivery phase. In this paper, we consider the coded caching problem under the constraint that the demands of the other users remain information theoretically secret from each user. We first show that the memory-rate pair $(M,\min \{N,K\}(1-M/N))$ is achievable under information theoretic demand privacy, while using broadcast transmissions. We then show that a demand-private scheme for $N$ files and $K$ users can be obtained from a non-private scheme that satisfies only a restricted subset of demands of $NK$ users for $N$ files. We then focus on the demand-private coded caching problem for $K=2$ users, $N=2$ files. We characterize the exact memory-rate trade-off for this case. To show the achievability, we use our first result to construct a demand-private scheme from a non-private scheme satisfying a restricted demand subset that is known from an earlier work by Tian. Further, by giving a converse based on the extra requirement of privacy, we show that the obtained achievable region is the exact memory-rate trade-off.

Includes members:
  Member "on coded caching with private demands":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval")
  Member "subpacketization in coded caching with demand privacy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of device to device private caching with trusted server")
  Member "demand private coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of device to device private caching with trusted server")
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "characterizing the rate memory tradeoff in cache networks within a factor of 2":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "improved converses and gap results for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "private coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on coded caching with private demands")
  Member "on the optimality of uncoded cache placement":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)