Replay Pairing: A Comparative View

• Replay pairing is a multifaceted concept that defines methods to impose relational structures on replayed entities, adapting to diverse domain needs.
• It encompasses literal combinatorial pairing—as seen in generalized Tic-Tac-Toe—and operational pairing in continual learning and reinforcement learning via batch integration and prioritization.
• In systems and security, replay pairing involves precise ordering of conflicting operations or sensor-fused protocols to counter replay attacks and ensure deterministic execution.

“Replay pairing” is not a standardized term across the arXiv literature. The phrase arises in several technically distinct settings: as a literal pairing strategy in generalized Tic-Tac-Toe, as replay-current co-training in continual learning, as fresh-anchored replay composition in GRPO, as ordering of replay-relevant pairs of racing memory operations in deterministic execution replay, and as a security question in zero-interaction device pairing under replay attack (Mukkamala et al., 2010, Mandalika et al., 7 May 2025, Yoo et al., 3 Jun 2026, Guo et al., 2011, Fomichev et al., 2021). This suggests that the most precise encyclopedic treatment is comparative: the common theme is not a single formal object, but the imposition of some relational structure on replayed entities, replayed histories, or replay-related threats.

1. Terminological scope and recurrent meanings

Several papers explicitly state that they do not implement one-to-one replay/current sample pairing. In unsupervised continual learning, R2R is described as “uncertainty-driven synthetic replay reintegration,” not as a classic pairing scheme; in model-based reinforcement learning, Curious Replay uses scalar prioritization rather than paired sampling; in a cortical replay model, multiple stored patterns may compete or alternate, but there is no explicit theory of paired replay (Mandalika et al., 7 May 2025, Kauvar et al., 2023, Scarpetta et al., 2013).

Domain	Paired or mixed unit	Mechanism
Generalized lattice Tic-Tac-Toe	Disjoint board pairs	Every winning set contains a paired pair
Unsupervised continual learning	Current real data and synthetic replay	Joint latent-space clustering and reintegration
GRPO for reasoning LLMs	Fresh and replay rollouts	Fresh-anchored concatenation
Deterministic program replay	Potentially racing memory-operation pairs	Logged and enforced event order
Zero-interaction pairing	Device pairing under replay attack	fPAKE plus sensor fusion

The resulting taxonomy has two broad forms. In the first, “pairing” is literal and combinatorial: a fixed matching on game boards or a set of potentially racing accesses. In the second, it is operational: replayed and current data are placed into the same optimization batch, latent space, or secure pairing protocol. A recurring misconception is therefore that “replay pairing” necessarily means instance-level matching. Multiple papers reject that interpretation explicitly and instead locate the relevant structure at the level of clusters, batches, rollout buffers, or conflict relations (Harit et al., 28 Sep 2025).

2. Pairing strategies in generalized lattice Tic-Tac-Toe

In "Almost optimal pairing strategy for Tic-Tac-Toe with numerous directions" (Mukkamala et al., 2010), pairing has its most literal formalization. The board is $\mathbb{Z}^d$, the winning directions are primitive vectors $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$, and a winning set is any length-$m$ segment

$$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$

A pairing strategy is a matching on the board, possibly leaving some positions unmatched, such that every winning set contains at least one paired pair. Breaker then responds to a Maker move at $x$ by occupying the point paired with $x$, when that partner exists and is free. Because every winning set contains a whole pair, Maker cannot occupy the entire set.

The paper proves an asymptotically sharp threshold for such strategies. The asymptotic result states that there is an $m=2n+o(n)$ such that Breaker can force a draw using a pairing strategy. The sharper finite statement is: if $p=m-1>2n+1$ is a prime, then Breaker has a pairing strategy. This improves the earlier $m\ge 3n$ threshold of Kruczek and Sundberg, and the lower bound $m\ge 2n+1$ shows that the main term $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$0 is optimal for strategies restricted to pairing.

The lower bound clarifies the combinatorial limit of pairing. The argument shows that if $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$1, then some winning block of length $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$2 contains no paired pair at all, contradicting the definition of a successful pairing strategy. The upper bound proceeds in two steps. First, a finite box $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$3 is mapped injectively into $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$4 via $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$5, with $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$6, so that each winning line becomes an arithmetic progression with difference $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$7. Second, a modular construction over a prime $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$8 uses the Preissmann–Mischler lemma to choose residues $\vec v_1,\dots,\vec v_n \in \mathbb{Z}^d$9 with

$m$0

all distinct modulo $m$1. Pairing is then defined periodically: if $m$2, pair $m$3 with $m$4; if $m$5, pair $m$6 with $m$7. Every progression of length $m$8 in a winning difference contains one such adjacent paired pair.

The proof on $m$9 is lifted to $$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$0 by König’s Infinity Lemma. The result is “almost optimal” because it reaches $$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$1, while the paper explicitly notes that its specific modular method does not establish the conjectured exact threshold $$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$2 in full generality. In this literature, replay pairing is therefore a defensive matching scheme: a preassigned reply partner inside every possible winning run.

3. Continual learning: replay-current integration without instance-level matching

In unsupervised continual learning, replay pairing is generally not implemented as a matched tuple of one old sample and one current sample. "Replay to Remember (R2R): An Efficient Uncertainty-driven Unsupervised Continual Learning Framework Using Generative Replay" (Mandalika et al., 7 May 2025) states that, during training on a new task $$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$3, GMM clustering is performed over the latent representations of both the current task’s real data and synthetic samples generated via replay from previously learned tasks. The paper therefore locates integration in a shared latent-space mixture rather than in pairwise rehearsal.

R2R has four stages: a convolutional autoencoder frontier model, the Self-Guided Uncertainty-Driven Feedback Mechanism (SG-UDFM), VLM-powered generative replay, and self-improvement or cluster-wise fine-tuning. Cluster uncertainty is measured by a dispersion proxy,

$$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$4

with cluster threshold

$$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$5

Replay is triggered when $$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$6. For each uncertain cluster, ten representative samples are extracted, semantically mapped with DeepSeek-R1 and CLIP, and used to prompt Stable Diffusion v1.4 to generate labeled synthetic replay data. The paper specifies that a moderate amount—$$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$7 synthetic samples per query class—enhances cluster stability, whereas surplus replay up to $$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$8 samples can reduce accuracies on CIFAR-10 and SVHN. It also explicitly does not provide a formula for minibatch composition, a deterministic current:replay ratio, or a unified weighted loss for real and replay streams.

A more explicit batch-level notion appears in "EWC-Guided Diffusion Replay for Exemplar-Free Continual Learning in Medical Imaging" (Harit et al., 28 Sep 2025). There, replay is class-conditional, class-balanced, and mixed with current real data in a fixed proportion: “Each batch mixes real and replayed data 1:1.” The classifier is trained on

$$\{\vec a,\ \vec a+\vec v_i,\ \vec a+2\vec v_i,\ \dots,\ \vec a+(m-1)\vec v_i\}.$$9

Replay generates $x$0 class-balanced samples per task under a $x$1 MB memory budget, while EWC constrains Fisher-weighted parameter drift. The paper’s forgetting analysis separates replay fidelity from synaptic stability through the bound

$x$2

Here the relevant “pairing” is batch-level interleaving and objective-level coupling: replay supplies old-task support, and EWC supplies parameter anchoring.

Across both papers, a consistent conclusion emerges: replay pairing in continual learning is usually not instance matching. It is cluster-level reintegration, balanced batch mixing, or coupling between synthetic rehearsal and a stability prior.

4. Reinforcement learning: prioritized replay and fresh-anchored composition

In model-based RL, "Curious Replay for Model-based Adaptation" (Kauvar et al., 2023) is explicit that it is not a replay-pairing paper in the sense of matched pairs or contrastive tuples. Its unit of prioritization is a single state transition, later extended operationally to sequence sampling in DreamerV3. Count-based replay uses

$x$3

adversarial replay uses

$x$4

and Curious Replay combines both: $x$5 The sampling probability is proportional to $x$6. The method is motivated by adaptation in changing environments: uniform replay overtrains on old abundant experience, while under-serving the small amount of data that reflects the new phase. Curious Replay therefore prioritizes experiences that are newly observed or poorly modeled. It does not specify with what other experiences those samples should be paired. A plausible implication is that it is pairing-adjacent rather than pairing-based: it identifies which items are replay-worthy, not which relational structures should be imposed on them.

A direct batch-level replay construction appears in "Rollout-Level Advantage-Prioritized Experience Replay for GRPO" (Yoo et al., 3 Jun 2026). The paper argues that naive replay is difficult for reasoning LLM post-training because policies drift quickly and GRPO advantages are group-relative. Its solution is a rollout-level replay buffer with age eviction and “fresh-anchored composition.” For fresh rollouts, advantages are

$x$7

Replay priority is the rollout-level advantage magnitude,

$x$8

Any rollout older than $x$9 training steps is removed; the default is $x$0.

The pairing mechanism is not one-to-one matching between replayed and fresh rollouts. Each update retains a full fresh on-policy subset and then concatenates replay rollouts drawn separately from the buffer. If $x$1 is the surviving fresh count and $x$2 is the replay ratio, the replay slice has size $x$3; the default is $x$4. Replayed rollouts keep their birth-step advantages and cached behavior-policy likelihoods, rather than being regrouped with current prompts. The paper’s central empirical result is that fresh-anchored composition substantially outperforms pool composition, with gains positive at every scale and the largest five-benchmark average gain reaching $x$5 percentage points at $x$6B. In this RL literature, replay pairing is thus best understood as batch composition with an on-policy anchor, not as explicit rollout pairing.

5. Neural replay dynamics without explicit paired replay

"Neural Avalanches at the Critical Point between Replay and Non-Replay of Spatiotemporal Patterns" (Scarpetta et al., 2013) provides a different use of replay language. The model stores multiple phase-coded spatiotemporal patterns as dynamical attractors in a recurrent network of leaky integrate-and-fire units, but it does not develop an explicit concept of replay pairing. Instead, it studies how replay, non-replay, and intermittent replay emerge as excitability varies.

The network has three regimes. At high excitability, one stored pattern becomes a stable attractor and is replayed persistently. At low excitability, no replay is induced. Between them lies a critical regime in which attractors are unstable and noise produces intermittent short replays. Replay is quantified by an overlap order parameter: $x$7 The critical region is marked by maximal fluctuations in the order parameter and by avalanche size and duration power laws. At $x$8 and $x$9, the paper reports

$m=2n+o(n)$0

and

$m=2n+o(n)$1

With multiple stored patterns, the system shows selection, suppression, and alternation rather than stable co-replay. In the persistent replay regime, one pattern is randomly selected and dominates; in the critical regime, different stored patterns can appear in brief spontaneous episodes. The paper explicitly notes that it does not describe associative linking of two replayed patterns, deterministic switching graphs, or compound replay of paired patterns. In this context, “replay pairing” would therefore be misleading if taken literally. The relevant phenomenon is coexistence in storage and competition in spontaneous expression.

6. Deterministic execution replay and pairs of racing memory operations

In systems research, replay pairing becomes exact again. "Efficient Deterministic Replay Using Complete Race Detection" (Guo et al., 2011) frames deterministic replay around pairs of potentially racing memory operations plus synchronization operations. Two memory operations conflict if they access the same location and at least one is a write; a data race exists between a pair of conflicting operations if there is a sequentially consistent execution in which they can occur adjacent to each other. The replay problem is therefore pairwise: if the relative order of such accesses is not reproduced, replay may observe different values.

RacX resolves this by using a complete static race detector to identify all potential race pairs, then reducing false positives enough that monitoring becomes practical. Analyzer is based on Relay and uses relative locksets $m=2n+o(n)$2 and guarded access sets to identify potential races. Instrumentation is added only to synchronization operations and to memory accesses involved in reported potential races. At runtime, RacX records Lamport-clock timestamps for synchronization and race-related memory accesses, along with instruction counts for the traced memory operations. Replay enforces the same order by consulting the recorded timestamps and blocking threads until the current replay clock matches the recorded event order.

The paper emphasizes that exact race detection is NP-hard, but a sound superset of all real race pairs is sufficient for replay correctness. False positives affect efficiency rather than correctness, which is why automatic false-positive reduction is central. Initialization pruning and array cross-range checking reduce race warning sites substantially—by $m=2n+o(n)$3 for lu and $m=2n+o(n)$4 for ocean—and the resulting average recording slowdowns are $m=2n+o(n)$5, $m=2n+o(n)$6, $m=2n+o(n)$7, and $m=2n+o(n)$8 for $m=2n+o(n)$9-, $p=m-1>2n+1$0-, $p=m-1>2n+1$1-, and $p=m-1>2n+1$2-thread programs, respectively. In this literature, replay pairing denotes an explicit set of replay-relevant conflicting pairs whose dynamic order must be logged and reimposed to achieve value determinism.

7. Zero-interaction device pairing under replay attack

In secure pairing, replay pairing refers to a different issue: how to perform device pairing while resisting replay-related attacks. "FastZIP: Faster and More Secure Zero-Interaction Pairing" (Fomichev et al., 2021) studies zero-interaction pairing for co-located devices that derive shared secrets from common physical context. The paper argues that prior ZIP schemes are vulnerable because they rely on single-sensor context and fuzzy commitments whose security depends directly on the entropy of the fingerprint. This creates long pairing times, vulnerability to offline attack, and susceptibility to predictable-context attacks such as replay.

FastZIP’s response is twofold: use fPAKE instead of direct fuzzy commitments, and use sensor fusion. In prior fuzzy-commitment style ZIP, Device A transmits

$p=m-1>2n+1$3

where $p=m-1>2n+1$4 is a context fingerprint. FastZIP instead runs fPAKE on fingerprint bits, then uses a fuzzy-commitment phase protected by PAKE-derived keys. Pairing in the in-car instantiation draws on accelerometer, gyroscope, and barometer signals. An activity filter removes low-entropy windows, quantization converts each modality into a bitstring, and sensor-fused fingerprints are used in key exchange.

Replay is evaluated directly. The paper considers unsynchronized replay and roughly synchronized replay, as well as similar-context attacks. Its empirical result is that any single sensor alone is insufficient to prevent replay: in the stronger replay setting all sensors have false acceptance rate above $p=m-1>2n+1$5, and barometer-based pairing reaches false acceptance rate up to $p=m-1>2n+1$6 under roughly timeline-synchronized replay. Sensor fusion is decisive: using more than two sensors drives replay false acceptance rate to zero in the experiments, while adversarial error rates fall below $p=m-1>2n+1$7. Pairing time is also reduced: FastZIP achieves up to three times shorter pairing time than state-of-the-art ZIP schemes and, in most fused settings, requires $p=m-1>2n+1$8–$p=m-1>2n+1$9 seconds rather than minutes or hours.

A key limitation remains that replay resistance is partly empirical. The paper does not present an end-to-end universal proof against all physically realizable context manipulation, and its guarantees depend on the chosen modalities and their independence. Even so, it establishes a clear meaning of replay pairing in security: pairing protocols must be robust not only to transcript capture, but also to replayed or approximately reproduced physical context.