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 coded caching"
  Abstract: Recent work by Maddah-Ali and Niesen introduced coded caching which demonstrated the benefits of joint design of storage and transmission policies in content delivery networks. They studied a setup where a server communicates with a set of users, each equipped with a local cache, over a shared error-free link and proposed an order-optimal caching and delivery scheme. In this paper, we introduce the problem of secretive coded caching where we impose the additional constraint that a user should not be able to learn anything, from either the content stored in its cache or the server transmissions, about a file it did not request. We propose a feasible scheme for this setting and demonstrate its order-optimality with respect to information-theoretic lower bounds.

Connected through hyperedge HE-1 (induced by source paper "on coded caching with private demands"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "device to device secure coded caching"
    - "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"

Connected through hyperedge HE-2 (induced by source paper "on the effective throughput of coded caching a game theoretic perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "energy efficiency gains of caching for interference channels"
    - "caching meets millimeter wave communications for enhanced mobility management in 5g networks"
    - "on coded caching in the overloaded miso broadcast channel"
    - "a survey on low latency towards 5g ran core network and caching solutions"
    - "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "a stackelberg game for incentive proactive caching mechanisms in wireless networks"

Connected through hyperedge HE-3 (induced by source paper "demand private coded caching and the exact trade off for n k 2"):
  with members:
    - "on coded caching with private demands"
    - "subpacketization in coded caching with demand privacy"
    - "demand private coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "on the optimality of uncoded cache placement"
    - "fundamental limits of caching with secure delivery"

Connected through hyperedge HE-4 (induced by source paper "demand private coded caching"):
  with members:
    - "on coded caching with private demands"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "on the optimality of uncoded cache placement"
    - "caching aided coded multicasting with multiple random requests"
    - "fundamental limits of caching with secure delivery"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-5 (induced by source paper "coded caching for heterogeneous systems an optimization perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "benefits of cache assignment on degraded broadcast channels"
    - "optimization of heterogeneous coded caching"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"

Connected through hyperedge HE-6 (induced by source paper "the caching broadcast channel with a wire and cache tapping adversary of type ii"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "a new wiretap channel model and its strong secrecy capacity"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "combination networks with or without secrecy constraints the impact of caching relays"

Connected through hyperedge HE-7 (induced by source paper "device to device secure coded caching"):
  with members:
    - "benefits of cache assignment on degraded broadcast channels"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "coded caching in partially cooperative d2d communication networks"
    - "wireless device to device caching networks basic principles and system performance"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "fundamental limits of caching with secure delivery"
    - "a survey on device to device communication in cellular networks"
    - "fundamental limits of caching in wireless d2d networks"

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)