2 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, 0 violated it and 2 have no contract verdict; 0 failures 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/2412.18263.json · badge: /api/ran/2412.18263.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 |
|---|---|---|
| shihaoshao-gh/ict-decomposition-and-equivariant-bases | canonical (classifier label) classifier basis not recorded on the link |
2 ran · 5 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| general_equivariant_basis_generator_SU2 | Ran ran on a synthesized input |
shihaoshao-gh/ict-decomposition-and-equivariant-bases/equivariant_bases_su2.py code served (permissive licence) · get_code("52ae24a63caad190") 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. 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.
|
| su2_clebsch_gordan | Ran ran on a synthesized input |
shihaoshao-gh/ict-decomposition-and-equivariant-bases/equivariant_bases_su2.py code served (permissive licence) · get_code("436c6b4f3d74e977") 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, 2, 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.
|
| ICT_decomposition | Not yet run unverified (harvested, no recorded run) |
shihaoshao-gh/ict-decomposition-and-equivariant-bases/ICT_decomp.py code served (permissive licence) · get_code("9c0444ba811aed45") How it ranno invocation recorded. |
| change_of_basis_generation | Not yet run unverified (harvested, no recorded run) |
shihaoshao-gh/ict-decomposition-and-equivariant-bases/equivariant_bases_end_algo4.py code served (permissive licence) · get_code("6d0de8d5454c8793") How it ranno invocation recorded. |
| equivariant_basis_generation | Not yet run unverified (harvested, no recorded run) |
shihaoshao-gh/ict-decomposition-and-equivariant-bases/equivariant_bases_end.py code served (permissive licence) · get_code("6222ad9a4bc99a6f") How it ranno invocation recorded. |
| general_equivariant_basis_generator | Not yet run unverified (harvested, no recorded run) |
shihaoshao-gh/ict-decomposition-and-equivariant-bases/equivariant_bases_algo4.py code served (permissive licence) · get_code("32b5cf6d4da77610") How it ranno invocation recorded. |
| general_equivariant_basis_generator | Not yet run unverified (harvested, no recorded run) |
shihaoshao-gh/ict-decomposition-and-equivariant-bases/equivariant_bases.py code served (permissive licence) · get_code("7632799f05c16ccd") How it ranno 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, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 7 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.
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.
Irreducible Cartesian tensors (ICTs) play a crucial role in the design of equivariant graph neural networks, as well as in theoretical chemistry and chemical physics. Meanwhile, the design space of available linear operations on tensors that preserve symmetry presents a significant challenge. The ICT decomposition and a basis of this equivariant space are difficult to obtain for high-rank tensors. After decades of research, Bonvicini (2024) has recently achieved an explicit ICT decomposition for $n=5$ with factorial time/space complexity. In this work we, for the first time, obtain decomposition matrices for ICTs up to rank $n=9$ with reduced and affordable complexity, by constructing what we call path matrices. The path matrices are obtained via performing chain-like contractions with Clebsch-Gordan matrices following the parentage scheme. We prove and leverage that the concatenation of path matrices is an orthonormal change-of-basis matrix between the Cartesian tensor product space and the spherical direct sum spaces. Furthermore, we identify a complete orthogonal basis for the equivariant space, rather than a spanning set (Pearce-Crump, 2023b), through this path matrices technique. Our method avoids the RREF algorithm and maintains a fully analytical derivation of each ICT decomposition matrix, thereby significantly improving the algorithm's speed to obtain arbitrary rank orthogonal ICT decomposition matrices and orthogonal equivariant bases. We further extend our result to the arbitrary tensor product and direct sum spaces, enabling free design between different spaces while keeping symmetry. The Python code is available at https://github.com/ShihaoShao-GH/ICT-decomposition-and-equivariant-bases, where the $n=6,\dots,9$ ICT decomposition matrices are obtained in 1s, 3s, 11s, and 4m32s on 28-core Intel(R) Xeon(R) Gold 6330 CPU @ 2.00GHz, respectively.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2412.18263")
get_code_for_paper("2412.18263")
have("2412.18263")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2412.18263.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2412.18263)
Connect an agent — have() is free.