Home › Code › is_leaf

is_leaf

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

is_leaf appears in the code Syntology harvested for 11 papers, as 5 distinct code bodies found in 11 places (a place is one code body under one paper). At least one of them ran in 3 of the papers; 0 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 is_leaf 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 3 of the 5 distinct code bodies named is_leaf; 2 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

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

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

11 papers shown of 11, newest first; 11 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; 1 papers have no page here and are shown by arXiv id only. 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
VGB for Masked Diffusion Model: Efficient Test-time Scaling for Reward Satisfaction and Sample Editing added by Syntology 2026-06 (from id) KraitGit/MDM-VGB/src/algorithms/vgb.py f94688ec8e960f65 ran · our draft was wrong MIT (permissive)
MedConceptsQA: Open Source Medical Concepts QA Benchmark 12 May 2024 nadavlab/MedConceptsQA/create_benchmark.py 667892ff3e170d62 ran · violated contract no licence file found · pointer only
Fixing Overconfidence in Dynamic Neural Networks 13 Feb 2023 aaltoml/calibrated-dnn/op_counter.py 26ff085b343fa39e unverified MIT (permissive)
Boosted Dynamic Neural Networks 30 Nov 2022 SHI-Labs/Boosted-Dynamic-Networks/op_counter.py 26ff085b343fa39e unverified MIT (permissive)
Network Pruning That Matters: A Case Study on Retraining Variants 7 May 2021 lehduong/NPTM/hrank/get_flops.py 26ff085b343fa39e unverified MIT (permissive)
Dynamic Group Convolution for Accelerating Convolutional Neural Networks 8 Jul 2020 zhuogege1943/dgc/utils.py 26ff085b343fa39e unverified MIT (permissive)
NBDT: Neural-Backed Decision Trees 1 Apr 2020 XAVILLA/nbdt/nbdt/model.py 626c774cdb0ecdea ran · our draft was wrong MIT (permissive)
Towards Efficient Model Compression via Learned Global Ranking 28 Apr 2019 cmu-enyac/LeGR/pruner/fp_resnet.py 26ff085b343fa39e unverified Apache-2.0 (permissive)
Moonshine: Distilling with Cheap Convolutions 7 Nov 2017 BayesWatch/pytorch-moonshine/count_flops.py 26ff085b343fa39e unverified MIT (permissive)
Multi-Scale Dense Networks for Resource Efficient Image Classification 29 Mar 2017 kalviny/MSDNet-PyTorch/op_counter.py 26ff085b343fa39e unverified MIT (permissive)
arXiv:136830480 fanhanwei/BOCR/lib/net_measure.py 5c9e671ff4d03af2 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 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