{"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/get-hf-configs","entry":"get_hf_configs","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":7,"n_papers_ran":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":1,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2410.21662","paper":"/paper/f-po-generalizing-preference-optimization","title":"$f$-PO: Generalizing Preference Optimization with $f$-divergence Minimization","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/fpo","path":"src/utils/perf.py","file_url":"https://github.com/minkaixu/fpo/blob/HEAD/src/utils/perf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"df20c2f4083d17af","mcp_get_code":{"code_sha256":"df20c2f4083d17af"}},{"arxiv_id":"2410.16843","paper":"/paper/trustworthy-alignment-of-retrieval-augmented","title":"Trustworthy Alignment of Retrieval-Augmented Large Language Models via Reinforcement Learning","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zmzhang2000/trustworthy-alignment","path":"dschat/utils/perf.py","file_url":"https://github.com/zmzhang2000/trustworthy-alignment/blob/HEAD/dschat/utils/perf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df20c2f4083d17af","mcp_get_code":{"code_sha256":"df20c2f4083d17af"}},{"arxiv_id":"2406.11030","paper":"/paper/foodieqa-a-multimodal-dataset-for-fine","title":"FoodieQA: A Multimodal Dataset for Fine-Grained Understanding of Chinese Food Culture","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyan62/FoodieQA","path":"Yi/finetune/utils/perf.py","file_url":"https://github.com/lyan62/FoodieQA/blob/HEAD/Yi/finetune/utils/perf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df20c2f4083d17af","mcp_get_code":{"code_sha256":"df20c2f4083d17af"}},{"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":"dschat/utils/perf.py","file_url":"https://github.com/JiancongXiao/PM_RLHF/blob/HEAD/dschat/utils/perf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df20c2f4083d17af","mcp_get_code":{"code_sha256":"df20c2f4083d17af"}},{"arxiv_id":"2403.14112","paper":"/paper/benchmarking-chinese-commonsense-reasoning-of","title":"Benchmarking Chinese Commonsense Reasoning of LLMs: From Chinese-Specifics to Reasoning-Memorization Correlations","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"01-ai/Yi","path":"finetune/utils/perf.py","file_url":"https://github.com/01-ai/Yi/blob/HEAD/finetune/utils/perf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"df20c2f4083d17af","mcp_get_code":{"code_sha256":"df20c2f4083d17af"}},{"arxiv_id":"2402.05808","paper":"/paper/training-large-language-models-for-reasoning","title":"Training Large Language Models for Reasoning through Reverse Curriculum Reinforcement Learning","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"woooodyy/llm-reverse-curriculum-rl","path":"R3_others/dschat/utils/perf.py","file_url":"https://github.com/woooodyy/llm-reverse-curriculum-rl/blob/HEAD/R3_others/dschat/utils/perf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df20c2f4083d17af","mcp_get_code":{"code_sha256":"df20c2f4083d17af"}},{"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":"utils/perf.py","file_url":"https://github.com/liziniu/ReMax/blob/HEAD/utils/perf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df20c2f4083d17af","mcp_get_code":{"code_sha256":"df20c2f4083d17af"}}]}