{"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/prepare-singlesample","entry":"prepare_singlesample","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":0,"ran_fixture":0,"ran":2,"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":"2405.16455","arxiv_id_is_arxiv":true,"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":"step2_reward_model_finetuning/rw_eval.py","file_url":"https://github.com/JiancongXiao/PM_RLHF/blob/HEAD/step2_reward_model_finetuning/rw_eval.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, JiancongXiao/PM_RLHF when it was checked","code_sha256":"779ea48e220986c3","code_sha256_prefix":"779ea48e220986c3","mcp_get_code":{"code_sha256":"779ea48e220986c3"}},{"arxiv_id":"2404.17287","arxiv_id_is_arxiv":true,"paper":"/paper/when-to-trust-llms-aligning-confidence-with","title":"When to Trust LLMs: Aligning Confidence with Response Quality","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taoshuchang/conqord","path":"step2_reward_model/rw_eval.py","file_url":"https://github.com/taoshuchang/conqord/blob/HEAD/step2_reward_model/rw_eval.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, taoshuchang/conqord when it was checked","code_sha256":"779ea48e220986c3","code_sha256_prefix":"779ea48e220986c3","mcp_get_code":{"code_sha256":"779ea48e220986c3"}},{"arxiv_id":"2310.10505","arxiv_id_is_arxiv":true,"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":"step2_reward_model_finetuning/rw_eval.py","file_url":"https://github.com/liziniu/ReMax/blob/HEAD/step2_reward_model_finetuning/rw_eval.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, liziniu/ReMax when it was checked","code_sha256":"779ea48e220986c3","code_sha256_prefix":"779ea48e220986c3","mcp_get_code":{"code_sha256":"779ea48e220986c3"}},{"arxiv_id":"2308.02223","arxiv_id_is_arxiv":true,"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/step2_reward_model_finetuning/rw_eval.py","file_url":"https://github.com/wangclnlp/DeepSpeed-Chat-Extension/blob/HEAD/rlhf_llama/deepspeed_chat/training/step2_reward_model_finetuning/rw_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"11e574c0b1fbdefc","code_sha256_prefix":"11e574c0b1fbdefc","mcp_get_code":{"code_sha256":"11e574c0b1fbdefc"}},{"arxiv_id":"2024.naacl-long.326","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.naacl-long.326","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LanXiu0523/RLHF_instructGPT","path":"applications/inference/RM_eval.py","file_url":"https://github.com/LanXiu0523/RLHF_instructGPT/blob/HEAD/applications/inference/RM_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from JiancongXiao/PM_RLHF, and GitHub detected no licence in that repository when it was checked","code_sha256":"779ea48e220986c3","code_sha256_prefix":"779ea48e220986c3","mcp_get_code":{"code_sha256":"779ea48e220986c3"}}],"record_sha256":"941163752cdcd93b4bfa31be3007a4cc886c87f8051fe4b966ba2b8e3f50adf4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}