{"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/generate-constrastive-search","entry":"generate_constrastive_search","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-25T09:33:49+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":5,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2405.16455","paper":"/paper/on-the-algorithmic-bias-of-aligning-large","title":"On the Algorithmic Bias of Aligning Large Language Models with RLHF: Preference Collapse and Matching Regularization","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiancongXiao/PM_RLHF","path":"step1_supervised_finetuning/prompt_eval.py","file_url":"https://github.com/JiancongXiao/PM_RLHF/blob/HEAD/step1_supervised_finetuning/prompt_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"385922750eb70702","mcp_get_code":{"code_sha256":"385922750eb70702"}},{"arxiv_id":"2310.20246","paper":"/paper/breaking-language-barriers-in-multilingual","title":"Breaking Language Barriers in Multilingual Mathematical Reasoning: Insights and Observations","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/MathOctopus","path":"step1_supervised_finetuning/prompt_eval.py","file_url":"https://github.com/microsoft/MathOctopus/blob/HEAD/step1_supervised_finetuning/prompt_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"385922750eb70702","mcp_get_code":{"code_sha256":"385922750eb70702"}},{"arxiv_id":"2310.10505","paper":"/paper/remax-a-simple-effective-and-efficient-method","title":"ReMax: A Simple, Effective, and Efficient Reinforcement Learning Method for Aligning Large Language Models","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liziniu/ReMax","path":"step1_supervised_finetuning/prompt_eval.py","file_url":"https://github.com/liziniu/ReMax/blob/HEAD/step1_supervised_finetuning/prompt_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"385922750eb70702","mcp_get_code":{"code_sha256":"385922750eb70702"}},{"arxiv_id":"2308.02223","paper":"/paper/esrl-efficient-sampling-based-reinforcement","title":"ESRL: Efficient Sampling-based Reinforcement Learning for Sequence Generation","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangclnlp/DeepSpeed-Chat-Extension","path":"rlhf_llama/deepspeed_chat/training/step1_supervised_finetuning/prompt_eval.py","file_url":"https://github.com/wangclnlp/DeepSpeed-Chat-Extension/blob/HEAD/rlhf_llama/deepspeed_chat/training/step1_supervised_finetuning/prompt_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"385922750eb70702","mcp_get_code":{"code_sha256":"385922750eb70702"}},{"arxiv_id":"2024.naacl-long.326","paper":null,"title":"arXiv:2024.naacl-long.326","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LanXiu0523/RLHF_instructGPT","path":"applications/inference/prompt_eval.py","file_url":"https://github.com/LanXiu0523/RLHF_instructGPT/blob/HEAD/applications/inference/prompt_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"385922750eb70702","mcp_get_code":{"code_sha256":"385922750eb70702"}}]}