{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-model-type","entry":"get_model_type","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":10,"n_papers_ran":3,"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":10,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":7},"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":"2607.13591","paper":"/paper/arxiv-2607-13591","title":"Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"ericjiang18/MemCon","path":"tasks/utils.py","file_url":"https://github.com/ericjiang18/MemCon/blob/HEAD/tasks/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"22fbf3c1d8c1b401","mcp_get_code":{"code_sha256":"22fbf3c1d8c1b401"}},{"arxiv_id":"2606.00477","paper":"/paper/arxiv-2606-00477","title":"Do Text Edits Generalize to Visual Generation? Benchmarking Cross-Modal Knowledge Editing in UMMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"gxx27/UniKE","path":"util/model_utils.py","file_url":"https://github.com/gxx27/UniKE/blob/HEAD/util/model_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"758ef188aee5c6a9","mcp_get_code":{"code_sha256":"758ef188aee5c6a9"}},{"arxiv_id":"2605.10335","paper":"/paper/arxiv-2605-10335","title":"PowerStep: Memory-Efficient Adaptive Optimization via ℓ p -Norm Steepest Descent","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"yaolubrain/PowerStep","path":"megatron/core/utils.py","file_url":"https://github.com/yaolubrain/PowerStep/blob/HEAD/megatron/core/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d5a52960d5bd8eb8","mcp_get_code":{"code_sha256":"d5a52960d5bd8eb8"}},{"arxiv_id":"2602.21492","paper":"/paper/arxiv-2602-21492","title":"GradAlign: Gradient-Aligned Data Selection for LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"StigLidu/GradAlign","path":"automated/config.py","file_url":"https://github.com/StigLidu/GradAlign/blob/HEAD/automated/config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"17dc8f1091f17309","mcp_get_code":{"code_sha256":"17dc8f1091f17309"}},{"arxiv_id":"2503.19988","paper":"/paper/excot-optimizing-reasoning-for-text-to-sql","title":"ExCoT: Optimizing Reasoning for Text-to-SQL with Execution Feedback","date":"2025-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snowflakedb/ArcticTraining","path":"arctic_training/model/tiled_compute.py","file_url":"https://github.com/snowflakedb/ArcticTraining/blob/HEAD/arctic_training/model/tiled_compute.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b6c9a0be1ef593bb","mcp_get_code":{"code_sha256":"b6c9a0be1ef593bb"}},{"arxiv_id":"2411.05735","paper":"/paper/aioli-a-unified-optimization-framework-for","title":"Aioli: A Unified Optimization Framework for Language Model Data Mixing","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/aioli","path":"utils.py","file_url":"https://github.com/HazyResearch/aioli/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f262463f78c9ed6e","mcp_get_code":{"code_sha256":"f262463f78c9ed6e"}},{"arxiv_id":"2302.07636","paper":"/paper/dp-bart-for-privatized-text-rewriting-under","title":"DP-BART for Privatized Text Rewriting under Local Differential Privacy","date":"2023-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trusthlt/dp-bart-private-rewriting","path":"utils.py","file_url":"https://github.com/trusthlt/dp-bart-private-rewriting/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"239fcf9b6b9751eb","mcp_get_code":{"code_sha256":"239fcf9b6b9751eb"}},{"arxiv_id":"2301.00774","paper":"/paper/massive-language-models-can-be-accurately","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","date":"2023-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvidia/tensorrt-model-optimizer","path":"modelopt/torch/export/model_utils.py","file_url":"https://github.com/nvidia/tensorrt-model-optimizer/blob/HEAD/modelopt/torch/export/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"bc6cfb190b953479","mcp_get_code":{"code_sha256":"bc6cfb190b953479"}},{"arxiv_id":"2109.03175","paper":"/paper/when-differential-privacy-meets-nlp-the-devil","title":"When differential privacy meets NLP: The devil is in the detail","date":"2021-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trusthlt/dp-rewrite","path":"utils.py","file_url":"https://github.com/trusthlt/dp-rewrite/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0c6546186b00cfde","mcp_get_code":{"code_sha256":"0c6546186b00cfde"}},{"arxiv_id":"2106.03634","paper":"/paper/prost-physical-reasoning-of-objects-through","title":"PROST: Physical Reasoning of Objects through Space and Time","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nala-cub/prost","path":"src/baselines/results.py","file_url":"https://github.com/nala-cub/prost/blob/HEAD/src/baselines/results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3da1a72ed0d0e883","mcp_get_code":{"code_sha256":"3da1a72ed0d0e883"}}]}