Home › Code › dfs

dfs

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

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

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

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

13 papers shown of 13, newest first; 13 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. 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
Let Me Think! A Long Chain-of-Thought Can Be Worth Exponentially Many Short Ones 27 May 2025 seyedparsa/let-me-think/utils.py 5a65e7c00db7acd4 unverified MIT (permissive)
Calibrated Self-Rewarding Vision Language Models 23 May 2024 yiyangzhou/csr/inference_csr/construct.py 2ba5f42674afcfe5 ran · our draft was wrong no licence file found · pointer only
Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performance 25 Mar 2024 yegcjs/mixinglaws/pipeline/find_opt.py 633fdf04a3299a5a ran no licence file found · pointer only
Discrete Neural Algorithmic Reasoning 18 Feb 2024 yandex-research/dnar/generate_data.py df4c2e1bb388ca7f ran Apache-2.0 (permissive)
Computationally Budgeted Continual Learning: What Does Matter? 20 Mar 2023 drimpossible/BudgetCL/scripts/check_img21k.py 070032f773a19e6d unverified GPL-3.0 (copyleft) · pointer only
Predictive Flows for Faster Ford-Fulkerson 2023-03 (from id) wang-yuyan/warmstart-graphcut-algorithms-pulic/augmentingPath.py e503655d38845884 unverified MIT (permissive)
Causal Bandits without Graph Learning 26 Jan 2023 borealisai/raps/raps/bandit.py 36d169e41efd9c11 ran · honoured contract licence not identified · pointer only
Sample Efficiency Matters: A Benchmark for Practical Molecular Optimization 2022-06 (from id) wenhao-gao/mol_opt/main/jt_vae/fast_jtnn/mol_tree.py 4027a8a9d160edc2 unverified MIT (permissive)
Learning to Untangle Genome Assembly with Graph Convolutional Networks 1 Jun 2022 lvrcek/gnnome-assembly/algorithms.py ccbf684acb260268 unverified MIT (permissive)
Improving black-box optimization in VAE latent space using decoder uncertainty 30 Jun 2021 pascalnotin/uncertainty_guided_optimization/JTVAE/fast_jtnn/mol_tree.py 4027a8a9d160edc2 unverified MIT (permissive)
CrossWalk: Fairness-enhanced Node Representation Learning 6 May 2021 ahmadkhajehnejad/CrossWalk/influence_maximization/fairinfMaximization.py 15b2e1a629cd3e62 ran · our draft was wrong no licence file found · pointer only
Supervising strong learners by amplifying weak experts 19 Oct 2018 rmoehn/amplification/amplification/tasks/equals.py ab64ff670a8d3fc4 unverified MIT recorded; this copy not marked cleared · pointer only
Very Deep Convolutional Networks for Large-Scale Image Recognition 4 Sep 2014 MaliParag/ScanSSD/gtdb/create_gt_math.py 83cd98c436eef2a7 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