{"abstract":"Recursive query omits the requested final expansion depth.","category":"Data systems","checks":7,"contract":"Evaluate a bounded recursive UNION ALL query. Anchors are integer values; each frontier value joins all rules [source,target], preserving duplicate anchors and duplicate rules. Emit [depth,value] for depth zero through max-depth, expanding only the newest frontier. Preserve anchor and rule encounter order.","contract_signature":"d","evaluation_group":"s3-data-systems-recursive-bag-frontier","failed_approach":"Clamping the stop does not restore the inclusive maximum depth.","family":"s3-data-systems-recursive-bag-frontier-depth-bound","id":"FA-45796","implementations":{"attempt":{"sha256":"6a047c506f642423afee69008ab8d5125c1545d9d65c279b16851afb86389b5a","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(d):\n    try:\n        anchors,rules,depth_limit=d\n        frontier=list(anchors); result=[[0,v] for v in frontier]\n        for depth in range(1,max(1,depth_limit)):\n            next_rows=[]\n            for value in frontier:\n                for source,target in rules:\n                    if source==value: next_rows.append(target)\n            result.extend([[depth,v] for v in next_rows])\n            frontier=next_rows\n        return result\n    except (IndexError, KeyError, ValueError, StopIteration) as exc:\n        return {\"representation_error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nif N == 1:\n    check('chain frontier', solve([[1], [[1, 2], [2, 3]], 2]), [[0, 1], [1, 2], [2, 3]])\n    check('duplicate anchors', solve([[1, 1], [[1, 2]], 1]), [[0, 1], [0, 1], [1, 2], [1, 2]])\n    check('duplicate rules', solve([[1], [[1, 2], [1, 2]], 1]), [[0, 1], [1, 2], [1, 2]])\n    check('zero depth', solve([[1], [[1, 2]], 0]), [[0, 1]])\n    check('reverse nonedge', solve([[2], [[1, 2]], 1]), [[0, 2]])\n    check('bounded cycle', solve([[1], [[1, 1]], 2]), [[0, 1], [1, 1], [2, 1]])\n    check('empty anchor', solve([[], [[1, 2]], 2]), [])\nelif N == 2:\n    check('chain frontier', solve([[2], [[2, 3], [3, 4]], 2]), [[0, 2], [1, 3], [2, 4]])\n    check('duplicate anchors', solve([[2, 2], [[2, 3]], 1]), [[0, 2], [0, 2], [1, 3], [1, 3]])\n    check('duplicate rules', solve([[2], [[2, 3], [2, 3]], 1]), [[0, 2], [1, 3], [1, 3]])\n    check('zero depth', solve([[2], [[2, 3]], 0]), [[0, 2]])\n    check('reverse nonedge', solve([[3], [[2, 3]], 1]), [[0, 3]])\n    check('bounded cycle', solve([[2], [[2, 2]], 2]), [[0, 2], [1, 2], [2, 2]])\n    check('empty anchor', solve([[], [[2, 3]], 2]), [])\nelif N == 3:\n    check('chain frontier', solve([[3], [[3, 4], [4, 5]], 2]), [[0, 3], [1, 4], [2, 5]])\n    check('duplicate anchors', solve([[3, 3], [[3, 4]], 1]), [[0, 3], [0, 3], [1, 4], [1, 4]])\n    check('duplicate rules', solve([[3], [[3, 4], [3, 4]], 1]), [[0, 3], [1, 4], [1, 4]])\n    check('zero depth', solve([[3], [[3, 4]], 0]), [[0, 3]])\n    check('reverse nonedge', solve([[4], [[3, 4]], 1]), [[0, 4]])\n    check('bounded cycle', solve([[3], [[3, 3]], 2]), [[0, 3], [1, 3], [2, 3]])\n    check('empty anchor', solve([[], [[3, 4]], 2]), [])\nelif N == 4:\n    check('chain frontier', solve([[4], [[4, 5], [5, 6]], 2]), [[0, 4], [1, 5], [2, 6]])\n    check('duplicate anchors', solve([[4, 4], [[4, 5]], 1]), [[0, 4], [0, 4], [1, 5], [1, 5]])\n    check('duplicate rules', solve([[4], [[4, 5], [4, 5]], 1]), [[0, 4], [1, 5], [1, 5]])\n    check('zero depth', solve([[4], [[4, 5]], 0]), [[0, 4]])\n    check('reverse nonedge', solve([[5], [[4, 5]], 1]), [[0, 5]])\n    check('bounded cycle', solve([[4], [[4, 4]], 2]), [[0, 4], [1, 4], [2, 4]])\n    check('empty anchor', solve([[], [[4, 5]], 2]), [])\nelif N == 5:\n    check('chain frontier', solve([[5], [[5, 6], [6, 7]], 2]), [[0, 5], [1, 6], [2, 7]])\n    check('duplicate anchors', solve([[5, 5], [[5, 6]], 1]), [[0, 5], [0, 5], [1, 6], [1, 6]])\n    check('duplicate rules', solve([[5], [[5, 6], [5, 6]], 1]), [[0, 5], [1, 6], [1, 6]])\n    check('zero depth', solve([[5], [[5, 6]], 0]), [[0, 5]])\n    check('reverse nonedge', solve([[6], [[5, 6]], 1]), [[0, 6]])\n    check('bounded cycle', solve([[5], [[5, 5]], 2]), [[0, 5], [1, 5], [2, 5]])\n    check('empty anchor', solve([[], [[5, 6]], 2]), [])\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"f298323b44c28fa0a2599841a7feb4aa4746cb4ce0916033a594d358b749b7ad","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(d):\n    try:\n        anchors,rules,depth_limit=d\n        frontier=list(anchors); result=[[0,v] for v in frontier]\n        for depth in range(1,depth_limit):\n            next_rows=[]\n            for value in frontier:\n                for source,target in rules:\n                    if source==value: next_rows.append(target)\n            result.extend([[depth,v] for v in next_rows])\n            frontier=next_rows\n        return result\n    except (IndexError, KeyError, ValueError, StopIteration) as exc:\n        return {\"representation_error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nif N == 1:\n    check('chain frontier', solve([[1], [[1, 2], [2, 3]], 2]), [[0, 1], [1, 2], [2, 3]])\n    check('duplicate anchors', solve([[1, 1], [[1, 2]], 1]), [[0, 1], [0, 1], [1, 2], [1, 2]])\n    check('duplicate rules', solve([[1], [[1, 2], [1, 2]], 1]), [[0, 1], [1, 2], [1, 2]])\n    check('zero depth', solve([[1], [[1, 2]], 0]), [[0, 1]])\n    check('reverse nonedge', solve([[2], [[1, 2]], 1]), [[0, 2]])\n    check('bounded cycle', solve([[1], [[1, 1]], 2]), [[0, 1], [1, 1], [2, 1]])\n    check('empty anchor', solve([[], [[1, 2]], 2]), [])\nelif N == 2:\n    check('chain frontier', solve([[2], [[2, 3], [3, 4]], 2]), [[0, 2], [1, 3], [2, 4]])\n    check('duplicate anchors', solve([[2, 2], [[2, 3]], 1]), [[0, 2], [0, 2], [1, 3], [1, 3]])\n    check('duplicate rules', solve([[2], [[2, 3], [2, 3]], 1]), [[0, 2], [1, 3], [1, 3]])\n    check('zero depth', solve([[2], [[2, 3]], 0]), [[0, 2]])\n    check('reverse nonedge', solve([[3], [[2, 3]], 1]), [[0, 3]])\n    check('bounded cycle', solve([[2], [[2, 2]], 2]), [[0, 2], [1, 2], [2, 2]])\n    check('empty anchor', solve([[], [[2, 3]], 2]), [])\nelif N == 3:\n    check('chain frontier', solve([[3], [[3, 4], [4, 5]], 2]), [[0, 3], [1, 4], [2, 5]])\n    check('duplicate anchors', solve([[3, 3], [[3, 4]], 1]), [[0, 3], [0, 3], [1, 4], [1, 4]])\n    check('duplicate rules', solve([[3], [[3, 4], [3, 4]], 1]), [[0, 3], [1, 4], [1, 4]])\n    check('zero depth', solve([[3], [[3, 4]], 0]), [[0, 3]])\n    check('reverse nonedge', solve([[4], [[3, 4]], 1]), [[0, 4]])\n    check('bounded cycle', solve([[3], [[3, 3]], 2]), [[0, 3], [1, 3], [2, 3]])\n    check('empty anchor', solve([[], [[3, 4]], 2]), [])\nelif N == 4:\n    check('chain frontier', solve([[4], [[4, 5], [5, 6]], 2]), [[0, 4], [1, 5], [2, 6]])\n    check('duplicate anchors', solve([[4, 4], [[4, 5]], 1]), [[0, 4], [0, 4], [1, 5], [1, 5]])\n    check('duplicate rules', solve([[4], [[4, 5], [4, 5]], 1]), [[0, 4], [1, 5], [1, 5]])\n    check('zero depth', solve([[4], [[4, 5]], 0]), [[0, 4]])\n    check('reverse nonedge', solve([[5], [[4, 5]], 1]), [[0, 5]])\n    check('bounded cycle', solve([[4], [[4, 4]], 2]), [[0, 4], [1, 4], [2, 4]])\n    check('empty anchor', solve([[], [[4, 5]], 2]), [])\nelif N == 5:\n    check('chain frontier', solve([[5], [[5, 6], [6, 7]], 2]), [[0, 5], [1, 6], [2, 7]])\n    check('duplicate anchors', solve([[5, 5], [[5, 6]], 1]), [[0, 5], [0, 5], [1, 6], [1, 6]])\n    check('duplicate rules', solve([[5], [[5, 6], [5, 6]], 1]), [[0, 5], [1, 6], [1, 6]])\n    check('zero depth', solve([[5], [[5, 6]], 0]), [[0, 5]])\n    check('reverse nonedge', solve([[6], [[5, 6]], 1]), [[0, 6]])\n    check('bounded cycle', solve([[5], [[5, 5]], 2]), [[0, 5], [1, 5], [2, 5]])\n    check('empty anchor', solve([[], [[5, 6]], 2]), [])\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":"Offline stipulated semantics over valid small inputs; no performance, concurrency, or production-engine conformance claim. 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.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"s3-data-systems-recursive-bag-frontier-depth-bound","generated_at":"2026-09-29T14:44:25.858506+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A bounded deterministic data engine model makes representation and changelog faults reproducible.","root_cause":"recursive-bag-frontier: Recursive query omits the requested final expansion depth.","sha256":"55501d01cf1e6dc28c6e53f93ede2173f09341027ead8f729eba4074ab1f12c7","title":"Recursive query omits the requested final expansion depth · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":46.005,"exit_code":1,"observations":[{"actual":[[0,1],[1,2]],"check":"chain frontier","expected":[[0,1],[1,2],[2,3]],"passed":false},{"actual":[[0,1],[0,1]],"check":"duplicate anchors","expected":[[0,1],[0,1],[1,2],[1,2]],"passed":false},{"actual":[[0,1]],"check":"duplicate rules","expected":[[0,1],[1,2],[1,2]],"passed":false},{"actual":[[0,1]],"check":"zero depth","expected":[[0,1]],"passed":true},{"actual":[[0,2]],"check":"reverse nonedge","expected":[[0,2]],"passed":true},{"actual":[[0,1],[1,1]],"check":"bounded cycle","expected":[[0,1],[1,1],[2,1]],"passed":false},{"actual":[],"check":"empty anchor","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"chain frontier\", \"actual\": [[0, 1], [1, 2]], \"expected\": [[0, 1], [1, 2], [2, 3]], \"passed\": false}, {\"check\": \"duplicate anchors\", \"actual\": [[0, 1], [0, 1]], \"expected\": [[0, 1], [0, 1], [1, 2], [1, 2]], \"passed\": false}, {\"check\": \"duplicate rules\", \"actual\": [[0, 1]], \"expected\": [[0, 1], [1, 2], [1, 2]], \"passed\": false}, {\"check\": \"zero depth\", \"actual\": [[0, 1]], \"expected\": [[0, 1]], \"passed\": true}, {\"check\": \"reverse nonedge\", \"actual\": [[0, 2]], \"expected\": [[0, 2]], \"passed\": true}, {\"check\": \"bounded cycle\", \"actual\": [[0, 1], [1, 1]], \"expected\": [[0, 1], [1, 1], [2, 1]], \"passed\": false}, {\"check\": \"empty anchor\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":45.272,"exit_code":1,"observations":[{"actual":[[0,1],[1,2]],"check":"chain frontier","expected":[[0,1],[1,2],[2,3]],"passed":false},{"actual":[[0,1],[0,1]],"check":"duplicate anchors","expected":[[0,1],[0,1],[1,2],[1,2]],"passed":false},{"actual":[[0,1]],"check":"duplicate rules","expected":[[0,1],[1,2],[1,2]],"passed":false},{"actual":[[0,1]],"check":"zero depth","expected":[[0,1]],"passed":true},{"actual":[[0,2]],"check":"reverse nonedge","expected":[[0,2]],"passed":true},{"actual":[[0,1],[1,1]],"check":"bounded cycle","expected":[[0,1],[1,1],[2,1]],"passed":false},{"actual":[],"check":"empty anchor","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"chain frontier\", \"actual\": [[0, 1], [1, 2]], \"expected\": [[0, 1], [1, 2], [2, 3]], \"passed\": false}, {\"check\": \"duplicate anchors\", \"actual\": [[0, 1], [0, 1]], \"expected\": [[0, 1], [0, 1], [1, 2], [1, 2]], \"passed\": false}, {\"check\": \"duplicate rules\", \"actual\": [[0, 1]], \"expected\": [[0, 1], [1, 2], [1, 2]], \"passed\": false}, {\"check\": \"zero depth\", \"actual\": [[0, 1]], \"expected\": [[0, 1]], \"passed\": true}, {\"check\": \"reverse nonedge\", \"actual\": [[0, 2]], \"expected\": [[0, 2]], \"passed\": true}, {\"check\": \"bounded cycle\", \"actual\": [[0, 1], [1, 1]], \"expected\": [[0, 1], [1, 1], [2, 1]], \"passed\": false}, {\"check\": \"empty anchor\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"}},"member_only":{"stages":["fixed"],"fields":["implementations.fixed","verification.fixed","harness","repair"],"note":"The verified repair, its recorded checks, the repair description, and the scoring harness are available to members."}}