{"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-sample-text","entry":"prepare_sample_text","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":8,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":9,"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":4,"ran_fixture":0,"ran":1,"unverified":2},"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":"2409.18618","arxiv_id_is_arxiv":true,"paper":"/paper/model-based-preference-optimization-in","title":"Model-based Preference Optimization in Abstractive Summarization without Human Feedback","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjaep/MPO","path":"preferred_FT.py","file_url":"https://github.com/cjaep/MPO/blob/HEAD/preferred_FT.py","status":"unverified","verification_level":0,"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, cjaep/MPO when it was checked","code_sha256":"556aa92bf20578ab","code_sha256_prefix":"556aa92bf20578ab","mcp_get_code":{"code_sha256":"556aa92bf20578ab"}},{"arxiv_id":"2409.18618","arxiv_id_is_arxiv":true,"paper":"/paper/model-based-preference-optimization-in","title":"Model-based Preference Optimization in Abstractive Summarization without Human Feedback","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjaep/MPO","path":"sft.py","file_url":"https://github.com/cjaep/MPO/blob/HEAD/sft.py","status":"unverified","verification_level":0,"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, cjaep/MPO when it was checked","code_sha256":"3cfed02e13013093","code_sha256_prefix":"3cfed02e13013093","mcp_get_code":{"code_sha256":"3cfed02e13013093"}},{"arxiv_id":"2407.12043","arxiv_id_is_arxiv":true,"paper":"/paper/the-art-of-saying-no-contextual-noncompliance","title":"The Art of Saying No: Contextual Noncompliance in Language Models","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/compred","path":"sft.py","file_url":"https://github.com/allenai/compred/blob/HEAD/sft.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 taiminglu/seamless, and GitHub detected no licence in that repository when it was checked","code_sha256":"148dc2c38b7cd922","code_sha256_prefix":"148dc2c38b7cd922","mcp_get_code":{"code_sha256":"148dc2c38b7cd922"}},{"arxiv_id":"2406.10960","arxiv_id_is_arxiv":true,"paper":"/paper/escot-towards-interpretable-emotional-support","title":"ESCoT: Towards Interpretable Emotional Support Dialogue Systems","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TeigenZhang/ESCoT","path":"supervised_finetuning_cot.py","file_url":"https://github.com/TeigenZhang/ESCoT/blob/HEAD/supervised_finetuning_cot.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, TeigenZhang/ESCoT when it was checked","code_sha256":"b660a6bb2cfcc092","code_sha256_prefix":"b660a6bb2cfcc092","mcp_get_code":{"code_sha256":"b660a6bb2cfcc092"}},{"arxiv_id":"2406.07971","arxiv_id_is_arxiv":true,"paper":"/paper/it-takes-two-on-the-seamlessness-between","title":"It Takes Two: On the Seamlessness between Reward and Policy Model in RLHF","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taiminglu/seamless","path":"code/train/sft.py","file_url":"https://github.com/taiminglu/seamless/blob/HEAD/code/train/sft.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, taiminglu/seamless when it was checked","code_sha256":"148dc2c38b7cd922","code_sha256_prefix":"148dc2c38b7cd922","mcp_get_code":{"code_sha256":"148dc2c38b7cd922"}},{"arxiv_id":"2405.01511","arxiv_id_is_arxiv":true,"paper":"/paper/d2po-discriminator-guided-dpo-with-response","title":"D2PO: Discriminator-Guided DPO with Response Evaluation Models","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PrasannS/d2po","path":"src/trainsft.py","file_url":"https://github.com/PrasannS/d2po/blob/HEAD/src/trainsft.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, PrasannS/d2po when it was checked","code_sha256":"148dc2c38b7cd922","code_sha256_prefix":"148dc2c38b7cd922","mcp_get_code":{"code_sha256":"148dc2c38b7cd922"}},{"arxiv_id":"2401.00788","arxiv_id_is_arxiv":true,"paper":"/paper/astraios-parameter-efficient-instruction","title":"Astraios: Parameter-Efficient Instruction Tuning Code Large Language Models","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigcode-project/astraios","path":"training/finetune.py","file_url":"https://github.com/bigcode-project/astraios/blob/HEAD/training/finetune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1163ae6f8c7ed82a","code_sha256_prefix":"1163ae6f8c7ed82a","mcp_get_code":{"code_sha256":"1163ae6f8c7ed82a"}},{"arxiv_id":"2310.11564","arxiv_id_is_arxiv":true,"paper":"/paper/personalized-soups-personalized-large","title":"Personalized Soups: Personalized Large Language Model Alignment via Post-hoc Parameter Merging","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeljang/rlphf","path":"training/multitask_training.py","file_url":"https://github.com/joeljang/rlphf/blob/HEAD/training/multitask_training.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, joeljang/rlphf when it was checked","code_sha256":"c91f5610ae8e27c8","code_sha256_prefix":"c91f5610ae8e27c8","mcp_get_code":{"code_sha256":"c91f5610ae8e27c8"}},{"arxiv_id":"2309.16155","arxiv_id_is_arxiv":true,"paper":"/paper/the-trickle-down-impact-of-reward-in","title":"The Trickle-down Impact of Reward (In-)consistency on RLHF","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shadowkiller33/contrast-instruction","path":"code/supervised_finetuning.py","file_url":"https://github.com/shadowkiller33/contrast-instruction/blob/HEAD/code/supervised_finetuning.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, shadowkiller33/contrast-instruction when it was checked","code_sha256":"148dc2c38b7cd922","code_sha256_prefix":"148dc2c38b7cd922","mcp_get_code":{"code_sha256":"148dc2c38b7cd922"}},{"arxiv_id":"2305.06161","arxiv_id_is_arxiv":true,"paper":"/paper/starcoder-may-the-source-be-with-you","title":"StarCoder: may the source be with you!","date":"2023-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigcode-project/starcoder","path":"finetune/finetune.py","file_url":"https://github.com/bigcode-project/starcoder/blob/HEAD/finetune/finetune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e471bf54711b54f","code_sha256_prefix":"6e471bf54711b54f","mcp_get_code":{"code_sha256":"6e471bf54711b54f"}},{"arxiv_id":"2301.03988","arxiv_id_is_arxiv":true,"paper":"/paper/santacoder-don-t-reach-for-the-stars","title":"SantaCoder: don't reach for the stars!","date":"2023-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"6e471bf54711b54f","code_sha256_prefix":"6e471bf54711b54f","mcp_get_code":{"code_sha256":"6e471bf54711b54f"}}],"record_sha256":"59d9a31cd6a98e587491942dafb446c298d681b4353963e419b31966ee612173","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}