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 secretive 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 "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-2 (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 caching with secure delivery"
    - "fundamental limits of caching"
    - "decentralized coding algorithms for distributed storage in wireless sensor networks"

Connected through hyperedge HE-3 (induced by source paper "fundamental limits of caching in heterogeneous networks with uncoded prefetching"):
  with members:
    - "cooperative multi sender index coding"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "leveraging coding techniques for speeding up distributed computing"
    - "coded distributed computing with node cooperation substantially increases speedup factors"
    - "achieving spatial scalability for coded caching over wireless networks"
    - "a new combinatorial design of coded distributed computing"
    - "low subpacketization schemes for coded caching"
    - "on the placement delivery array design for centralized coded caching scheme"

Connected through hyperedge HE-4 (induced by source paper "decentralized caching schemes and performance limits in two layer networks"):
  with members:
    - "riding on the primary a new spectrum sharing paradigm for wireless powered iot devices"
    - "low subpacketization schemes for coded caching"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "on edge caching with secrecy constraints"
    - "decentralized coded caching with distinct cache capacities"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "caching aided coded multicasting with multiple random requests"
    - "order optimal rate of caching and coded multicasting with random demands"

Connected through hyperedge HE-5 (induced by source paper "on coded caching with heterogeneous distortion requirements"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "benefits of cache assignment on degraded 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"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "decentralized coded caching with distinct cache capacities"

Connected through hyperedge HE-6 (induced by source paper "secrecy capacity memory tradeoff of erasure broadcast channels"):
  with members:
    - "secure broadcasting using independent secret keys"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "cache enabled physical layer security for video streaming in backhaul limited cellular networks"
    - "a secure approach for caching contents in wireless ad hoc networks"
    - "noisy broadcast networks with receiver caching"
    - "speeding up future video distribution via channel aware caching aided coded multicast"
    - "on edge caching with secrecy constraints"

Connected through hyperedge HE-7 (induced by source paper "combination networks with or without secrecy constraints the impact of caching relays"):
  with members:
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"
    - "coded caching for networks with the resolvability property"
    - "caching and delivery via interference elimination"
    - "on caching with more users than files"
    - "fundamental limits of caching with secure delivery"
    - "cache aided interference channels"
    - "multi server coded caching"

Connected through hyperedge HE-8 (induced by source paper "decentralized caching in two layer networks algorithms and limits"):
  with members:
    - "low subpacketization schemes for coded caching"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "on edge caching with secrecy constraints"
    - "decentralized coded caching with distinct cache capacities"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "caching aided coded multicasting with multiple random requests"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"

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)