Simon Lucey, Xueqian Li, Sameera Ramasinghe, Jianqiao Zheng
4 of 9 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 3 have no contract verdict; 1 failure of our instrument; 5 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/2205.08987.json · badge: /api/ran/2205.08987.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 |
|---|---|---|
| osiriszjq/complex_encoding | canonical (classifier label) classifier basis not recorded on the link |
4 ran · 5 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_logger | Ran ran; our contract draft was wrong, not the code |
osiriszjq/complex_encoding/2D_random_points.py code served (permissive licence) · get_code("d8dad09165d593fd") 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 Logger. The image it ran in was not recorded. If your copy returns the same type 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.
|
| main | Ran ran on a synthesized input |
osiriszjq/complex_encoding/3D_separable_points_GD.py code served (permissive licence) · get_code("8fa27028f4b7a1e4") 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 int, ndim 0, dtype family int, shape () as a later run recorded it. The image it ran in was not recorded. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is 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.
|
| psnr_func | Ran ran on a synthesized input |
osiriszjq/complex_encoding/utils.py code served (permissive licence) · get_code("ef72fc9d6dba1927") 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 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.
|
| srank_func | Ran ran on a synthesized input |
osiriszjq/complex_encoding/utils.py code served (permissive licence) · get_code("0c6eb75c8d92b68c") 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 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.
|
| main | Not yet run unverified (harvested, no recorded run) |
osiriszjq/complex_encoding/2D_random_points.py code served (permissive licence) · get_code("d7746ecdd4b4e6d3") How it ranno invocation recorded. |
| main | Not yet run unverified (harvested, no recorded run) |
osiriszjq/complex_encoding/2D_separable_points.py code served (permissive licence) · get_code("80bda3a1667c4cca") How it ranno invocation recorded. |
| main | Not yet run unverified (harvested, no recorded run) |
osiriszjq/complex_encoding/3D_random_points_GD.py code served (permissive licence) · get_code("a884cd96321f23e2") How it ranno invocation recorded. |
| smooth | Not yet run unverified (harvested, no recorded run) |
osiriszjq/complex_encoding/utils.py code served (permissive licence) · get_code("0477b5983b9122c0") How it ranno invocation recorded. |
| train_closed_form_2D | Not yet run unverified (harvested, no recorded run) |
osiriszjq/complex_encoding/trainer.py code served (permissive licence) · get_code("7c3dbb048063e6a7") How it ranno invocation recorded. |
Of 9 samples lifted from this paper's linked repositories, 9 carry a function identity and 0 do not. Of the 9 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 1 later) and 8 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 |
|---|---|---|---|
| get_logger | 10 other papers 1 dated earlier, 9 later |
2106.06716 (2021-06) DS-TransUNet:Dual Swin Transformer U-Net for Medical Image Segmentation |
2207.00012 (2022-07) Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN 2304.13098 (2023-04) Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient and 7 more not named here |
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.
It is well noted that coordinate-based MLPs benefit-in terms of preserving high-frequency information-through the encoding of coordinate positions as an array of Fourier features. Hitherto, the rationale for the effectiveness of these positional encodings has been mainly studied through a Fourier lens. In this paper, we strive to broaden this understanding by showing that alternative non-Fourier embedding functions can indeed be used for positional encoding. Moreover, we show that their performance is entirely determined by a trade-off between the stable rank of the embedded matrix and the distance preservation between embedded coordinates. We further establish that the now ubiquitous Fourier feature mapping of position is a special case that fulfills these conditions. Consequently, we present a more general theory to analyze positional encoding in terms of shifted basis functions. In addition, we argue that employing a more complex positional encoding-that scales exponentially with the number of modes-requires only a linear (rather than deep) coordinate function to achieve comparable performance. Counter-intuitively, we demonstrate that trading positional embedding complexity for network deepness is orders of magnitude faster than current state-of-the-art; despite the additional embedding complexity. To this end, we develop the necessary theoretical formulae and empirically verify that our theoretical claims hold in practice. Project page at https://osiriszjq.github.io/complex encoding.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.08987")
get_code_for_paper("2205.08987")
have("2205.08987")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2205.08987.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2205.08987)
Connect an agent — have() is free.