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: "fundamental limits of caching with secure delivery"
  Abstract: Caching is emerging as a vital tool for alleviating the severe capacity crunch in modern content-centric wireless networks. The main idea behind caching is to store parts of the popular content in end-users’ memory and leverage the locally stored content to reduce peak data rates. By jointly designing content placement and delivery mechanisms, recent works have shown order-wise reduction in transmission rates in contrast to traditional methods. In this paper, we consider the secure caching problem with the additional goal of minimizing information leakage to an external wiretapper. The fundamental cache memory versus transmission rate tradeoff for the secure caching problem is characterized. Rather surprisingly, these results show that security can be introduced at a negligible cost, particularly for large number of files and users. It is also shown that the rate achieved by the proposed caching scheme with secure delivery is within a constant multiplicative factor from the information-theoretic optimal rate for almost all parameter values of practical interest.

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 "subpacketization in coded caching with demand privacy"):
  with members:
    - "on coded caching with private demands"
    - "demand private coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "private broadcasting an index coding approach"

Connected through hyperedge HE-3 (induced by source paper "improved constructions of coded caching schemes for combination networks"):
  with members:
    - "caching in combination networks a novel delivery by leveraging the network topology"
    - "placement delivery array design for combination networks with edge caching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on combination networks with cache aided relays and users"
    - "a novel asymmetric coded placement in combination networks with end user caches"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"

Connected through hyperedge HE-4 (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"
    - "private coded caching"
    - "on the optimality of uncoded cache placement"

Connected through hyperedge HE-5 (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"
    - "private coded caching"
    - "on the optimality of uncoded cache placement"
    - "caching aided coded multicasting with multiple random requests"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-6 (induced by source paper "secure coded caching with colluding users"):
  with members:
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "caching and delivery via interference elimination"
    - "fundamental limits of secretive coded caching"
    - "fundamental limits of caching"
    - "decentralized coding algorithms for distributed storage in wireless sensor networks"

Connected through hyperedge HE-7 (induced by source paper "the capacity of private information retrieval from decentralized uncoded caching databases"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "staircase pir universally robust private information retrieval"
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from a cellular network with caching at the edge"
    - "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"
    - "coded caching for heterogeneous systems an optimization perspective"

Connected through hyperedge HE-8 (induced by source paper "coded caching with heterogeneous cache sizes and link qualities the two user case"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching in a multi server system with random topology"
    - "benefits of cache assignment on degraded broadcast channels"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "cache aided content delivery over erasure broadcast channels"

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)