{"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/tqdm-joblib","entry":"tqdm_joblib","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"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":2,"ran_fixture":0,"ran":3,"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":"2406.04606","arxiv_id_is_arxiv":true,"paper":"/paper/helpful-or-harmful-data-fine-tuning-free","title":"Helpful or Harmful Data? Fine-tuning-free Shapley Attribution for Explaining Language Model Predictions","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JTWang2000/FreeShap","path":"vinfo/utils.py","file_url":"https://github.com/JTWang2000/FreeShap/blob/HEAD/vinfo/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, JTWang2000/FreeShap when it was checked","code_sha256":"687e768b80894e09","code_sha256_prefix":"687e768b80894e09","mcp_get_code":{"code_sha256":"687e768b80894e09"}},{"arxiv_id":"2310.06000","arxiv_id_is_arxiv":true,"paper":"/paper/incentivizing-data-sharing-for-energy","title":"Towards Replication-Robust Data Markets","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdfalc/regression-markets","path":"regression_markets/common/utils.py","file_url":"https://github.com/tdfalc/regression-markets/blob/HEAD/regression_markets/common/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, tdfalc/regression-markets when it was checked","code_sha256":"687e768b80894e09","code_sha256_prefix":"687e768b80894e09","mcp_get_code":{"code_sha256":"687e768b80894e09"}},{"arxiv_id":"2309.14289","arxiv_id_is_arxiv":true,"paper":"/paper/clip-diy-clip-dense-inference-yields-open","title":"CLIP-DIY: CLIP Dense Inference Yields Open-Vocabulary Semantic Segmentation For-Free","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wysoczanska/clip-diy","path":"thirdparty/utils.py","file_url":"https://github.com/wysoczanska/clip-diy/blob/HEAD/thirdparty/utils.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, wysoczanska/clip-diy when it was checked","code_sha256":"fc83d0189940cb2f","code_sha256_prefix":"fc83d0189940cb2f","mcp_get_code":{"code_sha256":"fc83d0189940cb2f"}},{"arxiv_id":"2308.16681","arxiv_id_is_arxiv":true,"paper":"/paper/everything-everywhere-all-in-one-evaluation","title":"One Model Many Scores: Using Multiverse Analysis to Prevent Fairness Hacking and Evaluate the Influence of Model Design Decisions","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reliable-ai/fairml-multiverse","path":"fairness_multiverse/parallel.py","file_url":"https://github.com/reliable-ai/fairml-multiverse/blob/HEAD/fairness_multiverse/parallel.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, reliable-ai/fairml-multiverse, is not in the permissive set Syntology serves inline","code_sha256":"087da90da2bc052b","code_sha256_prefix":"087da90da2bc052b","mcp_get_code":{"code_sha256":"087da90da2bc052b"}},{"arxiv_id":"2110.10713","arxiv_id_is_arxiv":true,"paper":"/paper/ppfs-predictive-permutation-feature-selection","title":"PPFS: Predictive Permutation Feature Selection","date":"2021-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atif-hassan/PyImpetus","path":"PyImpetus.py","file_url":"https://github.com/atif-hassan/PyImpetus/blob/HEAD/PyImpetus.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fc7032ef481eaeb0","code_sha256_prefix":"fc7032ef481eaeb0","mcp_get_code":{"code_sha256":"fc7032ef481eaeb0"}},{"arxiv_id":"2107.00745","arxiv_id_is_arxiv":true,"paper":"/paper/q-paths-generalizing-the-geometric-annealing","title":"q-Paths: Generalizing the Geometric Annealing Path using Power Means","date":"2021-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vmasrani/qpaths_uai_2021","path":"toy/src/utils.py","file_url":"https://github.com/vmasrani/qpaths_uai_2021/blob/HEAD/toy/src/utils.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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fc7032ef481eaeb0","code_sha256_prefix":"fc7032ef481eaeb0","mcp_get_code":{"code_sha256":"fc7032ef481eaeb0"}},{"arxiv_id":"1805.04755","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-and-effective-model-based-variable","title":"A Simple and Effective Model-Based Variable Importance Measure","date":"2018-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"monte-flora/scikit-explain","path":"skexplain/common/multiprocessing_utils.py","file_url":"https://github.com/monte-flora/scikit-explain/blob/HEAD/skexplain/common/multiprocessing_utils.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":"59e0a7bc515e7b38","code_sha256_prefix":"59e0a7bc515e7b38","mcp_get_code":{"code_sha256":"59e0a7bc515e7b38"}}],"record_sha256":"f92ed1764b36bfdb557284901ba1756bbd2e3c9510ac7e6ce980148a2a60a675","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}