{"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/load-dataset-column","entry":"load_dataset_column","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":9,"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":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":3,"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":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2503.12524","arxiv_id_is_arxiv":true,"paper":"/paper/exaone-deep-reasoning-enhanced-language","title":"EXAONE Deep: Reasoning Enhanced Language Models","date":"2025-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tengxiao1/simper","path":"alignment/decontaminate.py","file_url":"https://github.com/tengxiao1/simper/blob/HEAD/alignment/decontaminate.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":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}},{"arxiv_id":"2502.18274","arxiv_id_is_arxiv":true,"paper":"/paper/citrus-leveraging-expert-cognitive-pathways","title":"Citrus: Leveraging Expert Cognitive Pathways in a Medical Language Model for Advanced Medical Decision Support","date":"2025-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jdh-algo/Citrus","path":"model_train/alignment/decontaminate.py","file_url":"https://github.com/jdh-algo/Citrus/blob/HEAD/model_train/alignment/decontaminate.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":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}},{"arxiv_id":"2410.24198","arxiv_id_is_arxiv":true,"paper":"/paper/selfcodealign-self-alignment-for-code","title":"SelfCodeAlign: Self-Alignment for Code Generation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigcode-project/starcoder2-self-align","path":"src/star_align/decontamination/benchmark_data.py","file_url":"https://github.com/bigcode-project/starcoder2-self-align/blob/HEAD/src/star_align/decontamination/benchmark_data.py","status":"unverified","verification_level":0,"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":"9c7f0c27b8d08b0f","code_sha256_prefix":"9c7f0c27b8d08b0f","mcp_get_code":{"code_sha256":"9c7f0c27b8d08b0f"}},{"arxiv_id":"2410.10148","arxiv_id_is_arxiv":true,"paper":"/paper/a-dpo-adaptive-reward-margin-is-what-direct","title":"$α$-DPO: Adaptive Reward Margin is What Direct Preference Optimization Needs","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junkangwu/alpha-dpo","path":"alignment/decontaminate.py","file_url":"https://github.com/junkangwu/alpha-dpo/blob/HEAD/alignment/decontaminate.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":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}},{"arxiv_id":"2410.03145","arxiv_id_is_arxiv":true,"paper":"/paper/margin-matching-preference-optimization","title":"Margin Matching Preference Optimization: Enhanced Model Alignment with Granular Feedback","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kykim0/margin-matching-pref-opt","path":"src/alignment/decontaminate.py","file_url":"https://github.com/kykim0/margin-matching-pref-opt/blob/HEAD/src/alignment/decontaminate.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":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}},{"arxiv_id":"2409.03444","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-large-language-models-for-domain-1","title":"Fine-tuning large language models for domain adaptation: Exploration of training strategies, scaling, model merging and synergistic capabilities","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamm-mit/llm-finetuning","path":"alignment-handbook/src/alignment/decontaminate.py","file_url":"https://github.com/lamm-mit/llm-finetuning/blob/HEAD/alignment-handbook/src/alignment/decontaminate.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, lamm-mit/llm-finetuning when it was checked","code_sha256":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}},{"arxiv_id":"2407.09014","arxiv_id_is_arxiv":true,"paper":"/paper/compact-compressing-retrieved-documents","title":"CompAct: Compressing Retrieved Documents Actively for Question Answering","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmis-lab/CompAct","path":"alignment-handbook/src/alignment/decontaminate.py","file_url":"https://github.com/dmis-lab/CompAct/blob/HEAD/alignment-handbook/src/alignment/decontaminate.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, dmis-lab/CompAct when it was checked","code_sha256":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}},{"arxiv_id":"2406.19371","arxiv_id_is_arxiv":true,"paper":"/paper/suri-multi-constraint-instruction-following","title":"Suri: Multi-constraint Instruction Following for Long-form Text Generation","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chtmp223/suri","path":"ft/lib/alignment_mod/decontaminate.py","file_url":"https://github.com/chtmp223/suri/blob/HEAD/ft/lib/alignment_mod/decontaminate.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, chtmp223/suri when it was checked","code_sha256":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}},{"arxiv_id":"2406.08414","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-preference-optimization","title":"Discovering Preference Optimization Algorithms with and for Large Language Models","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luchris429/DiscoPOP","path":"src/alignment/decontaminate.py","file_url":"https://github.com/luchris429/DiscoPOP/blob/HEAD/src/alignment/decontaminate.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":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}},{"arxiv_id":"2405.14734","arxiv_id_is_arxiv":true,"paper":"/paper/simpo-simple-preference-optimization-with-a","title":"SimPO: Simple Preference Optimization with a Reference-Free Reward","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/SimPO","path":"alignment/decontaminate.py","file_url":"https://github.com/princeton-nlp/SimPO/blob/HEAD/alignment/decontaminate.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":"a3791c5c2185e013","code_sha256_prefix":"a3791c5c2185e013","mcp_get_code":{"code_sha256":"a3791c5c2185e013"}}],"record_sha256":"ada7117dd1656dc2a30e4466a73150e17f40b59a6f4bf3db150f536daef77c00","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}