---
title: 'CoopSR: Cooperative Storage, RSMA & Robotics'
url: https://www.emergentmind.com/topics/coopsr
type: topic
---

# CoopSR: Cooperative Storage, RSMA & Robotics

CoopSR appears in the provided literature in several technically distinct senses. In distributed storage, it denotes **cooperative storage repair**: the joint repair of multiple failed nodes by newcomers that download from helpers and then exchange information among themselves, as formalized by cooperative regenerating codes [1101.5257; 1207.6762; 1607.08322]. In wireless communications, closely related work uses **CoopSR / CRS** for **cooperative rate splitting**, where a stronger user relays the decoded common stream in RSMA to weaker users [2208.03928; 2403.10921; 2409.01263; 2006.02555]. In embodied AI, **CoopSR** is also the name of a benchmark for **multi-robot cooperative egocentric spatial reasoning** over synchronized first-person video streams [2605.18431].

## 1. Semantic scope and shared structure

Across these usages, CoopSR denotes a cooperative mechanism that exploits simultaneity or distributed vantage points rather than treating participants independently. The storage literature centers on multiple-node failure recovery; the wireless literature centers on common-stream relaying in rate splitting; the embodied-AI literature centers on multi-robot team reasoning.

| Domain | CoopSR meaning | Core mechanism |
|---|---|---|
| Distributed storage | Cooperative storage repair | Helper download plus newcomer exchange |
| Wireless communications | Cooperative rate splitting | Common-stream decoding plus user relaying |
| Embodied AI | CoopSR benchmark | Multi-robot synchronized egocentric QA |

A recurring motif is a two-stage pattern: local acquisition first, inter-agent cooperation second. In storage, each newcomer first contacts helpers and then exchanges repair data with peer newcomers. In cooperative RSMA, users first decode the BS common stream and then strong users relay it. In the benchmark setting, each robot first observes its own egocentric stream and the model must then integrate team-wide evidence. This suggests a family resemblance across domains, although the underlying mathematical objects—subspaces, SINRs, and multimodal latent states—are entirely different.

## 2. CoopSR as cooperative storage repair

In distributed storage, CoopSR refers to the repair of multiple failed storage nodes **simultaneously** rather than one by one. A file of size \(B\) over \(\mathbb{F}_q\) is encoded across \(n\) nodes with the \((n,k)\)-reconstruction property, so any \(k\) nodes suffice for full recovery. If \(r\) failed nodes are repaired jointly, each newcomer contacts \(d\) helpers, downloads \(\beta_1\) units from each, and then exchanges \(\beta_2\) units with each of the other \(r-1\) newcomers. The per-newcomer repair bandwidth is
\[
\gamma=d\beta_1+(r-1)\beta_2.
\]
The 2016 exact-repair subspace formalization uses \(t\) for the number of jointly repaired failures instead of \(r\), but the two-phase structure is the same [1607.08322].

The 2011 information-flow-graph formulation introduced vertices \(In_p\), \(Mid_p\), and \(Out_p\) for each failed node, helper edges of capacity \(\beta_1\), newcomer-exchange edges of capacity \(\beta_2\), and data-collector cuts that yield
\[
B \le \sum_{i=1}^k \ell_i \min\Big\{ \alpha,\, \Big(d-\sum_{j=1}^{i-1}\ell_j\Big)\beta_1 + (r-\ell_i)\beta_2 \Big\}
\]
for every admissible \((\ell_1,\ldots,\ell_k)\) with \(\sum_i \ell_i=k\) and \(0\le \ell_i\le r\) [1101.5257]. The exact functional tradeoff was later given in closed form. Its cooperative extremal points are the minimum-storage cooperative regenerating point
\[
(\tilde{\gamma}_{\mathrm{MSCR}},\tilde{\alpha}_{\mathrm{MSCR}})=\left(\frac{d+r-1}{k(d+r-k)},\frac{1}{k}\right)
\]
and the minimum-bandwidth cooperative regenerating point
\[
(\tilde{\gamma}_{\mathrm{MBCR}},\tilde{\alpha}_{\mathrm{MBCR}})=\frac{2d+r-1}{k(2d+r-k)}(1,1),
\]
which reduce to the classical MSR and MBR points when \(r=1\) [1207.6762].

The 2016 exact-repair treatment makes the repair phases algebraically explicit. If node \(i\) stores a subspace \(W_i\), reconstruction requires
\[
\bigoplus_{i\in \mathcal K} W_i = L(M,\mathbb{F}_q)
\]
for every \(k\)-subset \(\mathcal K\). If nodes \(i_1,\dots,i_t\) fail, newcomer \(s\) downloads a subspace \(U_s\) from its helpers and sends subspaces \(V_{s\to s'}\subseteq U_s\) to its peers, with exact repair requiring
\[
W_{i_{s'}} \subseteq U_{s'} \oplus \bigoplus_{s\neq s'} V_{s\to s'}.
\]
This formulation cleanly separates helper download and newcomer-to-newcomer exchange, and it makes precise why cooperation can reduce the amount of information drawn from surviving nodes [1607.08322].

## 3. Explicit construction families

The explicit code literature develops several exact cooperative constructions at the cooperative extreme points and, in later work, for specific MSR families and sub-packetization regimes [1101.5257; 1607.08322; 2201.06231; 2502.19909; 2601.09188; 1901.03142].

| Construction family | Parameter regime | Salient property |
|---|---|---|
| RS-based minimum-storage exact repair | \(d=k\), \(B=kr\), \(\alpha=r\) | \(\beta_1=\beta_2=1\), \(\gamma=k+r-1\), uncoded helpers |
| Bilinear-form exact MBCR | \(n-t\ge d\ge k\), \(B=k(2d+t-k)\) | \(\alpha=\gamma=2d+t-1\), \(\beta_1=2\), \(\beta_2=1\) |
| Systematic exact MSCR via MISER / Suh–Ramchandran | \(n=2k\), \(d=n-t\), \(k\ge t\ge 2\) | \(\alpha=k\), \(B=k^2\), repairs any \(t\) systematic nodes and, by duality, any \(t\) parity nodes |
| Hadamard cooperative MSR | \(d=k+1\) | Reduced sub-packetization: \(N=2^n\) when \((h+1)\mid 2^n\), or \(N=(2\ell+1)2^n\) when \(h+1=(2\ell+1)2^m\) |
| Zigzag cooperative MSR | any \(h\), \(k\le d\le n-h\) | Optimal repair for any \(h\) failed nodes, \(N=(d-k+h)s^n\), \(s=d-k+1\), \(q\ge n+1\) |
| Optimal-access cooperative MSR for two erasures | \(h=2\), \(d=n-2\) | \(\ell=r^{\binom{n}{2}-\lfloor n/r\rfloor(\binom r2-1)}\) |
| Improved cooperative repair for RS codes | two or three erasures | Removes characteristic and failure-pattern restrictions |

The earliest explicit exact-repair minimum-storage construction uses a Reed–Solomon generator matrix \(\mathbf G\), stores \(B=kr\) symbols arranged as an \(r\times k\) message matrix \(\mathbf M\), and places column \(j\) of \(\mathbf M\mathbf G\) in node \(j\). If nodes \(f_1,\ldots,f_r\) fail, newcomer \(f_j\) downloads \(k\) symbols sufficient to reconstruct row \(\mathbf m_j^T\), then sends \(\mathbf m_j^T\mathbf g_{f_i}\) to newcomer \(f_i\) for each \(i\neq j\). This achieves exact repair with \(\beta_1=\beta_2=1\) and \(\gamma=k+r-1\); helper nodes simply read and forward stored packets, so the repair is uncoded on the helper side [1101.5257].

The 2016 MBCR construction slightly generalizes the earlier Wang–Zhang design using a bilinear-form representation. With
\[
B=k(2d+t-k),\qquad \alpha=2d+t-1,
\]
it stores, at node \(i\), enough information to evaluate both \(\mathsf B(\cdot,v_i)\) and \(\mathsf B(u_i,\cdot)\) for \(\mathsf B(x,y)=x^TMy\). Repair proceeds in two phases: each helper sends \(\mathsf B(u_i,v_j)\) and \(\mathsf B(u_j,v_i)\), so \(\beta_1=2\); then newcomers exchange one symbol each, so \(\beta_2=1\). The resulting per-newcomer bandwidth
\[
\gamma=2d+t-1
\]
matches the MBCR point exactly, and each newcomer may choose **any \(d\) surviving helpers** [1607.08322].

The companion MSCR family in the same paper is systematic and uses the MISER / Suh–Ramchandran coding structure with an invertible \(k\times k\) matrix \(U\), a super-regular matrix \(P\), and a symmetric super-regular \(2\times2\) matrix \(\begin{bmatrix}a&e\\ e&a\end{bmatrix}\). In the regime
\[
n=2k,\qquad d=n-t,\qquad k\ge t\ge 2,\qquad B=k^2,\qquad \alpha=k,
\]
it repairs any \(t\) systematic failures with \(\beta_1=\beta_2=1\) and
\[
\gamma=d+t-1,
\]
and, by duality, it also repairs any \(t\) parity-check node failures. The repair is interpreted explicitly as interference alignment: after phase 1, each newcomer sees mixtures of desired and interfering symbols, and phase 2 resolves the interference cooperatively [1607.08322].

Later work specializes cooperative repair to particular MSR families. For Hadamard MSR codes with \(d=k+1\), a new pairing scheme based on inter-instance and intra-instance pairing reduces sub-packetization from Ye’s \((h+1)2^n\) to \(2^n\) when \((h+1)\mid 2^n\), and to \((2\ell+1)2^n\) when \(h+1=(2\ell+1)2^m\) [2201.06231]. For Zigzag MSR codes, the first optimal cooperative repair scheme for that family achieves repair of any \(h\) failed nodes with
\[
N=(d-k+h)s^n,\qquad s=d-k+1,
\]
and uses only \(\mathbb F_q\) with \(q\ge n+1\) [2502.19909]. For optimal-access cooperative MSR with two erasures, a recent construction reduces the sub-packetization from \(r^{\binom n2}\) to
\[
\ell=r^{\binom{n}{2}-\lfloor\frac{n}{r}\rfloor(\binom r2-1)}
\]
while retaining optimal bandwidth and optimal access [2601.09188]. A separate Reed–Solomon line improves cooperative repair of two or three erasures by removing earlier restrictions that required either \(\operatorname{char}(F)\mid [F:B]\) or special failure patterns [1901.03142].

## 4. Operational interpretation, neighboring models, and open problems

The storage literature explicitly motivates cooperative repair for **high churn**, **batch-mode recovery**, **correlated failures**, and **lazy repair**. If several nodes fail together, independent repair wastes bandwidth because different newcomers download overlapping information from live nodes. Cooperative repair instead lets newcomers divide the decoding task, exchange distilled side information, and reduce the amount drawn from the surviving system. At the minimum-bandwidth point, this minimizes download from survivors; at the minimum-storage point, it preserves MDS-level storage efficiency while still exploiting collaboration [1101.5257; 1607.08322].

The main trade-off is protocol complexity. Cooperative repair is inherently two-phase, requires synchronization among newcomers, and adds cross-newcomer traffic. The 2016 survey material also notes a security downside already recognized in prior work: because newcomers exchange repair data, cooperative repair is more exposed to pollution and Byzantine attacks. Another limitation is that explicit exact MSCR constructions remain much less general than MBCR ones; the MBCR family covers all legitimate MBCR parameters \(n-t\ge d\ge k\), whereas the exact MSCR family in that paper is restricted to \(n=2k\) and \(d=n-t\) [1607.08322].

A neighboring but distinct design line studies **group-level** cooperative repair under locality constraints rather than the standard multi-newcomer cut-set model. Local codes with cooperative repair build each local code from an MSR code part and a distributed local parity part
\[
m_{i-1}P_{i-1}+m_{i+1}P_{i+1},
\]
creating a mutual interleaving structure among adjacent local groups. In that model, one failed local group can be repaired from three adjacent local groups, and two adjacent failed local groups can be repaired with average locality \(2\) per failed group [1602.03084]. The underlying object is still cooperative regeneration, but the cooperating entities are repair groups rather than individual newcomers.

Several open directions remain explicit in the cited literature. The 2016 exact-repair paper points to repair-by-transfer at MBCR and cooperative repair methods for practical families such as Reed–Solomon and array codes [1607.08322]. The optimal-access work identifies extension from \(h=2\) and \(d=n-2\) to arbitrary \(h>2\) and arbitrary \(d\), together with lower bounds on sub-packetization of cooperative MSR codes, as open problems [2601.09188]. These unresolved questions show that the information-theoretic tradeoff is classical, but explicit constructions with simultaneously favorable bandwidth, access, field size, and sub-packetization remain highly nonuniform across parameter regimes.

## 5. CoopSR / CRS in wireless communications

A separate communications literature uses **CoopSR / CRS** for **cooperative rate splitting**. Here the system model is not a storage code but a multi-user downlink—typically a MISO broadcast channel—in which each user message \(W_k\) is split into a common part \(W_{c,k}\) and a private part \(W_{p,k}\). The BS jointly encodes all common parts into a common stream \(s_0\) and encodes private parts into user-specific streams. Cooperation is centered on the **common stream**: a stronger user decodes it first and then forwards it to weaker users. In the two-user form, the common-rate constraint changes from the non-cooperative bottleneck to
\[
R_c=\min\left(c_1^{(1)},\,c_2^{(1)}+c_2^{(2)}\right),
\]
so the weak user combines direct and relayed common information [2208.03928].

This literature repeatedly stresses that the relayed object is the **common stream**, not the private stream. That design choice is mathematically important because it targets the RSMA bottleneck directly and avoids a second-stage multiuser interference structure in the cooperative phase. In a physical-layer security variant, the common stream also serves as artificial-noise-like interference at the eavesdropper without consuming extra power beyond the RS design itself [2006.02555].

Reconfigurable surfaces are then added to reshape both direct and relay links. In RIS-aided CRS for a two-user MISO downlink, the RIS assists the BS-to-user links in phase 1 and the user-to-user relay link in phase 2, while the system jointly optimizes BS beamforming, common-rate allocation, RIS phases, and the time split \(\beta\). At \(15\) dB SNR with \(N_t=2\) and \(N=4\), the reported max–min-rate gain is at least \(6.6\%\) over RIS RSMA and \(19.5\%\) over no-RIS CRS, and the AO algorithm converges in about \(50\) iterations in a representative realization [2208.03928].

STAR-RIS extensions replace conventional RIS by a simultaneously transmitting and reflecting surface and study six coupled protocol choices:
\[
\text{FE},\ \text{FM},\ \text{FT},\ \text{HE},\ \text{HM},\ \text{HT},
\]
formed by pairing FD or HD relaying with the ES, MS, or TS STAR-RIS operating protocols. The optimization jointly treats active beamforming, common-rate allocation, STAR-RIS passive beamforming, and, where relevant, time-allocation variables such as \(\lambda\), \(\lambda_r\), \(\lambda_1\), and \(\lambda_2\), under BS power constraints and STAR-RIS energy-conservation constraints [2403.10921].

The single-cell model also extends to multi-cell JT-CoMP. In coordinated HD/FD C-RSMA, multiple BSs jointly transmit to CCUs and CEUs, while CCUs relay the common stream to CEUs in HD or FD DF mode. The reported gains at BS transmit power \(20\) dBm are \(25\%\) for FD C-RSMA over FD C-NOMA and \(19\%\) for HD C-RSMA over HD C-NOMA [2409.01263]. In this communications branch, CoopSR is therefore best understood as a cooperative RSMA architecture for fairness-limited downlinks rather than as a storage-repair code.

## 6. CoopSR as a multi-robot benchmark

In 2026, CoopSR acquired a new, literal meaning as the name of the first benchmark for **multi-robot cooperative egocentric spatial reasoning** [2605.18431]. The benchmark is instantiated by the EgoTeam dataset, which contains **114,227 QA pairs** spanning **19 question types**, **four difficulty tiers**, and **three team sizes** in Habitat and iGibson, together with a real-world test set of around **2,326 QAs** collected with two quadruped robots. The task input is a set of synchronized egocentric video streams
\[
\mathcal V_r=\{\mathbf x_{r,t}\}_{t=1}^{T}
\]
from a team of robots plus a language query, and the output is an MC4 answer. During training, privileged robot-pose information may be used; at test time, only videos and the query are provided.

The four benchmark tiers are: T1 egocentric spatial QA, T2 pairwise relationship reasoning, T3 scene-level composition and robot action reasoning, and T4 multi-robot dynamic spatial reasoning. The design specifically targets spatial, temporal, visibility, and coordination questions that cannot be solved from a single viewpoint. Text-only performance remains far below multimodal performance, and random robot-stream dropout sharply degrades accuracy, indicating that the benchmark genuinely requires cooperative multi-view reasoning rather than language priors alone [2605.18431].

The accompanying model, SP-CoR, combines three modules: **SE-MR\(^2\)FS** for CLIP- and FFT-based multi-robot frame sampling, **SPI-MRF** for spectral- and physics-informed multi-robot fusion, and **PAPSD** for physics-aligned prompt-space distillation. With Qwen2.5-VL-7B, the reported averages are **70.55** on Habitat and **70.82** on iGibson, outperforming the strongest fine-tuned baseline by **+3.87\%** and **+7.12\%**, respectively. The model also generalizes better to unseen team sizes and to the real-world robot test set [2605.18431].

This benchmark usage is semantically distinct from the storage and wireless meanings. Here CoopSR is not a repair or transmission protocol but an evaluation problem for multimodal large language models operating over synchronized multi-robot observations. Even so, the same broad cooperative principle persists: no single agent has a complete view, and performance depends on exploiting structured inter-agent complementarity rather than independent processing.

Taken together, the literature presents CoopSR as a domain-dependent label for cooperative resolution of a shared bottleneck: multiple newcomers repairing failed storage nodes, stronger users relaying the RS common stream, or multiple robots contributing partial embodied evidence to a team-level spatial judgment. This suggests a recurring conceptual pattern rather than a single settled acronym.

Source: https://www.emergentmind.com/topics/coopsr