{"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/tree","entry":"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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":11,"n_samples_ran":7,"n_samples_constructed":6,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":11,"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":0,"ran_fixture":0,"ran":7,"unverified":4},"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":"2602.09574","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-09574","title":"Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Sora-Miyamoto/bg-mcts","path":"treesearch/src/treesearch/algos/bg_mcts.py","file_url":"https://github.com/Sora-Miyamoto/bg-mcts/blob/HEAD/treesearch/src/treesearch/algos/bg_mcts.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a21665ea9499d759","code_sha256_prefix":"a21665ea9499d759","mcp_get_code":{"code_sha256":"a21665ea9499d759"}},{"arxiv_id":"2510.17489","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-17489","title":"DETree: DEtecting Human-AI Collaborative Texts via Tree-Structured Hierarchical Representation Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"heyongxin233/DETree","path":"detree/model/simclr.py","file_url":"https://github.com/heyongxin233/DETree/blob/HEAD/detree/model/simclr.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":"b7f3b57f1bff4dce","code_sha256_prefix":"b7f3b57f1bff4dce","mcp_get_code":{"code_sha256":"b7f3b57f1bff4dce"}},{"arxiv_id":"2508.16201","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-16201","title":"SPECVLM: Enhancing Speculative Decoding of Video LLMs via Verifier-Guided Token Pruning","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"zju-jiyicheng/SpecVLM","path":"decoding/tree_decoding.py","file_url":"https://github.com/zju-jiyicheng/SpecVLM/blob/HEAD/decoding/tree_decoding.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zju-jiyicheng/SpecVLM when it was checked","code_sha256":"dd99bdbf5a9be746","code_sha256_prefix":"dd99bdbf5a9be746","mcp_get_code":{"code_sha256":"dd99bdbf5a9be746"}},{"arxiv_id":"2411.05289","arxiv_id_is_arxiv":true,"paper":"/paper/spechub-provable-acceleration-to-multi-draft","title":"SpecHub: Provable Acceleration to Multi-Draft Speculative Decoding","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mastergodzilla/speculative_decoding_ot","path":"Sequoia/Tree/SpecTree.py","file_url":"https://github.com/mastergodzilla/speculative_decoding_ot/blob/HEAD/Sequoia/Tree/SpecTree.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mastergodzilla/speculative_decoding_ot when it was checked","code_sha256":"6c730d4a44e0ced5","code_sha256_prefix":"6c730d4a44e0ced5","mcp_get_code":{"code_sha256":"6c730d4a44e0ced5"}},{"arxiv_id":"2407.16448","arxiv_id_is_arxiv":true,"paper":"/paper/monowad-weather-adaptive-diffusion-model-for","title":"MonoWAD: Weather-Adaptive Diffusion Model for Robust Monocular 3D Object Detection","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisualAIKHU/MonoWAD","path":"visualDet3D/networks/detectors/MonoWAD.py","file_url":"https://github.com/VisualAIKHU/MonoWAD/blob/HEAD/visualDet3D/networks/detectors/MonoWAD.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":"8862f92d2180b857","code_sha256_prefix":"8862f92d2180b857","mcp_get_code":{"code_sha256":"8862f92d2180b857"}},{"arxiv_id":"2310.01717","arxiv_id_is_arxiv":true,"paper":"/paper/ensemble-distillation-for-unsupervised","title":"Ensemble Distillation for Unsupervised Constituency Parsing","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manga-uofa/ed4ucp","path":"library/ensemble.py","file_url":"https://github.com/manga-uofa/ed4ucp/blob/HEAD/library/ensemble.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, manga-uofa/ed4ucp when it was checked","code_sha256":"abbe0a517c586d0b","code_sha256_prefix":"abbe0a517c586d0b","mcp_get_code":{"code_sha256":"abbe0a517c586d0b"}},{"arxiv_id":"2209.10492","arxiv_id_is_arxiv":true,"paper":"/paper/summarization-programs-interpretable","title":"Summarization Programs: Interpretable Abstractive Summarization with Neural Modular Trees","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swarnahub/summarizationprograms","path":"sp_search/summarization_program.py","file_url":"https://github.com/swarnahub/summarizationprograms/blob/HEAD/sp_search/summarization_program.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":"60b1b4b986a79c52","code_sha256_prefix":"60b1b4b986a79c52","mcp_get_code":{"code_sha256":"60b1b4b986a79c52"}},{"arxiv_id":"2106.09146","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-reinforcement-learning-of","title":"Contrastive Reinforcement Learning of Symbolic Reasoning Domains","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sagnikanupam/mathdsl","path":"dreamcoder/domains/conpole/conpoleMathPrimitives.py","file_url":"https://github.com/sagnikanupam/mathdsl/blob/HEAD/dreamcoder/domains/conpole/conpoleMathPrimitives.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sagnikanupam/mathdsl when it was checked","code_sha256":"43eefe3507985e75","code_sha256_prefix":"43eefe3507985e75","mcp_get_code":{"code_sha256":"43eefe3507985e75"}},{"arxiv_id":"2009.05567","arxiv_id_is_arxiv":true,"paper":"/paper/dart-data-addition-and-removal-trees","title":"Machine Unlearning for Random Forests","date":"2020-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjbrophy47/dare","path":"dare/_classes.py","file_url":"https://github.com/jjbrophy47/dare/blob/HEAD/dare/_classes.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":"aa6d7d1382a813d6","code_sha256_prefix":"aa6d7d1382a813d6","mcp_get_code":{"code_sha256":"aa6d7d1382a813d6"}},{"arxiv_id":"2004.00221","arxiv_id_is_arxiv":true,"paper":"/paper/nbdt-neural-backed-decision-trees","title":"NBDT: Neural-Backed Decision Trees","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XAVILLA/nbdt","path":"nbdt/model.py","file_url":"https://github.com/XAVILLA/nbdt/blob/HEAD/nbdt/model.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":"4553e20f251d19cb","code_sha256_prefix":"4553e20f251d19cb","mcp_get_code":{"code_sha256":"4553e20f251d19cb"}},{"arxiv_id":"2004.00221","arxiv_id_is_arxiv":true,"paper":"/paper/nbdt-neural-backed-decision-trees","title":"NBDT: Neural-Backed Decision Trees","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alvinwan/neural-backed-decision-trees","path":"nbdt/model.py","file_url":"https://github.com/alvinwan/neural-backed-decision-trees/blob/HEAD/nbdt/model.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":"fbc1d6876bb0df31","code_sha256_prefix":"fbc1d6876bb0df31","mcp_get_code":{"code_sha256":"fbc1d6876bb0df31"}}],"record_sha256":"46688748b84be14f26f4b1c03df64bf806d3f3705e31b52aa848e54686a1da5d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}