Home › Code › expand

expand

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.

expand appears in the code Syntology harvested for 29 papers, as 28 distinct code bodies found in 30 places (a place is one code body under one paper). Of the 29 papers, 22 with a sample that ran: 15 with a run with no instrument failure, 7 where every run was a failure of Syntology's instrument. 8 of the code bodies carry 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 expand 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 28 distinct code bodies named expand: 20 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 1 violated, 10 with no contract checked; 7 where Syntology's instrument failed) · 8 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:

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

Licence is a property of each copy, so it is counted per place: 7 of the 30 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

29 papers shown of 29, newest first; 30 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 3 papers added by Syntology; 4 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). 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
Decoupling Turn-Taking from Semantics: A Decoupled Data Approach for Finite-State-Machine-Based Full-Duplex Dialogue added by Syntology 2026-09 (from id) Liyht/def-fsm/def_fsm/paths.py 2c1d9a607d1536e2 unverified Apache-2.0 (permissive)
E-Commerce Bench: Evaluating LLM Agents on Long-Horizon Autonomous Business Operation added by Syntology 2026-08 (from id) QwenLM/E-CommerceBench/agent/providers.py 47b042345453fd7f ran · our draft was wrong Apache-2.0 (permissive)
Bridging short-and medium-range weather forecasting with machine learning added by Syntology 2026-08 (from id) NOAA-GSL/wxvx/src/wxvx/util.py cd08db72c18656e8 ran · honoured contract Apache-2.0 (permissive)
arXiv:2507.09305 2025-07 (from id) AIRI-Institute/TransPath/modules/planners.py c4c06ef95d9cd34e ran · our draft was wrong fingerprinted MIT (permissive)
MM-Verify: Enhancing Multimodal Reasoning with Chain-of-Thought Verification 19 Feb 2025 Aurora-slz/MM-Verify/search/MCTS/mcts.py b694a3efa9770e88 unverified no licence file found · pointer only
ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search 6 Jun 2024 THUDM/ReST-MCTS/MCTS/mcts.py 972b9f317f5321f0 unverified no licence file found · pointer only
ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search 6 Jun 2024 DIRECT-BIT/SRA-MCTS/MCTS/mcts.py 152f75c9b44ec04e unverified Apache-2.0 (permissive)
MAP-Neo: Highly Capable and Transparent Bilingual Large Language Model Series 29 May 2024 multimodal-art-projection/map-neo/Matrix/document-convert/multi_thread_process_to_doc.py 43caaeb95b39e09f ran no licence file found · pointer only
Uncertainty of Thoughts: Uncertainty-Aware Planning Enhances Information Seeking in Large Language Models 5 Feb 2024 zhiyuanhubj/UoT/src/uot/uot.py 04d1a1be5ddfeabb ran · our draft was wrong no licence file found · pointer only
Unlocking Anticipatory Text Generation: A Constrained Approach for Large Language Models Decoding 11 Dec 2023 SalesforceAIResearch/Unlocking-TextGen/Toxicity/sample_toxity_llm_facon.py ad41a9451a0ec4b4 unverified Apache-2.0 (permissive)
Reconstructing Hands in 3D with Transformers 8 Dec 2023 geopavlakos/hamer/hamer/datasets/image_dataset.py 9b45eb017f731bb9 ran fingerprinted MIT (permissive)
Hieros: Hierarchical Imagination on Structured State Space Sequence World Models 8 Oct 2023 Snagnar/Hieros/hieros/dreamer.py 0443d69d357e19c2 ran fingerprinted MIT (permissive)
ClarifyDelphi: Reinforced Clarification Questions with Defeasibility Rewards for Social and Moral Situations 20 Dec 2022 allenai/clarifydelphi/Code/sample_clarifyd.py fe3fa19af4368e58 unverified Apache-2.0 (permissive)
Quark: Controllable Text Generation with Reinforced Unlearning 26 May 2022 gximinglu/quark/sample.py 63833738c4b0997e ran · our draft was wrong fingerprinted no licence file found · pointer only
The RSNA-ASNR-MICCAI BraTS 2021 Benchmark on Brain Tumor Segmentation and Radiogenomic Classification 5 Jul 2021 gallegi/T4E_MICCAI_BrainTumor/train_classification.py c383842caf2ac3c0 ran · our draft was wrong MIT (permissive)
Off-Policy Evaluation via Adaptive Weighting with Data from Contextual Bandits 3 Jun 2021 gsbDBI/contextual_bandits_evaluation/adaptive/compute.py f3208622d144c3e0 ran MIT (permissive)
Scaling Scaling Laws with Board Games 7 Apr 2021 andyljones/boardlaw/boardlaw/analysis.py c1f40ed24b504f3a ran fingerprinted MIT (permissive)
Evolutionary Population Curriculum for Scaling Multi-Agent Reinforcement Learning 23 Mar 2020 qian18long/epciclr2020/maddpg_o/experiments/train_epc.py 32ba3376c169b57f ran · violated contract fingerprinted no licence file found · pointer only
Training Two-Layer ReLU Networks with Gradient Descent is Inconsistent 12 Feb 2020 dholzmueller/nn_inconsistency/mc_training.py 48a9e72de39ad385 ran · our draft was wrong Apache-2.0 (permissive)
Reformer: The Efficient Transformer 13 Jan 2020 Rick-McCoy/Reformer-pytorch/model/attention.py bde1d7f419f43bee ran · our draft was wrong fingerprinted MIT (permissive)
Sato: Contextual Semantic Type Detection in Tables 14 Nov 2019 megagonlabs/sato/topic_model/LDA_cluster.py fb15c7324ef503bc ran Apache-2.0 (permissive)
Practice on Long Sequential User Behavior Modeling for Click-Through Rate Prediction 22 May 2019 UIC-Paper/MIMN/script/mimn.py 3d130d4e1df6bced ran MIT (permissive)
Noise2Self: Blind Denoising by Self-Supervision 30 Jan 2019 czbiohub/noise2self/util.py cc0b8b3068669a1f ran MIT (permissive)
On the Continuity of Rotation Representations in Neural Networks 17 Dec 2018 tik0/6d/6d.py ffdd3794cf297dc5 ran · honoured contract fingerprinted GPL-3.0 (copyleft) · pointer only
PennyLane: Automatic differentiation of hybrid quantum-classical computations 12 Nov 2018 rickyHong/Pennylane-repl/pennylane/utils.py 35c502b0db4f2e4f ran Apache-2.0 (permissive)
Implementing Neural Turing Machines 23 Jul 2018 SourangshuGhosh/NeuralTuringMachine/utils.py 3d130d4e1df6bced ran MIT (permissive)
All-but-the-Top: Simple and Effective Postprocessing for Word Representations 5 Feb 2017 lgalke/vec4ir/vec4ir/eqlm.py 3c032c9ef0a071ed unverified MIT (permissive)
ACL Anthology id 2023.findings-acl.657 luka-group/MrCoD/BERT+ATT_scripts/codred-blend.py 69bf746de17e44c0 ran MIT (permissive)
ACL Anthology id 2021.emnlp-main.366 thunlp/CodRED/baseline/codred-blend/codred-blend.py 69bf746de17e44c0 ran MIT (permissive)
id 136710691 (not an arXiv id) SYVAE/MetaGF/M0_main.py faf21c7fc5522fa2 unverified 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