{
  "annotation_id": "6cf5547d-b3d7-4a33-9745-01c5a2ef17d1",
  "date_created": "2026-02-17T05:53:24.180000Z",
  "date_modified": "2026-02-17T05:53:24.180000Z",
  "file_hash": "749d43a1348aa6b52fab9844392c9c59bf2c00d1e18cb307a12cc6627e7246c1",
  "private": false,
  "record": {
    "abstract": "We study hotplug coded caching in combinatorial multi-access networks, which generalizes existing hotplug coded caching models by allowing users to access multiple caches, while only a subset of caches is online during the delivery phase. We first generalize the Hotplug Placement Delivery Array (HpPDA) framework to the combinatorial multi-access setting. Based on this generalized framework, we propose a t-design-based coded caching scheme for combinatorial multi-access networks. We characterize a class of design parameters under which every active user has access to a sufficient number of coded subfiles to decode its requested file, and show that appropriate parameter choices allow for the elimination of redundant multicast transmissions. As a result, the proposed scheme achieves a family of rate memory trade offs with flexible subpacketization. We present numerical comparisons illustrating that the proposed t-scheme outperforms existing hotplug coded caching schemes in certain memory regimes.",
    "arxiv_id": "2601.10503",
    "authors": [
      "Dhruv Pratap Singh",
      "Anjana A. Mahesh",
      "B. Sundar Rajan"
    ],
    "categories": [
      "cs.IT",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Coded Caching for Combinatorial Multi-Access Hotplug Networks from $t$-Designs",
    "url": "https://arxiv.org/abs/2601.10503",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4794f06e-55ec-4a33-be13-65980786c4f1",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}