2 of 3 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 1 no recorded run), measured 2026-11-21; 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/2004.11757.json · badge: /api/ran/2004.11757.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 |
|---|---|---|
| copy not recorded | community not in the paper's declared repositories |
1 ran · 1 no recorded run |
| Huangdebo/YOLOv4-MultiTask | extension (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_yolo_layers | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from Raychou0830/Carplate pointer only; the stored copy get_code serves, from Raychou0830/Carplate, is pointer only (licence: GPL-3.0) · get_code("ec338718ed4c4fe1") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
| inference | Ran ran; our contract draft was wrong, not the code |
Huangdebo/YOLOv4-MultiTask/models.py pointer only (licence: NONE) · get_code("388f89a26fdf9028") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Huangdebo/YOLOv4-MultiTask 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. |
| make_divisible | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from Jiachenyin1/Yolov3-U-attention-permuting pointer only; the stored copy get_code serves, from Jiachenyin1/Yolov3-U-attention-permuting, is pointer only (licence: GPL-3.0) · get_code("5959383c642fb36b") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. No invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 2 the same month, 2 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 |
|---|---|---|---|
| make_divisible | 4 other papers 1 dated earlier, 1 the same month, 2 later |
1804.02767 (2018-04) YOLOv3: An Incremental Improvement |
2004.10934 (2020-04) YOLOv4: Optimal Speed and Accuracy of Object Detection 2009.02967 (2020-09) Stochastic-YOLO: Efficient Probabilistic Object Detection under Dataset Shifts and 1 more not named here |
| get_yolo_layers | 3 other papers 1 dated earlier, 1 the same month, 1 later |
1804.02767 (2018-04) YOLOv3: An Incremental Improvement |
2004.10934 (2020-04) YOLOv4: Optimal Speed and Accuracy of Object Detection 2009.02967 (2020-09) Stochastic-YOLO: Efficient Probabilistic Object Detection under Dataset Shifts |
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Modern methods mainly regard lane detection as a problem of pixel-wise segmentation, which is struggling to address the problem of challenging scenarios and speed. Inspired by human perception, the recognition of lanes under severe occlusion and extreme lighting conditions is mainly based on contextual and global information. Motivated by this observation, we propose a novel, simple, yet effective formulation aiming at extremely fast speed and challenging scenarios. Specifically, we treat the process of lane detection as a row-based selecting problem using global features. With the help of row-based selecting, our formulation could significantly reduce the computational cost. Using a large receptive field on global features, we could also handle the challenging scenarios. Moreover, based on the formulation, we also propose a structural loss to explicitly model the structure of lanes. Extensive experiments on two lane detection benchmark datasets show that our method could achieve the state-of-the-art performance in terms of both speed and accuracy. A light-weight version could even achieve 300+ frames per second with the same resolution, which is at least 4x faster than previous state-of-the-art methods. Our code will be made publicly available.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2004.11757")
get_code_for_paper("2004.11757")
have("2004.11757")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2004.11757.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2004.11757)
Connect an agent — have() is free.