{
  "annotation_id": "75f6f0fb-5ede-4fd9-b2f7-2b2fcbd26c63",
  "date_created": "2026-02-17T05:53:23.804000Z",
  "date_modified": "2026-02-17T05:53:23.804000Z",
  "file_hash": "d7059950537416f3ceb66bfcb467fa445d72b5c34564cd455245eb82ecf8dcd8",
  "private": false,
  "record": {
    "abstract": "This paper studies the multi-access coded caching (MACC) problem under arbitrary user-cache access topologies, extending existing models that rely on highly structured and combinatorially designed connectivity. We consider a MACC system consisting of a single server, multiple cache nodes, and multiple user nodes. Each user can access an arbitrary subset of cache nodes to retrieve cached content. The objective is to design a general and low-complexity delivery scheme under fixed cache placement for arbitrary access topologies. We propose a universal graph-based framework for modeling the MACC delivery problem, where decoding conflicts among requested packets are captured by a conflict graph and the delivery design is reduced to a graph coloring problem. In this formulation, a lower transmission load corresponds to using fewer colors. The classical greedy coloring algorithm DSatur achieves a transmission load close to the index-coding converse bound, providing a tight benchmark, but its computational complexity becomes prohibitive for large-scale graphs. To overcome this limitation, we develop a learning-based framework using graph neural networks that efficiently constructs near-optimal coded multicast transmissions and generalizes across diverse access topologies and varying numbers of users. In addition, we extend the index-coding converse bound for uncoded cache placement to arbitrary access topologies and propose a low-complexity greedy approximation. Numerical results demonstrate that the proposed learning-based scheme achieves transmission loads close to those of DSatur and the converse bound while significantly reducing computational time.",
    "arxiv_id": "2601.10175",
    "authors": [
      "Ting Yang",
      "Minquan Cheng",
      "Xinping Yi",
      "Robert Caiming Qiu",
      "Giuseppe Caire"
    ],
    "categories": [
      "cs.IT",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "A Low-Complexity Architecture for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology",
    "url": "https://arxiv.org/abs/2601.10175",
    "version": "v2"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b1faf1aa-d830-49a3-8ac1-9acf27f56a50",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}