{"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/mode","entry":"mode","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":5,"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":3,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"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":"2307.03027","paper":"/paper/improving-retrieval-augmented-large-language","title":"Improving Retrieval-Augmented Large Language Models via Data Importance Learning","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amsterdata/ragbooster","path":"python/ragbooster/core.py","file_url":"https://github.com/amsterdata/ragbooster/blob/HEAD/python/ragbooster/core.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"50ace6dde459bae7","mcp_get_code":{"code_sha256":"50ace6dde459bae7"}},{"arxiv_id":"2107.00228","paper":"/paper/scalable-certified-segmentation-via","title":"Scalable Certified Segmentation via Randomized Smoothing","date":"2021-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/segmentation-smoothing","path":"code/multiclassify_utils.py","file_url":"https://github.com/eth-sri/segmentation-smoothing/blob/HEAD/code/multiclassify_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b2722da1e7c4968d","mcp_get_code":{"code_sha256":"b2722da1e7c4968d"}},{"arxiv_id":"2106.01254","paper":"/paper/survey-equivalence-a-procedure-for-measuring","title":"Survey Equivalence: A Procedure for Measuring Classifier Accuracy Against Human Labels","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"presnick/surveyequivalence","path":"surveyequivalence/scoring_functions.py","file_url":"https://github.com/presnick/surveyequivalence/blob/HEAD/surveyequivalence/scoring_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ca691f11a2a20be0","mcp_get_code":{"code_sha256":"ca691f11a2a20be0"}},{"arxiv_id":"2006.13189","paper":"/paper/expert-supervised-reinforcement-learning-for","title":"Expert-Supervised Reinforcement Learning for Offline Policy Learning and Evaluation","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asonabend/ESRL","path":"utils.py","file_url":"https://github.com/asonabend/ESRL/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d386ce665f87d54f","mcp_get_code":{"code_sha256":"d386ce665f87d54f"}},{"arxiv_id":"1905.10688","paper":"/paper/sherlock-a-deep-learning-approach-to-semantic","title":"Sherlock: A Deep Learning Approach to Semantic Data Type Detection","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitmedialab/sherlock-project","path":"sherlock/features/stats_helper.py","file_url":"https://github.com/mitmedialab/sherlock-project/blob/HEAD/sherlock/features/stats_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f771a29940687aa4","mcp_get_code":{"code_sha256":"f771a29940687aa4"}}]}