FA-36931 / Table interactions / Open access
Pinned table panes: right reservation · case 01
The table right reservation result violates the stipulated pinned table panes contract.
ROOT CAUSE
The right reservation decision uses 'sum(widths[x] for x in l),' instead of 'sum(widths[x] for x in r),'.
THE FAILURE
The right reservation decision uses 'sum(widths[x] for x in l),' instead of 'sum(widths[x] for x in r),'.
Unsuccessful approach: The attempted repair '0,' still loses a required part of the table contract.
Case contract
Partition visible schema columns into left, center, and right panes; left wins conflicting pin assignments. Pin order follows schema, left offsets are prefixes, right offsets suffixes, only center moves on scroll, reservations exclude hidden tracks.
Why this case matters
An offline table UI model isolates pinned table panes, including adversarial row/column relationships.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(ids, left, right, hidden, widths, scroll):
visible = [c for c in ids if c not in hidden]
l = [c for c in visible if c in left]
r = [c for c in visible if c in right and c not in left]
m = [c for c in visible if c not in left and c not in right]
lo = {c: sum(widths[x] for x in l[:i]) for i,c in enumerate(l)}
ro = {c: sum(widths[x] for x in r[i+1:]) for i,c in enumerate(r)}
mo = {c: sum(widths[x] for x in m[:i]) - scroll for i,c in enumerate(m)}
return [l,m,r,lo,ro,mo,sum(widths[x] for x in l),sum(widths[x] for x in l),l[-1:] if m or r else [],r[:1] if l or m else []]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
if N == 1:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*1,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 2}, {'d': 6, 'e': 0}, {'c': -3}, 5, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
if N == 2:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*2,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 4}, {'d': 6, 'e': 0}, {'c': -3}, 7, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
if N == 3:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*3,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 6}, {'d': 6, 'e': 0}, {'c': -3}, 9, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
if N == 4:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*4,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 8}, {'d': 6, 'e': 0}, {'c': -3}, 11, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
if N == 5:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*5,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 10}, {'d': 6, 'e': 0}, {'c': -3}, 13, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
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 |
|---|---|---|---|
| mixed panes | [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 2}, {'d': 6, 'e': 0}, {'c': -3}, 5, 5, ['b'], ['d']] | [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 2}, {'d': 6, 'e': 0}, {'c': -3}, 5, 10, ['b'], ['d']] | Failed |
| overlap priority | [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 6, ['b'], ['c']] | [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']] | Failed |
| hidden pins | [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []] | [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []] | Passed |
| only left | [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 6, [], []] | [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []] | Failed |
| only right | [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 0, [], []] | [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []] | Failed |
| empty | [[], [], [], {}, {}, {}, 0, 0, [], []] | [[], [], [], {}, {}, {}, 0, 0, [], []] | Passed |
SHA-256 / 8677e093ae48347864a43e70a970a3c6bc65be4d43f0dcf063f7fd8f1b7e355a
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(ids, left, right, hidden, widths, scroll):
visible = [c for c in ids if c not in hidden]
l = [c for c in visible if c in left]
r = [c for c in visible if c in right and c not in left]
m = [c for c in visible if c not in left and c not in right]
lo = {c: sum(widths[x] for x in l[:i]) for i,c in enumerate(l)}
ro = {c: sum(widths[x] for x in r[i+1:]) for i,c in enumerate(r)}
mo = {c: sum(widths[x] for x in m[:i]) - scroll for i,c in enumerate(m)}
return [l,m,r,lo,ro,mo,sum(widths[x] for x in l),0,l[-1:] if m or r else [],r[:1] if l or m else []]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
if N == 1:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*1,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 2}, {'d': 6, 'e': 0}, {'c': -3}, 5, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
if N == 2:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*2,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 4}, {'d': 6, 'e': 0}, {'c': -3}, 7, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
if N == 3:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*3,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 6}, {'d': 6, 'e': 0}, {'c': -3}, 9, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
if N == 4:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*4,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 8}, {'d': 6, 'e': 0}, {'c': -3}, 11, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
if N == 5:
check('mixed panes', solve(['a','b','c','d','e'], ['b','a'], ['d','e'], [], {'a':2*5,'b':3,'c':7,'d':4,'e':6}, 3), [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 10}, {'d': 6, 'e': 0}, {'c': -3}, 13, 10, ['b'], ['d']])
check('overlap priority', solve(['a','b','c'], ['a','b'], ['b','c'], [], {'a':2,'b':4,'c':8}, 1), [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']])
check('hidden pins', solve(['a','b','c'], ['a'], ['b'], ['a','b'], {'a':2,'b':4,'c':8}, 2), [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []])
check('only left', solve(['a','b'], ['a','b'], [], [], {'a':2,'b':4}, 0), [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []])
check('only right', solve(['a','b'], [], ['a','b'], [], {'a':2,'b':4}, 0), [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []])
check('empty', solve([], [], [], [], {}, 0), [[], [], [], {}, {}, {}, 0, 0, [], []])
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 |
|---|---|---|---|
| mixed panes | [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 2}, {'d': 6, 'e': 0}, {'c': -3}, 5, 0, ['b'], ['d']] | [['a', 'b'], ['c'], ['d', 'e'], {'a': 0, 'b': 2}, {'d': 6, 'e': 0}, {'c': -3}, 5, 10, ['b'], ['d']] | Failed |
| overlap priority | [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 0, ['b'], ['c']] | [['a', 'b'], [], ['c'], {'a': 0, 'b': 2}, {'c': 0}, {}, 6, 8, ['b'], ['c']] | Failed |
| hidden pins | [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []] | [[], ['c'], [], {}, {}, {'c': -2}, 0, 0, [], []] | Passed |
| only left | [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []] | [['a', 'b'], [], [], {'a': 0, 'b': 2}, {}, {}, 6, 0, [], []] | Passed |
| only right | [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 0, [], []] | [[], [], ['a', 'b'], {}, {'a': 4, 'b': 0}, {}, 0, 6, [], []] | Failed |
| empty | [[], [], [], {}, {}, {}, 0, 0, [], []] | [[], [], [], {}, {}, {}, 0, 0, [], []] | Passed |
SHA-256 / 165fffa664ceefb46437c69401f55904ff61f7245c2504d1ca67e215692ae318
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
Schema IDs are unique and every schema column has a nonnegative width. Deterministic offline table UI model; no browser, DOM, framework, or standards conformance is claimed. 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-29T14:42:56.257501+00:00.
Case digest / 4d4816b832b330fd2b81aac4728cfa1cde91868e87c67bd41bfbb04f534b6a80