{"abstract":"A radius query includes points beyond the radius.","category":"Vector retrieval ranking","checks":6,"contract":"Given [id,distance] and radius, retain distance <= radius in nearest-first order.","contract_signature":"rows, radius","evaluation_group":"vector-retrieval-distance-radius","failed_approach":"An expanded radius admits an out-of-range point.","family":"w3-vector-retrieval-ranking-distance-radius","id":"FA-99501","implementations":{"attempt":{"sha256":"8bf954a0afd94f5b2aa46d1274fc38c7cc3d213ce79b357b8e122d6b7ede5ec6","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(rows, radius):\n return [r[0] for r in sorted(rows,key=lambda r:r[1]) if r[1]=radius]\ndef check(label, actual, expected):\n observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('inside and outside',solve([['in',N-1],['out',N+1]],N),['in'])\ncheck('boundary included',solve([['edge',N]],N),['edge'])\ncheck('origin',solve([['zero',0],['far',N+2]],0),['zero'])\ncheck('none',solve([['x',N+1]],N),[])\ncheck('multiple sorted',solve([['b',N-1],['a',N-2],['c',N+2]],N),['a','b'])\ncheck('empty',solve([],N),[])\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":"Inputs are small exact toy vectors and scores. No production index, ANN recall, embedding quality, or latency claim is implied. 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":"w3-vector-retrieval-ranking-distance-radius","generated_at":"2026-09-30T16:48:24.912892+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"An offline vector retrieval toy model isolates one ranking contract from embedding generation, storage, and serving.","root_cause":"The radius test selects outside points or expands the boundary.","sha256":"9b6b02b57153e70e3b19c42e2257f7942af066b280261e233c57c6ce8c82ceb1","title":"Vector retrieval: A radius query includes points beyond the radius ยท case 01","variant":1,"variant_policy":"The fixture code references N, supplied as 1 through 5. Fixed boundary checks may repeat. These records share one mechanism and must remain together in evaluation splits.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":28.246,"exit_code":1,"observations":[{"actual":["in"],"check":"inside and outside","expected":["in"],"passed":true},{"actual":[],"check":"boundary included","expected":["edge"],"passed":false},{"actual":[],"check":"origin","expected":["zero"],"passed":false},{"actual":[],"check":"none","expected":[],"passed":true},{"actual":["a","b"],"check":"multiple sorted","expected":["a","b"],"passed":true},{"actual":[],"check":"empty","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"inside and outside\", \"actual\": [\"in\"], \"expected\": [\"in\"], \"passed\": true}, {\"check\": \"boundary included\", \"actual\": [], \"expected\": [\"edge\"], \"passed\": false}, {\"check\": \"origin\", \"actual\": [], \"expected\": [\"zero\"], \"passed\": false}, {\"check\": \"none\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"multiple sorted\", \"actual\": [\"a\", \"b\"], \"expected\": [\"a\", \"b\"], \"passed\": true}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":26.821,"exit_code":1,"observations":[{"actual":["out"],"check":"inside and outside","expected":["in"],"passed":false},{"actual":["edge"],"check":"boundary included","expected":["edge"],"passed":true},{"actual":["zero","far"],"check":"origin","expected":["zero"],"passed":false},{"actual":["x"],"check":"none","expected":[],"passed":false},{"actual":["c"],"check":"multiple sorted","expected":["a","b"],"passed":false},{"actual":[],"check":"empty","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"inside and outside\", \"actual\": [\"out\"], \"expected\": [\"in\"], \"passed\": false}, {\"check\": \"boundary included\", \"actual\": [\"edge\"], \"expected\": [\"edge\"], \"passed\": true}, {\"check\": \"origin\", \"actual\": [\"zero\", \"far\"], \"expected\": [\"zero\"], \"passed\": false}, {\"check\": \"none\", \"actual\": [\"x\"], \"expected\": [], \"passed\": false}, {\"check\": \"multiple sorted\", \"actual\": [\"c\"], \"expected\": [\"a\", \"b\"], \"passed\": false}, {\"check\": \"empty\", \"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."}}