Home › Code › build_tree

build_tree

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.

build_tree appears in the code Syntology harvested for 14 papers, as 14 distinct code bodies found in 15 places (a place is one code body under one paper). Of the 14 papers, 10 with a sample that ran: 6 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument. 3 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 build_tree 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 14 distinct code bodies named build_tree: 11 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 3 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
3ran · our draft was wrong
2ran; the contract check could not run
6ran
3unverified
3fingerprinted

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

14 papers shown of 14, newest first; 15 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; 1 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
On the Origin of Llamas: Model Tree Heritage Recovery 28 May 2024 eliahuhorwitz/MoTHer/MDST.py 4d2fc8e66e1dfc51 unverified licence not identified · pointer only
Configurable Mirror Descent: Towards a Unification of Decision Making 20 May 2024 IpadLi/CMD/algorithms/evaluation.py 5f51695c4c896db6 unverified MIT (permissive)
CogCoM: Train Large Vision-Language Models Diving into Details through Chain of Manipulations 6 Feb 2024 thudm/cogcom/cogcom/utils/com_dataset.py 408cf9b8b5aeb28a ran · our draft was wrong licence not identified · pointer only
CogCoM: Train Large Vision-Language Models Diving into Details through Chain of Manipulations 6 Feb 2024 thudm/cogcom/cogcom/utils/com_utils.py 546aa05ddb9110de ran · our draft was wrong licence not identified · pointer only
Maximum Independent Set: Self-Training through Dynamic Programming 28 Oct 2023 LIONS-EPFL/dynamic-MIS/MIS/recursive_tree.py 46a920e935dd415f ran · our draft was wrong Apache-2.0 (permissive)
Symbolic Regression via Neural-Guided Genetic Programming Population Seeding 29 Oct 2021 brendenpetersen/deep-symbolic-optimization/dso/dso/program.py badc643b83f2a81c ran BSD-3-Clause (permissive)
Leveraging Recursive Gumbel-Max Trick for Approximate Inference in Combinatorial Spaces 28 Oct 2021 RakitinDen/pytorch-recursive-gumbel-max-trick/binary_tree/utils.py 7c52becd20da3056 ran Apache-2.0 (permissive)
Exploiting Syntactic Structure for Better Language Modeling: A Syntactic Distance Approach 12 May 2020 wenyudu/SDLM/testf1.py d910986dc51163af ran; the contract check could not run (RAISES) · metamorphic tier: deterministic fingerprinted BSD-3-Clause (permissive)
Ordered Memory 29 Oct 2019 yikangshen/Ordered-Memory/utils/utils.py 796c817ae27882c5 ran MIT (permissive)
Tree Transformer: Integrating Tree Structures into Self-Attention 14 Sep 2019 itzpankajpanwar/Tree-transform/parse.py a940e63fb38eb615 ran Apache-2.0 (permissive)
NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language 14 Jun 2019 leonweber/nlprolog/visualize_proof_tree.py 66053e173ef275e6 ran fingerprinted MIT (permissive)
Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks 22 Oct 2018 yikangshen/Ordered-Neurons/test_phrase_grammar.py 2cdc4ed134986036 ran; the contract check could not run (RAISES) · metamorphic tier: deterministic fingerprinted BSD-3-Clause (permissive)
A Conceptual Introduction to Hamiltonian Monte Carlo 2017-01 (from id) identical code first harvested elsewhere 4d864798cca4b23b unverified licence of this copy not recorded
The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo 18 Nov 2011 JohannesBuchner/PinNUTS/pinnuts/pinnuts.py 4d864798cca4b23b unverified MIT (permissive)
ACL Anthology id 2020.emnlp-main.69 murawaki/dialect-latgeo/treegen.py a2b3ffbc617ad9f7 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 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