FA-99721 / Chunk citation alignment / Open access

An obsolete source revision wins citation resolution · case 01

An obsolete source revision wins citation resolution.

Verified by executionVariant 1 · 6 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

The first matching source ID is accepted without checking its revision.

THE FAILURE

The first matching source ID is accepted without checking its revision.

Unsuccessful approach: Choosing the newest revision globally returns an unrelated source when multiple IDs exist.

Case contract

Rows [logical_id,revision,uri]; request one logical ID; return URI at its greatest revision or None.

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(rows, logical_id):
    return next((uri for ident,rev,uri in rows if ident==logical_id),None)
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('new version',solve([['a',1,'old'],['a',N+1,'new']],'a'),'new')
check('other newest ID',solve([['a',1,'wanted'],['b',N+2,'other']],'a'),'wanted')
check('missing',solve([['a',1,'x']],'z'),None)
check('empty',solve([],'a'),None)
check('single',solve([['q',N,'uri']],'q'),'uri')
check('unordered',solve([['a',3,'new'],['a',2,'old']],'a'),'new')
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
new version	`old`	`new`	Failed
other newest ID	`wanted`	`wanted`	Passed
missing	`None`	`None`	Passed
empty	`None`	`None`	Passed
single	`uri`	`uri`	Passed
unordered	`new`	`new`	Passed

SHA-256 / 201796e6169b58960f790ea7b9777aec24e86206c6e774aa56f72bf3b72e9fd2

2 / The unsuccessful fix

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(rows, logical_id):
    return max(rows,key=lambda r:r[1])[2] if rows else None
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('new version',solve([['a',1,'old'],['a',N+1,'new']],'a'),'new')
check('other newest ID',solve([['a',1,'wanted'],['b',N+2,'other']],'a'),'wanted')
check('missing',solve([['a',1,'x']],'z'),None)
check('empty',solve([],'a'),None)
check('single',solve([['q',N,'uri']],'q'),'uri')
check('unordered',solve([['a',3,'new'],['a',2,'old']],'a'),'new')
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
new version	`new`	`new`	Passed
other newest ID	`other`	`wanted`	Failed
missing	`x`	`None`	Failed
empty	`None`	`None`	Passed
single	`uri`	`uri`	Passed
unordered	`new`	`new`	Passed

SHA-256 / bf09e1f88a2f740b9bad1ad066a23da709bae0ebf73234d81ca2774c4af62608

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.

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.615490+00:00.

Case digest / 1e18cb1878ade0934739e19bd3ce51dc10a63ed457885a2eaf224b1d58d39ba7