{"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/restore","entry":"restore","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":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":5,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"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":"2607.16431","paper":"/paper/arxiv-2607-16431","title":"RIMS: Preference Optimization via Smoothed Multi-pair Aggregation for Small-Scale LLM Retrieval-Augmented Generation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"tptrix29/RIMS","path":"training/data_vllm.py","file_url":"https://github.com/tptrix29/RIMS/blob/HEAD/training/data_vllm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ab38c8517a7a5ef","mcp_get_code":{"code_sha256":"1ab38c8517a7a5ef"}},{"arxiv_id":"2402.06680","paper":"/paper/social-physics-informed-diffusion-model-for","title":"Social Physics Informed Diffusion Model for Crowd Simulation","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/SPDiff","path":"models/trajectron.py","file_url":"https://github.com/tsinghua-fib-lab/SPDiff/blob/HEAD/models/trajectron.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"18974426ec3297c6","mcp_get_code":{"code_sha256":"18974426ec3297c6"}},{"arxiv_id":"2204.10878","paper":"/paper/chapterbreak-a-challenge-dataset-for-long","title":"ChapterBreak: A Challenge Dataset for Long-Range Language Models","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SimengSun/ChapterBreak","path":"models/utils.py","file_url":"https://github.com/SimengSun/ChapterBreak/blob/HEAD/models/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":"9e3122d6ed9342b1","mcp_get_code":{"code_sha256":"9e3122d6ed9342b1"}},{"arxiv_id":"2108.06098","paper":"/paper/fedpara-low-rank-hadamard-product","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","date":"2021-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kohakublueleaf/lycoris","path":"lycoris/functional/loha.py","file_url":"https://github.com/kohakublueleaf/lycoris/blob/HEAD/lycoris/functional/loha.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"169c00861c4d2f60","mcp_get_code":{"code_sha256":"169c00861c4d2f60"}},{"arxiv_id":"2104.03474","paper":"/paper/revisiting-simple-neural-probabilistic","title":"Revisiting Simple Neural Probabilistic Language Models","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SimengSun/revisit-nplm","path":"models/utils.py","file_url":"https://github.com/SimengSun/revisit-nplm/blob/HEAD/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"c21d5cfb9ef52750","mcp_get_code":{"code_sha256":"c21d5cfb9ef52750"}},{"arxiv_id":"1906.02780","paper":"/paper/syntactically-supervised-transformers-for","title":"Syntactically Supervised Transformers for Faster Neural Machine Translation","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dojoteef/synst","path":"models/utils.py","file_url":"https://github.com/dojoteef/synst/blob/HEAD/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"c21d5cfb9ef52750","mcp_get_code":{"code_sha256":"c21d5cfb9ef52750"}}]}