FA-99731 / Chunk citation alignment / Open access
Citations crossing deleted text keep an invalid range · case 01
Citations crossing deleted text keep an invalid range.
ROOT CAUSE
Deletion displacement is applied only to citations starting after the deleted region.
THE FAILURE
Deletion displacement is applied only to citations starting after the deleted region.
Unsuccessful approach: Shifting only the end leaves citations starting after the deletion at their old start offset.
Case contract
Given citation [s,e) and deletion [p,q), map endpoints through removal: points <=p unchanged, >=q shift left by q-p, inside map to p; return resulting pair.
Why this case matters
A deterministic citation bookkeeping model isolates source attribution from rendering and retrieval.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(span, p, q):
s,e=span
return [s,e]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('after delete',solve([N+5,N+8],N,N+3),[N+2,N+5])
check('crossing',solve([N-2,N+5],N,N+3),[N-2,N+2])
check('inside deletion',solve([N+1,N+2],N,N+3),[N,N])
check('before deletion',solve([0,2],N+3,N+5),[0,2])
check('touch left',solve([N-2,N],N,N+3),[N-2,N])
check('touch right',solve([N+3,N+5],N,N+3),[N,N+2])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| after delete | [6, 9] | [3, 6] | Failed |
| crossing | [-1, 6] | [-1, 3] | Failed |
| inside deletion | [2, 3] | [1, 1] | Failed |
| before deletion | [0, 2] | [0, 2] | Passed |
| touch left | [-1, 1] | [-1, 1] | Passed |
| touch right | [4, 6] | [1, 3] | Failed |
SHA-256 / be91db2c0158ceb192a61113c88be0cf390f901383a2235d470f71425bd96c6c
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(span, p, q):
s,e=span
return [max(s,p),e-(q-p) if e>=q else e]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('after delete',solve([N+5,N+8],N,N+3),[N+2,N+5])
check('crossing',solve([N-2,N+5],N,N+3),[N-2,N+2])
check('inside deletion',solve([N+1,N+2],N,N+3),[N,N])
check('before deletion',solve([0,2],N+3,N+5),[0,2])
check('touch left',solve([N-2,N],N,N+3),[N-2,N])
check('touch right',solve([N+3,N+5],N,N+3),[N,N+2])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| after delete | [6, 6] | [3, 6] | Failed |
| crossing | [1, 3] | [-1, 3] | Failed |
| inside deletion | [2, 3] | [1, 1] | Failed |
| before deletion | [4, 2] | [0, 2] | Failed |
| touch left | [1, 1] | [-1, 1] | Failed |
| touch right | [4, 3] | [1, 3] | Failed |
SHA-256 / 8f51e6375434d63a639b6c469444ff86a23b12486c228dce504da38dce849aee
HELD IN THE MEMBER ARCHIVE
The verified repair and its recorded checks are member-only.
This mechanism has 6 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.
Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.
Member access is invitation-based. Sign in with your invited account to inspect the repair.
Sign in to the archive ↗Verification & scope
Inputs are small integer offsets and identifiers under the stated toy contract; this does not define a document format or production citation API. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.
Observations recorded using Python 3.12.14 at 2026-09-30T16:48:27.615308+00:00.
Case digest / 785e4aa07d94384c7acefd0063f787fc93b20fcacea89e64b7b8aac846173b8f