2 of 2 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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 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/2312.03341.json · badge: /api/ran/2312.03341.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 |
|---|---|---|
| cnzzx/gemap | canonical (classifier label) classifier basis not recorded on the link |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| normalize_2d_pts | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
cnzzx/gemap/projects/mmdet3d_plugin/gemap/losses/geo_loss.py code served (permissive licence) · get_code("2e121cd3bb994517") 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 Tensor, ndim 3, dtype family float, shape (2, 4, 2) 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.
|
| reduce_loss | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
cnzzx/gemap/projects/mmdet3d_plugin/gemap/losses/map_loss.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from OpenFirework/pytorch_solov2, is pointer only (licence: NONE) · get_code("b2b9a1966482ef96") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from OpenFirework/pytorch_solov2, 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. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 2 later) and 0 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 |
|---|---|---|---|
| reduce_loss | 18 other papers 9 dated earlier, 7 later, 2 same year, order not determinable |
2003.10152 (2020-03) SOLOv2: Dynamic and Fast Instance Segmentation |
2003.10778 (2020-03) PanNuke Dataset Extension, Insights and Baselines 2107.08430 (2021-07) YOLOX: Exceeding YOLO Series in 2021 and 15 more not named here |
| normalize_2d_pts | 3 other papers 1 dated earlier, 2 later |
2310.13378 (2023-10) ScalableMap: Scalable Map Learning for Online Long-Range Vectorized HD Map Construction |
2404.00876 (2024-04) MGMap: Mask-Guided Learning for Online Vectorized HD Map Construction 2407.13517 (2024-07) Mask2Map: Vectorized HD Map Construction Using Bird's Eye View Segmentation Masks |
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.
The construction of online vectorized High-Definition (HD) maps is critical for downstream prediction and planning. Recent efforts have built strong baselines for this task, however, shapes and relations of instances in urban road systems are still under-explored, such as parallelism, perpendicular, or rectangle-shape. In our work, we propose GeMap ($\textbf{Ge}$ometry $\textbf{Map}$), which end-to-end learns Euclidean shapes and relations of map instances beyond basic perception. Specifically, we design a geometric loss based on angle and distance clues, which is robust to rigid transformations. We also decouple self-attention to independently handle Euclidean shapes and relations. Our method achieves new state-of-the-art performance on the NuScenes and Argoverse 2 datasets. Remarkably, it reaches a 71.8% mAP on the large-scale Argoverse 2 dataset, outperforming MapTR V2 by +4.4% and surpassing the 70% mAP threshold for the first time. Code is available at https://github.com/cnzzx/GeMap.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2312.03341")
get_code_for_paper("2312.03341")
have("2312.03341")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2312.03341.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2312.03341)
Connect an agent — have() is free.