6 of 6 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 2 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2308.05862.json · badge: /api/ran/2308.05862.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| junma11/flare | canonical (classifier label) classifier basis: census |
6 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| check_dir | Ran ran, violated the contract we drafted |
junma11/flare/FLARE23/resource_eval.py code served (permissive licence) · get_code("658a889255ae9e3f") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned bool, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| compute_average_surface_distance | Ran ran, honoured the contract we drafted |
junma11/flare/FLARE23/SurfaceDice.py pointer only (licence: MIT); the stored copy get_code serves, from wjh892521292/lkm-unet, is pointer only (licence: NONE) · get_code("cf3ad2dd74663e2e") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from wjh892521292/lkm-unet, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| compute_robust_hausdorff | Ran ran, honoured the contract we drafted |
junma11/flare/FLARE23/SurfaceDice.py pointer only (licence: MIT); the stored copy get_code serves, from wjh892521292/lkm-unet, is pointer only (licence: NONE) · get_code("b9353805b904f7d9") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from wjh892521292/lkm-unet, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| compute_surface_distances | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
junma11/flare/FLARE23/SurfaceDice.py pointer only (licence: MIT); the stored copy get_code serves, from wjh892521292/lkm-unet, is pointer only (licence: NONE) · get_code("7dc01eff6c76b4c8") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from wjh892521292/lkm-unet, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| find_lower_upper_zbound | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
junma11/flare/FLARE24/T2andT3_FLARE24_DSC_NSD_Eval.py pointer only (licence: MIT); the stored copy get_code serves, from wjh892521292/lkm-unet, is pointer only (licence: NONE) · get_code("f5db63a2c8eac83a") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from wjh892521292/lkm-unet, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| find_lower_upper_zbound | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
junma11/flare/FLARE23/FLARE23_DSC_NSD_Eval.py code served (permissive licence) · get_code("5c4a79a97bc303fa") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple, ndim 1, dtype family int; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 4 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 4 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| compute_average_surface_distance | 4 other papers 2 dated earlier, 2 later |
2004.12537 (2020-04) Towards Data-Efficient Learning: A Benchmark for COVID-19 CT Lung and Infection Segmentation |
2306.02416 (2023-06) Training Like a Medical Resident: Context-Prior Learning Toward Universal Medical Image Segmentation 2309.03906 (2023-09) A-Eval: A Benchmark for Cross-Dataset Evaluation of Abdominal Multi-Organ Segmentation and 1 more not named here |
| compute_robust_hausdorff | 4 other papers 2 dated earlier, 2 later |
2004.12537 (2020-04) Towards Data-Efficient Learning: A Benchmark for COVID-19 CT Lung and Infection Segmentation |
2306.02416 (2023-06) Training Like a Medical Resident: Context-Prior Learning Toward Universal Medical Image Segmentation 2309.03906 (2023-09) A-Eval: A Benchmark for Cross-Dataset Evaluation of Abdominal Multi-Organ Segmentation and 1 more not named here |
| compute_surface_distances | 3 other papers 1 dated earlier, 2 later |
2004.12537 (2020-04) Towards Data-Efficient Learning: A Benchmark for COVID-19 CT Lung and Infection Segmentation |
2309.03906 (2023-09) A-Eval: A Benchmark for Cross-Dataset Evaluation of Abdominal Multi-Organ Segmentation 2403.07332 (2024-03) LKM-UNet: Large Kernel Vision Mamba UNet for Medical Image Segmentation |
| find_lower_upper_zbound | 2 other papers 2 later |
2309.03906 (2023-09) A-Eval: A Benchmark for Cross-Dataset Evaluation of Abdominal Multi-Organ Segmentation |
2403.07332 (2024-03) LKM-UNet: Large Kernel Vision Mamba UNet for Medical Image Segmentation |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Quantitative organ assessment is an essential step in automated abdominal disease diagnosis and treatment planning. Artificial intelligence (AI) has shown great potential to automatize this process. However, most existing AI algorithms rely on many expert annotations and lack a comprehensive evaluation of accuracy and efficiency in real-world multinational settings. To overcome these limitations, we organized the FLARE 2022 Challenge, the largest abdominal organ analysis challenge to date, to benchmark fast, low-resource, accurate, annotation-efficient, and generalized AI algorithms. We constructed an intercontinental and multinational dataset from more than 50 medical groups, including Computed Tomography (CT) scans with different races, diseases, phases, and manufacturers. We independently validated that a set of AI algorithms achieved a median Dice Similarity Coefficient (DSC) of 90.0\% by using 50 labeled scans and 2000 unlabeled scans, which can significantly reduce annotation requirements. The best-performing algorithms successfully generalized to holdout external validation sets, achieving a median DSC of 89.5\%, 90.9\%, and 88.3\% on North American, European, and Asian cohorts, respectively. They also enabled automatic extraction of key organ biology features, which was labor-intensive with traditional manual measurements. This opens the potential to use unlabeled data to boost performance and alleviate annotation shortages for modern AI models.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2308.05862")
get_code_for_paper("2308.05862")
have("2308.05862")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2308.05862.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2308.05862)
Connect an agent — have() is free.