{"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/leaf","entry":"Leaf","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":5,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"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":7,"n_samples_ran":2,"n_samples_constructed":2,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"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":2,"unverified":5},"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":"2605.23826","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-23826","title":"Decomposing Queries into Tool Calls for Long-Video Keyframe Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"michalsr/ToolMerge","path":"toolmerge/merging.py","file_url":"https://github.com/michalsr/ToolMerge/blob/HEAD/toolmerge/merging.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, michalsr/ToolMerge (NOASSERTION)","code_sha256":"3ffaca141388c64e","code_sha256_prefix":"3ffaca141388c64e","mcp_get_code":{"code_sha256":"3ffaca141388c64e"}},{"arxiv_id":"2405.19782","arxiv_id_is_arxiv":true,"paper":"/paper/dataflow-guided-retrieval-augmentation-for","title":"Dataflow-Guided Retrieval Augmentation for Repository-Level Code Completion","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/DraCo","path":"src/extract_dataflow.py","file_url":"https://github.com/nju-websoft/DraCo/blob/HEAD/src/extract_dataflow.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, nju-websoft/DraCo, is not in the permissive set Syntology serves inline","code_sha256":"db2ec1570be5d37e","code_sha256_prefix":"db2ec1570be5d37e","mcp_get_code":{"code_sha256":"db2ec1570be5d37e"}},{"arxiv_id":"2310.18443","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-fuller-understanding-of-neurons-1","title":"Towards a fuller understanding of neurons with Clustered Compositional Explanations","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krlgroup/clustered-compositional-explanations","path":"src/heuristic_search.py","file_url":"https://github.com/krlgroup/clustered-compositional-explanations/blob/HEAD/src/heuristic_search.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d19ee8c373497030","code_sha256_prefix":"d19ee8c373497030","mcp_get_code":{"code_sha256":"d19ee8c373497030"}},{"arxiv_id":"2101.08596","arxiv_id_is_arxiv":true,"paper":"/paper/leaf-a-learnable-frontend-for-audio","title":"LEAF: A Learnable Frontend for Audio Classification","date":"2021-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SarthakYadav/leaf-pytorch","path":"leaf_pytorch/frontend.py","file_url":"https://github.com/SarthakYadav/leaf-pytorch/blob/HEAD/leaf_pytorch/frontend.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, SarthakYadav/leaf-pytorch when it was checked","code_sha256":"1e7e303c902bf303","code_sha256_prefix":"1e7e303c902bf303","mcp_get_code":{"code_sha256":"1e7e303c902bf303"}},{"arxiv_id":"2101.08596","arxiv_id_is_arxiv":true,"paper":"/paper/leaf-a-learnable-frontend-for-audio","title":"LEAF: A Learnable Frontend for Audio Classification","date":"2021-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SarthakYadav/audax","path":"audax/frontends/leaf.py","file_url":"https://github.com/SarthakYadav/audax/blob/HEAD/audax/frontends/leaf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d115cb81f2c624af","code_sha256_prefix":"d115cb81f2c624af","mcp_get_code":{"code_sha256":"d115cb81f2c624af"}},{"arxiv_id":"2101.08596","arxiv_id_is_arxiv":true,"paper":"/paper/leaf-a-learnable-frontend-for-audio","title":"LEAF: A Learnable Frontend for Audio Classification","date":"2021-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cpjku/efficientleaf","path":"model/leaf.py","file_url":"https://github.com/cpjku/efficientleaf/blob/HEAD/model/leaf.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":"4507960a65ca7778","code_sha256_prefix":"4507960a65ca7778","mcp_get_code":{"code_sha256":"4507960a65ca7778"}},{"arxiv_id":"2007.05721","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-classification-with-deep","title":"Towards Robust Classification with Deep Generative Forests","date":"2020-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlCorreia/GeFs","path":"gefs/nodes.py","file_url":"https://github.com/AlCorreia/GeFs/blob/HEAD/gefs/nodes.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":"18680f3973a2a2df","code_sha256_prefix":"18680f3973a2a2df","mcp_get_code":{"code_sha256":"18680f3973a2a2df"}}],"record_sha256":"194ce16df430230152a7db123784f09d64a0d521ace459a42a22fdf3b341777d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}