{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/build-tree","entry":"build_tree","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":14,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":14,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":5,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":15,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":2,"ran":6,"unverified":3},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2405.18432","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-origin-of-llamas-model-tree-heritage","title":"On the Origin of Llamas: Model Tree Heritage Recovery","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eliahuhorwitz/MoTHer","path":"MDST.py","file_url":"https://github.com/eliahuhorwitz/MoTHer/blob/HEAD/MDST.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, eliahuhorwitz/MoTHer (NOASSERTION)","code_sha256":"4d2fc8e66e1dfc51","code_sha256_prefix":"4d2fc8e66e1dfc51","mcp_get_code":{"code_sha256":"4d2fc8e66e1dfc51"}},{"arxiv_id":"2405.11746","arxiv_id_is_arxiv":true,"paper":"/paper/configurable-mirror-descent-towards-a","title":"Configurable Mirror Descent: Towards a Unification of Decision Making","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IpadLi/CMD","path":"algorithms/evaluation.py","file_url":"https://github.com/IpadLi/CMD/blob/HEAD/algorithms/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f51695c4c896db6","code_sha256_prefix":"5f51695c4c896db6","mcp_get_code":{"code_sha256":"5f51695c4c896db6"}},{"arxiv_id":"2402.04236","arxiv_id_is_arxiv":true,"paper":"/paper/cogcom-train-large-vision-language-models","title":"CogCoM: Train Large Vision-Language Models Diving into Details through Chain of Manipulations","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/cogcom","path":"cogcom/utils/com_dataset.py","file_url":"https://github.com/thudm/cogcom/blob/HEAD/cogcom/utils/com_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, thudm/cogcom (NOASSERTION)","code_sha256":"408cf9b8b5aeb28a","code_sha256_prefix":"408cf9b8b5aeb28a","mcp_get_code":{"code_sha256":"408cf9b8b5aeb28a"}},{"arxiv_id":"2402.04236","arxiv_id_is_arxiv":true,"paper":"/paper/cogcom-train-large-vision-language-models","title":"CogCoM: Train Large Vision-Language Models Diving into Details through Chain of Manipulations","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/cogcom","path":"cogcom/utils/com_utils.py","file_url":"https://github.com/thudm/cogcom/blob/HEAD/cogcom/utils/com_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, thudm/cogcom (NOASSERTION)","code_sha256":"546aa05ddb9110de","code_sha256_prefix":"546aa05ddb9110de","mcp_get_code":{"code_sha256":"546aa05ddb9110de"}},{"arxiv_id":"2310.18672","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-independent-set-self-training-through","title":"Maximum Independent Set: Self-Training through Dynamic Programming","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/dynamic-MIS","path":"MIS/recursive_tree.py","file_url":"https://github.com/LIONS-EPFL/dynamic-MIS/blob/HEAD/MIS/recursive_tree.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"46a920e935dd415f","code_sha256_prefix":"46a920e935dd415f","mcp_get_code":{"code_sha256":"46a920e935dd415f"}},{"arxiv_id":"2111.00053","arxiv_id_is_arxiv":true,"paper":"/paper/symbolic-regression-via-neural-guided-genetic","title":"Symbolic Regression via Neural-Guided Genetic Programming Population Seeding","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brendenpetersen/deep-symbolic-optimization","path":"dso/dso/program.py","file_url":"https://github.com/brendenpetersen/deep-symbolic-optimization/blob/HEAD/dso/dso/program.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"badc643b83f2a81c","code_sha256_prefix":"badc643b83f2a81c","mcp_get_code":{"code_sha256":"badc643b83f2a81c"}},{"arxiv_id":"2110.15072","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-recursive-gumbel-max-trick-for","title":"Leveraging Recursive Gumbel-Max Trick for Approximate Inference in Combinatorial Spaces","date":"2021-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RakitinDen/pytorch-recursive-gumbel-max-trick","path":"binary_tree/utils.py","file_url":"https://github.com/RakitinDen/pytorch-recursive-gumbel-max-trick/blob/HEAD/binary_tree/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c52becd20da3056","code_sha256_prefix":"7c52becd20da3056","mcp_get_code":{"code_sha256":"7c52becd20da3056"}},{"arxiv_id":"2005.05864","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-syntactic-structure-for-better","title":"Exploiting Syntactic Structure for Better Language Modeling: A Syntactic Distance Approach","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenyudu/SDLM","path":"testf1.py","file_url":"https://github.com/wenyudu/SDLM/blob/HEAD/testf1.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d910986dc51163af","code_sha256_prefix":"d910986dc51163af","mcp_get_code":{"code_sha256":"d910986dc51163af"}},{"arxiv_id":"1910.13466","arxiv_id_is_arxiv":true,"paper":"/paper/ordered-memory","title":"Ordered Memory","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yikangshen/Ordered-Memory","path":"utils/utils.py","file_url":"https://github.com/yikangshen/Ordered-Memory/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"796c817ae27882c5","code_sha256_prefix":"796c817ae27882c5","mcp_get_code":{"code_sha256":"796c817ae27882c5"}},{"arxiv_id":"1909.06639","arxiv_id_is_arxiv":true,"paper":"/paper/tree-transformer-integrating-tree-structures","title":"Tree Transformer: Integrating Tree Structures into Self-Attention","date":"2019-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"itzpankajpanwar/Tree-transform","path":"parse.py","file_url":"https://github.com/itzpankajpanwar/Tree-transform/blob/HEAD/parse.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a940e63fb38eb615","code_sha256_prefix":"a940e63fb38eb615","mcp_get_code":{"code_sha256":"a940e63fb38eb615"}},{"arxiv_id":"1906.06187","arxiv_id_is_arxiv":true,"paper":"/paper/nlprolog-reasoning-with-weak-unification-for-1","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leonweber/nlprolog","path":"visualize_proof_tree.py","file_url":"https://github.com/leonweber/nlprolog/blob/HEAD/visualize_proof_tree.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"66053e173ef275e6","code_sha256_prefix":"66053e173ef275e6","mcp_get_code":{"code_sha256":"66053e173ef275e6"}},{"arxiv_id":"1810.09536","arxiv_id_is_arxiv":true,"paper":"/paper/ordered-neurons-integrating-tree-structures","title":"Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks","date":"2018-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yikangshen/Ordered-Neurons","path":"test_phrase_grammar.py","file_url":"https://github.com/yikangshen/Ordered-Neurons/blob/HEAD/test_phrase_grammar.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2cdc4ed134986036","code_sha256_prefix":"2cdc4ed134986036","mcp_get_code":{"code_sha256":"2cdc4ed134986036"}},{"arxiv_id":"1701.02434","arxiv_id_is_arxiv":true,"paper":"/paper/a-conceptual-introduction-to-hamiltonian","title":"A Conceptual Introduction to Hamiltonian Monte Carlo","date":null,"month_inferred_from_arxiv_id":"2017-01","title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4d864798cca4b23b","code_sha256_prefix":"4d864798cca4b23b","mcp_get_code":{"code_sha256":"4d864798cca4b23b"}},{"arxiv_id":"1111.4246","arxiv_id_is_arxiv":true,"paper":"/paper/the-no-u-turn-sampler-adaptively-setting-path","title":"The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo","date":"2011-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JohannesBuchner/PinNUTS","path":"pinnuts/pinnuts.py","file_url":"https://github.com/JohannesBuchner/PinNUTS/blob/HEAD/pinnuts/pinnuts.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d864798cca4b23b","code_sha256_prefix":"4d864798cca4b23b","mcp_get_code":{"code_sha256":"4d864798cca4b23b"}},{"arxiv_id":"2020.emnlp-main.69","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2020.emnlp-main.69","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"murawaki/dialect-latgeo","path":"treegen.py","file_url":"https://github.com/murawaki/dialect-latgeo/blob/HEAD/treegen.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a2b3ffbc617ad9f7","code_sha256_prefix":"a2b3ffbc617ad9f7","mcp_get_code":{"code_sha256":"a2b3ffbc617ad9f7"}}],"record_sha256":"3ce61e671a2488a744937440d6fb2b2c89348a4e01c24f32d969ec126fb020f5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}