Bounds on user repair after context loss in AI handoffs

Long-running artificial intelligence (AI) conversations can lose permissions, commitments, or goals when they cross model and context boundaries. This theoretical paper asks when bounded system recovery makes external user repair necessary. We propose a provenance-bearing register of governing constraints and derive a lower bound combining graded continuity shortfall with unrecoverable hard constraints. The bound requires valid recovery ceilings and need not be achievable by an actual policy. A joint feasible-recovery formulation characterizes the minimum repair within the model, while a finite-action formulation handles discrete retrieval, model choices, and complementary actions. Smooth resource allocation is treated as a special case. An author-constructed coding-assistant example illustrates how broad recall and constraint preservation can disagree. A synthetic sensitivity analysis varies weights, thresholds, hard status, and recovery access; it establishes conditional robustness within the example, not classification accuracy on real conversations. Supplementary materials provide the calculation code, a coding manual, a weight-elicitation instrument, and a prospective validation protocol. No independent rater study, model benchmark, or human-participant evaluation is reported. The contribution is a testable account of how a declared architecture can externalize continuity work, with practical validity dependent on reliable coding and defensible recovery bounds.

Authors

Publication Details

Journal
Discover Informatics
Published
2026-10-28
DOI
https://doi.org/10.1007/s44564-026-00035-w
Primary Topic
Speech and dialogue systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bounds on user repair after context loss in AI handoffs

Lars Rönnbäck
Discover Informatics
Speech and dialogue systems
article

Bounds on user repair after context loss in AI handoffs

Lars Rönnbäck
article en

Abstract

Long-running artificial intelligence (AI) conversations can lose permissions, commitments, or goals when they cross model and context boundaries. This theoretical paper asks when bounded system recovery makes external user repair necessary. We propose a provenance-bearing register of governing constraints and derive a lower bound combining graded continuity shortfall with unrecoverable hard constraints. The bound requires valid recovery ceilings and need not be achievable by an actual policy. A joint feasible-recovery formulation characterizes the minimum repair within the model, while a finite-action formulation handles discrete retrieval, model choices, and complementary actions. Smooth resource allocation is treated as a special case. An author-constructed coding-assistant example illustrates how broad recall and constraint preservation can disagree. A synthetic sensitivity analysis varies weights, thresholds, hard status, and recovery access; it establishes conditional robustness within the example, not classification accuracy on real conversations. Supplementary materials provide the calculation code, a coding manual, a weight-elicitation instrument, and a prospective validation protocol. No independent rater study, model benchmark, or human-participant evaluation is reported. The contribution is a testable account of how a declared architecture can externalize continuity work, with practical validity dependent on reliable coding and defensible recovery bounds.

Discover InformaticsVol. 1(1)
Openalex Percentile: Top 13%
Speech and dialogue systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon