{"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-run-id","entry":"get_run_id","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":6,"n_papers_ran":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":6,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"unverified":2},"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":"2606.24841","paper":"/paper/arxiv-2606-24841","title":"Matching Tasks to Objectives: Fine-Tuning and Prompt-Tuning Strategies for Encoder-Decoder Pre-trained Language Models","date":"2026-06-23","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"puraminy/MTO","path":"mto/mylogs.py","file_url":"https://github.com/puraminy/MTO/blob/HEAD/mto/mylogs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce914ac39a8ef967","mcp_get_code":{"code_sha256":"ce914ac39a8ef967"}},{"arxiv_id":"2606.22649","paper":"/paper/arxiv-2606-22649","title":"MaRS: Robust Out-of-Distribution Detection via Mahalanobis Residual Scoring","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"francescodisalvo05/mars","path":"src/utils.py","file_url":"https://github.com/francescodisalvo05/mars/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"63f801db6b63f48a","mcp_get_code":{"code_sha256":"63f801db6b63f48a"}},{"arxiv_id":"2603.04639","paper":"/paper/arxiv-2603-04639","title":"RoboMME: Benchmarking and Understanding Memory for Robotic Generalist Policies","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"RoboMME/OpenVLA-OFT","path":"vla-scripts/finetune.py","file_url":"https://github.com/RoboMME/OpenVLA-OFT/blob/HEAD/vla-scripts/finetune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f5ee0f67427e461","mcp_get_code":{"code_sha256":"4f5ee0f67427e461"}},{"arxiv_id":"2502.19645","paper":"/paper/fine-tuning-vision-language-action-models","title":"Fine-Tuning Vision-Language-Action Models: Optimizing Speed and Success","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moojink/openvla-oft","path":"vla-scripts/finetune.py","file_url":"https://github.com/moojink/openvla-oft/blob/HEAD/vla-scripts/finetune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b2a2aa060e1e24f","mcp_get_code":{"code_sha256":"8b2a2aa060e1e24f"}},{"arxiv_id":"2406.16828","paper":"/paper/ragnarok-a-reusable-rag-framework-and","title":"Ragnarök: A Reusable RAG Framework and Baselines for TREC 2024 Retrieval-Augmented Generation Track","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/nuggetizer","path":"src/nuggetizer/cli/io.py","file_url":"https://github.com/castorini/nuggetizer/blob/HEAD/src/nuggetizer/cli/io.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":"8fa7a665d31a83dc","mcp_get_code":{"code_sha256":"8fa7a665d31a83dc"}},{"arxiv_id":"2107.01904","paper":"/paper/ensemble-and-auxiliary-tasks-for-data","title":"Ensemble and Auxiliary Tasks for Data-Efficient Deep Reinforcement Learning","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NUS-LID/RENAULT","path":"benchmark.py","file_url":"https://github.com/NUS-LID/RENAULT/blob/HEAD/benchmark.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"839e15e460fa5a1a","mcp_get_code":{"code_sha256":"839e15e460fa5a1a"}}]}