Home › Code › fold

fold

Syntologyentry name in harvested coderead from the graph 2026-09-24

fold appears in the code Syntology harvested for 10 papers, as 9 distinct code bodies found in 10 places (a place is one code body under one paper). At least one of them ran in 6 of the papers; 1 of the code bodies carries a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named fold do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 5 of the 9 distinct code bodies named fold; 4 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
1ran · our draft was wrong
0ran · fixture could not drive it
4ran
4unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 2 of the 10 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

10 papers shown of 10, newest first; 10 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 1 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Backward through Time, Algebraically added by Syntology 2026-08 (from id) konstantinosKokos/telos/src/telos/algebras/base.py 029ec275f8afc5f1 ran MIT (permissive)
DEX: Data Channel Extension for Efficient CNN Inference on Tiny AI Accelerators 9 Dec 2024 nokia-bell-labs/data-channel-extension/ai8x.py b65fe9574f66b0cd ran fingerprinted licence not identified · pointer only
Broadcast Product: Shape-aligned Element-wise Multiplication and Beyond 26 Sep 2024 matsui528/broadcast_product_demo/broadcast_decomposition/python/src/broadcast_decomposition/tensor_ops.py e59721ab05438e5c ran no licence file found · pointer only
Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-training 23 May 2023 stanford-crfm/levanter/src/levanter/metrics.py d40382c2fb844d41 unverified Apache-2.0 (permissive)
Insights From the NeurIPS 2021 NetHack Challenge 22 Mar 2022 dllllb/neurips2021-nethack-raph/nethack_raph/Level.py 2896d0ffefd9b335 unverified MIT (permissive)
Vision Transformer with Deformable Attention 3 Jan 2022 ChristophReich1996/Swin-Transformer-V2/swin_transformer_v2/model_parts.py ae92018684b30199 ran · our draft was wrong MIT (permissive)
Towards Total Recall in Industrial Anomaly Detection 15 Jun 2021 JoegameZhou/PatchCore/src/operator.py b4bfdc071e0f7908 unverified Apache-2.0 (permissive)
Transit Least Squares: An optimized transit detection algorithm to search for periodic transits of small planets 2019-01 (from id) hippke/tls/transitleastsquares/core.py 52c3d1f4ce1655b9 unverified MIT (permissive)
A Hybrid Convolutional Variational Autoencoder for Text Generation 8 Feb 2017 kefirski/hybrid_rvae/utils/functions.py 0381de7a8ac5ced5 ran MIT (permissive)
Generating Sentences from a Continuous Space 19 Nov 2015 kefirski/pytorch_RVAE/model/rvae.py 0381de7a8ac5ced5 ran MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections