{"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/remap","entry":"remap","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_fixture":0,"ran":4,"unverified":1},"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":"2403.06963","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gregorbachmann/next-token-failures when it was checked","code_sha256":"ca87fc1303002ce5","code_sha256_prefix":"ca87fc1303002ce5","mcp_get_code":{"code_sha256":"ca87fc1303002ce5"}},{"arxiv_id":"2312.03275","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3be9966af813948","code_sha256_prefix":"c3be9966af813948","mcp_get_code":{"code_sha256":"c3be9966af813948"}},{"arxiv_id":"2209.07735","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f9efe607667fba03","code_sha256_prefix":"f9efe607667fba03","mcp_get_code":{"code_sha256":"f9efe607667fba03"}},{"arxiv_id":"2005.13712","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6893e31ffea2cc6f","code_sha256_prefix":"6893e31ffea2cc6f","mcp_get_code":{"code_sha256":"6893e31ffea2cc6f"}},{"arxiv_id":"1910.09618","arxiv_id_is_arxiv":true,"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":"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":"71fdc307be9c30bf","code_sha256_prefix":"71fdc307be9c30bf","mcp_get_code":{"code_sha256":"71fdc307be9c30bf"}},{"arxiv_id":"ijcai2025_0949","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id 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":"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":"530e2fe178e4b490","code_sha256_prefix":"530e2fe178e4b490","mcp_get_code":{"code_sha256":"530e2fe178e4b490"}}],"record_sha256":"4f65587b66c08a1639328ff72c18ff3e1ebb52c42fbf48c5aad7f519c2b0c3af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}