{"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/treenode","entry":"TreeNode","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":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":9,"n_samples_constructed":9,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"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":9,"unverified":2},"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":"2603.28301","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-28301","title":"LIBERO-Para: A Diagnostic Benchmark and Metrics for Paraphrase Robustness in VLA Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"cau-hai-lab/LIBERO-Para","path":"metrics/compute_pride_score_example.py","file_url":"https://github.com/cau-hai-lab/LIBERO-Para/blob/HEAD/metrics/compute_pride_score_example.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":"ea541b08cda0e7eb","code_sha256_prefix":"ea541b08cda0e7eb","mcp_get_code":{"code_sha256":"ea541b08cda0e7eb"}},{"arxiv_id":"2603.07612","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07612","title":"KohakuRAG: A simple RAG framework with hierarchical document indexing","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"KohakuBlueleaf/KohakuRAG","path":"src/kohakurag/indexer.py","file_url":"https://github.com/KohakuBlueleaf/KohakuRAG/blob/HEAD/src/kohakurag/indexer.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, KohakuBlueleaf/KohakuRAG when it was checked","code_sha256":"500778942c83248c","code_sha256_prefix":"500778942c83248c","mcp_get_code":{"code_sha256":"500778942c83248c"}},{"arxiv_id":"2602.13840","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13840","title":"PrivAct: Internalizing Contextual Privacy Preservation via Multi-Agent Preference Training","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"chengyh23/PrivAct","path":"src/preference_pairs_MA.py","file_url":"https://github.com/chengyh23/PrivAct/blob/HEAD/src/preference_pairs_MA.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, chengyh23/PrivAct when it was checked","code_sha256":"e65488a0ff09e2e5","code_sha256_prefix":"e65488a0ff09e2e5","mcp_get_code":{"code_sha256":"e65488a0ff09e2e5"}},{"arxiv_id":"2511.00489","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-00489","title":"ToM: Leveraging Tree-oriented MapReduce for Long-Context Reasoning in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"gjn12-31/ToM","path":"Reasoning/pipeline.py","file_url":"https://github.com/gjn12-31/ToM/blob/HEAD/Reasoning/pipeline.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gjn12-31/ToM when it was checked","code_sha256":"8004b7e3471e60b3","code_sha256_prefix":"8004b7e3471e60b3","mcp_get_code":{"code_sha256":"8004b7e3471e60b3"}},{"arxiv_id":"2404.00909","arxiv_id_is_arxiv":true,"paper":"/paper/learning-by-correction-efficient-tuning-task","title":"Learning by Correction: Efficient Tuning Task for Zero-Shot Generative Vision-Language Reasoning","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shtuplus/iccc_cvpr2024","path":"iccc_data_generation.py","file_url":"https://github.com/shtuplus/iccc_cvpr2024/blob/HEAD/iccc_data_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fea778fe4e98da35","code_sha256_prefix":"fea778fe4e98da35","mcp_get_code":{"code_sha256":"fea778fe4e98da35"}},{"arxiv_id":"2304.00755","arxiv_id_is_arxiv":true,"paper":"/paper/effective-and-stable-role-based-multi-agent","title":"Effective and Stable Role-Based Multi-Agent Collaboration by Structural Information Principles","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/SR-MARL","path":"src/clusters/structural_entropy.py","file_url":"https://github.com/RingBDStack/SR-MARL/blob/HEAD/src/clusters/structural_entropy.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, RingBDStack/SR-MARL when it was checked","code_sha256":"96b0a038e526a111","code_sha256_prefix":"96b0a038e526a111","mcp_get_code":{"code_sha256":"96b0a038e526a111"}},{"arxiv_id":"2302.11097","arxiv_id_is_arxiv":true,"paper":"/paper/a-multi-modal-neural-geometric-solver-with","title":"A Multi-Modal Neural Geometric Solver with Textual Clauses Parsed from Diagram","date":"2023-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingliangzhang2018/PGPS","path":"model/decoder/tree_decoder.py","file_url":"https://github.com/mingliangzhang2018/PGPS/blob/HEAD/model/decoder/tree_decoder.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":"e92507afe88c64d6","code_sha256_prefix":"e92507afe88c64d6","mcp_get_code":{"code_sha256":"e92507afe88c64d6"}},{"arxiv_id":"2210.02875","arxiv_id_is_arxiv":true,"paper":"/paper/binding-language-models-in-symbolic-languages","title":"Binding Language Models in Symbolic Languages","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xlang-ai/binder","path":"nsql/parser.py","file_url":"https://github.com/xlang-ai/binder/blob/HEAD/nsql/parser.py","status":"unverified","verification_level":0,"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":"a2bdae85fa671acc","code_sha256_prefix":"a2bdae85fa671acc","mcp_get_code":{"code_sha256":"a2bdae85fa671acc"}},{"arxiv_id":"2208.05962","arxiv_id_is_arxiv":true,"paper":"/paper/pointtree-transformation-robust-point-cloud","title":"PointTree: Transformation-Robust Point Cloud Encoder with Relaxed K-D Trees","date":"2022-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"immortalCO/PointTree","path":"encoder.py","file_url":"https://github.com/immortalCO/PointTree/blob/HEAD/encoder.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, immortalCO/PointTree when it was checked","code_sha256":"4c797665c28abd83","code_sha256_prefix":"4c797665c28abd83","mcp_get_code":{"code_sha256":"4c797665c28abd83"}},{"arxiv_id":"2103.11505","arxiv_id_is_arxiv":true,"paper":"/paper/policy-guided-heuristic-search-with","title":"Policy-Guided Heuristic Search with Guarantees","date":"2021-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"levilelis/h-levin","path":"src/search/bfs_levin.py","file_url":"https://github.com/levilelis/h-levin/blob/HEAD/src/search/bfs_levin.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":"7022eab10f58ac1c","code_sha256_prefix":"7022eab10f58ac1c","mcp_get_code":{"code_sha256":"7022eab10f58ac1c"}},{"arxiv_id":"2010.12770","arxiv_id_is_arxiv":true,"paper":"/paper/conversational-semantic-parsing-for-dialog","title":"Conversational Semantic Parsing for Dialog State Tracking","date":"2020-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-tree-dst","path":"utils/tree.py","file_url":"https://github.com/apple/ml-tree-dst/blob/HEAD/utils/tree.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":"6cb03f56f9e6fa6a","code_sha256_prefix":"6cb03f56f9e6fa6a","mcp_get_code":{"code_sha256":"6cb03f56f9e6fa6a"}}],"record_sha256":"860c6846b672c86adc395e49fc785af6fadea0477afff0b33d63abe649b5a9dd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}