6 of 7 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, 2 violated it and 4 have no contract verdict; 0 failures 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/2001.07715.json · badge: /api/ran/2001.07715.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 |
|---|---|---|
| MIT-SPARK/TEASER-plusplus | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| mit-spark/kiss-matcher | community (classifier label) classifier basis not recorded on the link |
4 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| bin_to_pcd | Ran ran on a synthesized input |
mit-spark/kiss-matcher/python/utils/bin2pcd.py code served (permissive licence) · get_code("fafbafddf90c5b64") 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 ndarray, ndim 2, dtype family float, shape (3, 3) 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.
|
| get_angular_error | Ran ran, violated the contract we drafted |
this paper's copy was not recorded; identical code first harvested from StrikerCC/Teaser-plusplus-testing pointer only · get_code("2c68a865d526c0cd") 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. |
| get_angular_error | Ran ran, violated the contract we drafted |
MIT-SPARK/TEASER-plusplus/examples/teaser_python_ply/teaser_python_ply.py code served (permissive licence) · get_code("54db1e4574db065f") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned float64, 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.
|
| read_bin | Ran ran on a synthesized input |
mit-spark/kiss-matcher/python/kiss_matcher/io_utils.py code served (permissive licence) · get_code("91b6d2125d1eadc6") 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 ndarray, ndim 2, dtype family float, shape (5, 3) 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.
|
| read_pcd | Ran ran on a synthesized input |
mit-spark/kiss-matcher/python/kiss_matcher/io_utils.py code served (permissive licence) · get_code("bbe0439489192e4b") 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 ndarray, ndim 2, dtype family float, shape (3, 3) 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.
|
| read_ply | Ran ran on a synthesized input |
mit-spark/kiss-matcher/python/kiss_matcher/io_utils.py code served (permissive licence) · get_code("d33d4de02bd79322") 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 ndarray, ndim 2, dtype family float, shape (3, 3) 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.
|
| find_mutually_nn_keypoints | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from StrikerCC/Teaser-plusplus-testing pointer only · get_code("103473bb55796d70") 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 7 samples lifted from this paper's linked repositories, 7 carry a function identity and 0 do not. Of the 7 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, 0 later) and 5 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 |
|---|---|---|---|
| find_mutually_nn_keypoints | 2 other papers 2 dated earlier |
1903.08588 (2019-03) A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates |
1905.12536 (2019-05) A Quaternion-based Certifiably Optimal Solution to the Wahba Problem with Outliers |
| get_angular_error | 2 other papers 2 dated earlier |
1903.08588 (2019-03) A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates |
1905.12536 (2019-05) A Quaternion-based Certifiably Optimal Solution to the Wahba Problem with Outliers |
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.
We propose the first fast and certifiable algorithm for the registration of two sets of 3D points in the presence of large amounts of outlier correspondences. We first reformulate the registration problem using a Truncated Least Squares (TLS) cost that is insensitive to a large fraction of spurious correspondences. Then, we provide a general graph-theoretic framework to decouple scale, rotation, and translation estimation, which allows solving in cascade for the three transformations. Despite the fact that each subproblem is still non-convex and combinatorial in nature, we show that (i) TLS scale and (component-wise) translation estimation can be solved in polynomial time via adaptive voting, (ii) TLS rotation estimation can be relaxed to a semidefinite program (SDP) and the relaxation is tight, even in the presence of extreme outlier rates, and (iii) the graph-theoretic framework allows drastic pruning of outliers by finding the maximum clique. We name the resulting algorithm TEASER (Truncated least squares Estimation And SEmidefinite Relaxation). While solving large SDP relaxations is typically slow, we develop a second fast and certifiable algorithm, named TEASER++, that uses graduated non-convexity to solve the rotation subproblem and leverages Douglas-Rachford Splitting to efficiently certify global optimality. For both algorithms, we provide theoretical bounds on the estimation errors, which are the first of their kind for robust registration problems. Moreover, we test their performance on standard, object detection, and the 3DMatch benchmarks, and show that (i) both algorithms dominate the state of the art and are robust to more than 99% outliers, (ii) TEASER++ can run in milliseconds, and (iii) TEASER++ is so robust it can also solve problems without correspondences, where it largely outperforms ICP and it is more accurate than Go-ICP while being orders of magnitude faster.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.07715")
get_code_for_paper("2001.07715")
have("2001.07715")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.07715.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.07715)
Connect an agent — have() is free.