{"abstract":"A descendant remains exposed despite a hidden container.","category":"Accessibility interaction semantics","checks":6,"contract":"Input is preorder [id,parent_id,hidden] for a forest with unique IDs and parents preceding children. Return exposed IDs in input order; any hidden ancestor excludes a node even if its own hidden flag is false.","evaluation_group":"model-dc82e5cad2f85c18","failed_approach":"Checking only the immediate parent still exposes grandchildren of a hidden node.","family":"z-accessibility-hidden-inheritance","id":"FA-11391","implementations":{"attempt":{"sha256":"51044f99f38625973eac4598bf69feb73f032f90190f14adc4eaab927f64196d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(nodes):\n    flags = {ident: hidden for ident, parent, hidden in nodes}\n    return [ident for ident, parent, hidden in nodes if not hidden and not flags.get(parent, False)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('hidden grandparent', solve([('a',None,True),('b','a',False),(str(N),'b',False)]), [])\ncheck('hidden parent', solve([('a',None,True),(str(N),'a',False)]), [])\ncheck('visible ancestors', solve([('a',None,False),(str(N),'a',False)]), ['a',str(N)])\ncheck('hidden leaf', solve([('a',None,False),(str(N),'a',True)]), ['a'])\ncheck('independent roots', solve([('a',None,True),(str(N),None,False)]), [str(N)])\ncheck('empty forest', solve([]), [])\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":"5b3bc5c32f6190d4e8ca1be1fa67d580dfdda8f2c4a9a194a138fb9e12ff3392","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(nodes):\n    return [ident for ident, parent, hidden in nodes if not hidden]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('hidden grandparent', solve([('a',None,True),('b','a',False),(str(N),'b',False)]), [])\ncheck('hidden parent', solve([('a',None,True),(str(N),'a',False)]), [])\ncheck('visible ancestors', solve([('a',None,False),(str(N),'a',False)]), ['a',str(N)])\ncheck('hidden leaf', solve([('a',None,False),(str(N),'a',True)]), ['a'])\ncheck('independent roots', solve([('a',None,True),(str(N),None,False)]), [str(N)])\ncheck('empty forest', solve([]), [])\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"},"fixed":{"sha256":"5b1cd697dce82c1162e788a12f4b59281b44707ac9a69695b6ce8834df48ce2a","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(nodes):\n    excluded = {}\n    result = []\n    for ident, parent, hidden in nodes:\n        excluded[ident] = hidden or excluded.get(parent, False)\n        if not excluded[ident]: result.append(ident)\n    return result\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('hidden grandparent', solve([('a',None,True),('b','a',False),(str(N),'b',False)]), [])\ncheck('hidden parent', solve([('a',None,True),(str(N),'a',False)]), [])\ncheck('visible ancestors', solve([('a',None,False),(str(N),'a',False)]), ['a',str(N)])\ncheck('hidden leaf', solve([('a',None,False),(str(N),'a',True)]), ['a'])\ncheck('independent roots', solve([('a',None,True),(str(N),None,False)]), [str(N)])\ncheck('empty forest', solve([]), [])\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":" 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":"z-accessibility-hidden-inheritance","generated_at":"2026-09-29T14:38:47.447501+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A controlled offline accessibility-data model. It isolates the stated contract; it does not simulate browser accessibility APIs or claim full ARIA conformance.","repair":"Carry the inherited hidden state through every ancestor.","root_cause":"Each node is filtered independently instead of pruning hidden subtrees.","sha256":"7c7e936550c8f54676a80b1990bd679b64416da90f8d68ce30674025a82c25f9","title":"A visible child escapes a hidden ancestor · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":40.689,"exit_code":1,"observations":[{"actual":["1"],"check":"hidden grandparent","expected":[],"passed":false},{"actual":[],"check":"hidden parent","expected":[],"passed":true},{"actual":["a","1"],"check":"visible ancestors","expected":["a","1"],"passed":true},{"actual":["a"],"check":"hidden leaf","expected":["a"],"passed":true},{"actual":["1"],"check":"independent roots","expected":["1"],"passed":true},{"actual":[],"check":"empty forest","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"hidden grandparent\", \"actual\": [\"1\"], \"expected\": [], \"passed\": false}, {\"check\": \"hidden parent\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"visible ancestors\", \"actual\": [\"a\", \"1\"], \"expected\": [\"a\", \"1\"], \"passed\": true}, {\"check\": \"hidden leaf\", \"actual\": [\"a\"], \"expected\": [\"a\"], \"passed\": true}, {\"check\": \"independent roots\", \"actual\": [\"1\"], \"expected\": [\"1\"], \"passed\": true}, {\"check\": \"empty forest\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":42.368,"exit_code":1,"observations":[{"actual":["b","1"],"check":"hidden grandparent","expected":[],"passed":false},{"actual":["1"],"check":"hidden parent","expected":[],"passed":false},{"actual":["a","1"],"check":"visible ancestors","expected":["a","1"],"passed":true},{"actual":["a"],"check":"hidden leaf","expected":["a"],"passed":true},{"actual":["1"],"check":"independent roots","expected":["1"],"passed":true},{"actual":[],"check":"empty forest","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"hidden grandparent\", \"actual\": [\"b\", \"1\"], \"expected\": [], \"passed\": false}, {\"check\": \"hidden parent\", \"actual\": [\"1\"], \"expected\": [], \"passed\": false}, {\"check\": \"visible ancestors\", \"actual\": [\"a\", \"1\"], \"expected\": [\"a\", \"1\"], \"passed\": true}, {\"check\": \"hidden leaf\", \"actual\": [\"a\"], \"expected\": [\"a\"], \"passed\": true}, {\"check\": \"independent roots\", \"actual\": [\"1\"], \"expected\": [\"1\"], \"passed\": true}, {\"check\": \"empty forest\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":40.973,"exit_code":0,"observations":[{"actual":[],"check":"hidden grandparent","expected":[],"passed":true},{"actual":[],"check":"hidden parent","expected":[],"passed":true},{"actual":["a","1"],"check":"visible ancestors","expected":["a","1"],"passed":true},{"actual":["a"],"check":"hidden leaf","expected":["a"],"passed":true},{"actual":["1"],"check":"independent roots","expected":["1"],"passed":true},{"actual":[],"check":"empty forest","expected":[],"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"hidden grandparent\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"hidden parent\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"visible ancestors\", \"actual\": [\"a\", \"1\"], \"expected\": [\"a\", \"1\"], \"passed\": true}, {\"check\": \"hidden leaf\", \"actual\": [\"a\"], \"expected\": [\"a\"], \"passed\": true}, {\"check\": \"independent roots\", \"actual\": [\"1\"], \"expected\": [\"1\"], \"passed\": true}, {\"check\": \"empty forest\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}