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: "combination networks with or without secrecy constraints the impact of caching relays"
  Abstract: This paper considers a two-hop network architecture known as a combination network, where a layer of relay nodes connects a server to a set of end users. In particular, a new model is investigated where the intermediate relays employ caches in addition to the end users. First, a new centralized coded caching scheme is developed that utilizes maximum distance separable (MDS) coding, jointly optimizes cache placement and delivery phase, and enables decomposing the combination network into a set virtual multicast sub-networks. It is shown that if the sum of the memory of an end user and its connected relay nodes is sufficient to store the database, then the server can disengage in the delivery phase and all the end users' requests can be satisfied by the caches in the network. Lower bounds on the normalized delivery load using genie-aided cut-set arguments are presented along with second hop optimality. Next recognizing the information security concerns of coded caching, this new model is studied under three different secrecy settings: 1) secure delivery where we require an external entity must not gain any information about the database files by observing the transmitted signals over the network links, 2) secure caching, where we impose the constraint that end users must not be able to obtain any information about files that they did not request, and 3) both secure delivery and secure caching, simultaneously. We demonstrate how network topology affects the system performance under these secrecy requirements. Finally, we provide numerical results demonstrating the system performance in each of the settings considered.

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 "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-3 (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-4 (induced by source paper "the role of caching in future communication systems and networks"):
  with members:
    - "classifying flows and buffer state for youtube s http adaptive streaming service in mobile networks"
    - "optimal and scalable caching for 5g using reinforcement learning of space time popularities"
    - "on coding for cache aided delivery of dynamic correlated content"
    - "optimized base station cache allocation for cloud radio access network with multicast backhaul"
    - "updating content in cache aided coded multicast"
    - "on the effects of subpacketization in content centric mobile networks"
    - "show me the cache optimizing cache friendly recommendations for sequential content access"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"

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"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"

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"
    - "information theoretic caching the multi user case"

Connected through hyperedge HE-7 (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"
    - "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"
    - "a rate distortion approach to caching"

Connected through hyperedge HE-8 (induced by source paper "placement delivery array design for combination networks with edge caching"):
  with members:
    - "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"
    - "low subpacketization schemes for coded caching"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"

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)