{"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/sanitize","entry":"sanitize","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":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":13,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":13,"n_places_pointer_only":5,"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":4,"ran_fixture":0,"ran":9,"unverified":0},"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":"2605.17364","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17364","title":"NewsLens: A Multi-Agent Framework for Adversarial News Bias Navigation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"joyboseroy/newslens","path":"newsbiasagents/graph/falkor_writer.py","file_url":"https://github.com/joyboseroy/newslens/blob/HEAD/newsbiasagents/graph/falkor_writer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6b967766845baad","code_sha256_prefix":"b6b967766845baad","mcp_get_code":{"code_sha256":"b6b967766845baad"}},{"arxiv_id":"2605.12652","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12652","title":"Multi-Rollout On-Policy Distillation via Peer Successes and Failures","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"viviable/mopd_code","path":"analysis/fetch_wandb_metric_compare.py","file_url":"https://github.com/viviable/mopd_code/blob/HEAD/analysis/fetch_wandb_metric_compare.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f3c534aa4ba4ee2","code_sha256_prefix":"6f3c534aa4ba4ee2","mcp_get_code":{"code_sha256":"6f3c534aa4ba4ee2"}},{"arxiv_id":"2410.20247","arxiv_id_is_arxiv":true,"paper":"/paper/model-equality-testing-which-model-is-this","title":"Model Equality Testing: Which Model Is This API Serving?","date":"2024-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"i-gao/model-equality-testing","path":"model_equality_testing/src/utils.py","file_url":"https://github.com/i-gao/model-equality-testing/blob/HEAD/model_equality_testing/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, i-gao/model-equality-testing when it was checked","code_sha256":"ee41f9a8c5aa9ab8","code_sha256_prefix":"ee41f9a8c5aa9ab8","mcp_get_code":{"code_sha256":"ee41f9a8c5aa9ab8"}},{"arxiv_id":"2402.18747","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuned-machine-translation-metrics","title":"Fine-Tuned Machine Translation Metrics Struggle in Unseen Domains","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/bio-mqm-dataset","path":"metrics_domain_adaptation/scripts/02-data/04a-get_mqm_bio.py","file_url":"https://github.com/amazon-science/bio-mqm-dataset/blob/HEAD/metrics_domain_adaptation/scripts/02-data/04a-get_mqm_bio.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b0687524fbebfa93","code_sha256_prefix":"b0687524fbebfa93","mcp_get_code":{"code_sha256":"b0687524fbebfa93"}},{"arxiv_id":"2308.13067","arxiv_id_is_arxiv":true,"paper":"/paper/causal-parrots-large-language-models-may-talk","title":"Causal Parrots: Large Language Models May Talk Causality But Are Not Causal","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moritzwillig/causalparrots","path":"embeddings/prepare_concept_net_data.py","file_url":"https://github.com/moritzwillig/causalparrots/blob/HEAD/embeddings/prepare_concept_net_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, moritzwillig/causalparrots when it was checked","code_sha256":"ee2e13c98fdc5272","code_sha256_prefix":"ee2e13c98fdc5272","mcp_get_code":{"code_sha256":"ee2e13c98fdc5272"}},{"arxiv_id":"2307.15190","arxiv_id_is_arxiv":true,"paper":"/paper/f-divergence-minimization-for-sequence-level","title":"f-Divergence Minimization for Sequence-Level Knowledge Distillation","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manga-uofa/fdistill","path":"chat/convert_pl_checkpoint_to_hf.py","file_url":"https://github.com/manga-uofa/fdistill/blob/HEAD/chat/convert_pl_checkpoint_to_hf.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, manga-uofa/fdistill when it was checked","code_sha256":"c6524e06623e115e","code_sha256_prefix":"c6524e06623e115e","mcp_get_code":{"code_sha256":"c6524e06623e115e"}},{"arxiv_id":"2203.17070","arxiv_id_is_arxiv":true,"paper":"/paper/traffic4cast-at-neurips-2021-temporal-and","title":"Traffic4cast at NeurIPS 2021 -- Temporal and Spatial Few-Shot Transfer Learning in Gridded Geo-Spatial Processes","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iarai/NeurIPS2021-traffic4cast","path":"t4c21/scorecomp.py","file_url":"https://github.com/iarai/NeurIPS2021-traffic4cast/blob/HEAD/t4c21/scorecomp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf234e3537a60fd4","code_sha256_prefix":"bf234e3537a60fd4","mcp_get_code":{"code_sha256":"bf234e3537a60fd4"}},{"arxiv_id":"2104.10869","arxiv_id_is_arxiv":true,"paper":"/paper/crysxpp-an-explainable-property-predictor-for","title":"CrysXPP:An Explainable Property Predictor for Crystalline Materials","date":null,"month_inferred_from_arxiv_id":"2021-04","title_source":"archive","repo":"iitkgpaiforscience/crysxpp","path":"src/prop.py","file_url":"https://github.com/iitkgpaiforscience/crysxpp/blob/HEAD/src/prop.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":"f997a9a7c06ccbbf","code_sha256_prefix":"f997a9a7c06ccbbf","mcp_get_code":{"code_sha256":"f997a9a7c06ccbbf"}},{"arxiv_id":"2002.08155","arxiv_id_is_arxiv":true,"paper":"/paper/codebert-a-pre-trained-model-for-programming","title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peri-source/peri","path":"peri/logger.py","file_url":"https://github.com/peri-source/peri/blob/HEAD/peri/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e5dd6eaf5b83724","code_sha256_prefix":"2e5dd6eaf5b83724","mcp_get_code":{"code_sha256":"2e5dd6eaf5b83724"}},{"arxiv_id":"1702.08734","arxiv_id_is_arxiv":true,"paper":"/paper/billion-scale-similarity-search-with-gpus","title":"Billion-scale similarity search with GPUs","date":"2017-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NGDSystems/faiss","path":"benchs/bench_gpu_1bn.py","file_url":"https://github.com/NGDSystems/faiss/blob/HEAD/benchs/bench_gpu_1bn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, NGDSystems/faiss, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"3246aac64c9cf190","code_sha256_prefix":"3246aac64c9cf190","mcp_get_code":{"code_sha256":"3246aac64c9cf190"}},{"arxiv_id":"1702.08734","arxiv_id_is_arxiv":true,"paper":"/paper/billion-scale-similarity-search-with-gpus","title":"Billion-scale similarity search with GPUs","date":"2017-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PhilipBAdams/faiss-learned-termination-prior-weighted","path":"benchs/learned_termination/compute_gt.py","file_url":"https://github.com/PhilipBAdams/faiss-learned-termination-prior-weighted/blob/HEAD/benchs/learned_termination/compute_gt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, PhilipBAdams/faiss-learned-termination-prior-weighted, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"c7cb5f9b4731ed5a","code_sha256_prefix":"c7cb5f9b4731ed5a","mcp_get_code":{"code_sha256":"c7cb5f9b4731ed5a"}},{"arxiv_id":"1603.09320","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-robust-approximate-nearest","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nmslib/nmslib","path":"benchmark/make_plots.py","file_url":"https://github.com/nmslib/nmslib/blob/HEAD/benchmark/make_plots.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ca9f55920b86b16","code_sha256_prefix":"4ca9f55920b86b16","mcp_get_code":{"code_sha256":"4ca9f55920b86b16"}},{"arxiv_id":"2024.findings-acl.868","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-acl.868","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ljcleo/debatrix","path":"debatrix/util.py","file_url":"https://github.com/ljcleo/debatrix/blob/HEAD/debatrix/util.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":"3fbacbbe317df2d9","code_sha256_prefix":"3fbacbbe317df2d9","mcp_get_code":{"code_sha256":"3fbacbbe317df2d9"}}],"record_sha256":"9b1ae1292f45be9dcd8ae5b38911ba8c96e381a4f6163fe209a8bf798e374ba9","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}