{"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/remap","entry":"remap","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":6,"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":3},"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":"2403.06963","paper":"/paper/the-pitfalls-of-next-token-prediction","title":"The pitfalls of next-token prediction","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gregorbachmann/next-token-failures","path":"utils/load.py","file_url":"https://github.com/gregorbachmann/next-token-failures/blob/HEAD/utils/load.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ca87fc1303002ce5","mcp_get_code":{"code_sha256":"ca87fc1303002ce5"}},{"arxiv_id":"2312.03275","paper":"/paper/vlfm-vision-language-frontier-maps-for-zero","title":"VLFM: Vision-Language Frontier Maps for Zero-Shot Semantic Navigation","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdaiinstitute/vlfm","path":"vlfm/mapping/value_map.py","file_url":"https://github.com/bdaiinstitute/vlfm/blob/HEAD/vlfm/mapping/value_map.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c3be9966af813948","mcp_get_code":{"code_sha256":"c3be9966af813948"}},{"arxiv_id":"2209.07735","paper":"/paper/enhance-the-visual-representation-via","title":"Enhance the Visual Representation via Discrete Adversarial Training","date":"2022-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba/easyrobust","path":"easyrobust/modules/prime.py","file_url":"https://github.com/alibaba/easyrobust/blob/HEAD/easyrobust/modules/prime.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f9efe607667fba03","mcp_get_code":{"code_sha256":"f9efe607667fba03"}},{"arxiv_id":"2005.13712","paper":"/paper/mitigating-advanced-adversarial-attacks-with","title":"Mitigating Advanced Adversarial Attacks with More Advanced Gradient Obfuscation Techniques","date":"2020-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YiZeng623/Advanced-Gradient-Obfuscating","path":"defense.py","file_url":"https://github.com/YiZeng623/Advanced-Gradient-Obfuscating/blob/HEAD/defense.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6893e31ffea2cc6f","mcp_get_code":{"code_sha256":"6893e31ffea2cc6f"}},{"arxiv_id":"1910.09618","paper":"/paper/geometry-of-graph-partitions-via-optimal","title":"Geometry of Graph Partitions via Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2019-10","title_source":"archive","repo":"vrdi/geometry-of-graph-partitions","path":"Iowa/save_data.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/Iowa/save_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71fdc307be9c30bf","mcp_get_code":{"code_sha256":"71fdc307be9c30bf"}},{"arxiv_id":"ijcai2025_0949","paper":null,"title":"arXiv:ijcai2025_0949","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RDLLab/pomdp-py-porpp","path":"pomdp_py/utils/misc.py","file_url":"https://github.com/RDLLab/pomdp-py-porpp/blob/HEAD/pomdp_py/utils/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"530e2fe178e4b490","mcp_get_code":{"code_sha256":"530e2fe178e4b490"}}]}