Home › Code › unflatten

unflatten

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

unflatten appears in the code Syntology harvested for 15 papers, as 15 distinct code bodies found in 16 places (a place is one code body under one paper). Of the 15 papers, 14 with a sample that ran: 9 with a run with no instrument failure, 5 where every run was a failure of Syntology's instrument. 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 unflatten 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; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 15 distinct code bodies named unflatten: 14 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
6ran · our draft was wrong
0ran; the contract check could not run
8ran
1unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 7 of the 16 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 “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) 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; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

15 papers shown of 15, newest first; 16 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. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Mitigating Privacy-Utility Trade-off in Decentralized Federated Learning via f -Differential Privacy added by Syntology 2025-10 (from id) lx10077/PN-f-DP/corelated_noises/misc.py e706424e4a18d7dd ran · our draft was wrong no licence file found · pointer only
SAMPa: Sharpness-aware Minimization Parallelized 14 Oct 2024 LIONS-EPFL/SAMPa/utility.py c1ad6496b7bd2b05 ran no licence file found · pointer only
Does SGD really happen in tiny subspaces? 25 May 2024 locuslab/edge-of-stability/src/data.py 6e1ce477ef41fc78 ran · our draft was wrong no licence file found · pointer only
Learning Diffusion Priors from Observations by Expectation Maximization 22 May 2024 francois-rozet/diffusion-priors/diem/image.py d253b2b50caf68a2 ran MIT (permissive)
L+M-24: Building a Dataset for Language + Molecules @ ACL 2024 22 Feb 2024 language-plus-molecules/lpm-24-dataset/evaluation/create_heldout_file.py 276d317054148ab7 ran · our draft was wrong no licence file found · pointer only
Simple linear attention language models balance the recall-throughput tradeoff 28 Feb 2024 hazyresearch/zoology/zoology/utils.py fa6e454f96200975 ran · our draft was wrong Apache-2.0 (permissive)
Simple linear attention language models balance the recall-throughput tradeoff 28 Feb 2024 hazyresearch/zoology/zoology/analysis/utils.py 50615df14da6c8bb ran · our draft was wrong Apache-2.0 (permissive)
Time Series Forecasting with LLMs: Understanding and Enhancing Model Capabilities 16 Feb 2024 mingyuj666/time-series-forecasting-with-llms/models/utils.py fbf4f5f91d7ae546 ran · our draft was wrong no licence file found · pointer only
Leveraging Structured Information for Explainable Multi-hop Question Answering and Reasoning 7 Nov 2023 bcdnlp/structure-qa/src/knowledge_graph_generation.py 083a29a2790d4467 ran GPL-3.0 (copyleft) · pointer only
Policy Optimization in a Noisy Neighborhood: On Return Landscapes in Continuous Control 26 Sep 2023 nathanrahn/return-landscapes/run_algorithm/util/dict_util.py 6167c00d6c136928 ran no licence file found · pointer only
Prophet: Prompting Large Language Models with Complementary Answer Heuristics for Knowledge-based Visual Question Answering 3 Mar 2023 milvlg/prophet/prophet/stage1/model/net_utils.py bde236b337b5013f ran Apache-2.0 (permissive)
Training Vision-Language Models with Less Bimodal Supervision 1 Nov 2022 eladsegal/less-bimodal-sup/utils/jsonnet.py 225dafec388f7a2f ran Apache-2.0 (permissive)
SCROLLS: Standardized CompaRison Over Long Language Sequences 10 Jan 2022 tau-nlp/scrolls/baselines/src/utils/config.py 225dafec388f7a2f ran MIT (permissive)
PRIMERA: Pyramid-based Masked Sentence Pre-training for Multi-document Summarization 16 Oct 2021 allenai/open-mds/src/open_mds/common/util.py bd497b6193ae78a7 ran Apache-2.0 (permissive)
Aligning AI With Shared Human Values 5 Aug 2020 hendrycks/ethics/utilitarianism/tune.py 2244585c0f7fdef2 unverified MIT (permissive)
Importance Weighted Autoencoders 1 Sep 2015 jurgisp/pydreamer/pydreamer/models/functions.py b26ca1623f8bfc99 ran fingerprinted 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. 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