{"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/compute-dpo-loss","entry":"compute_dpo_loss","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":5,"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":4,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":4},"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":"2603.09980","paper":"/paper/arxiv-2603-09980","title":"Explainable LLM Unlearning Through Reasoning","date":"2026-02-08","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"junfeng1212/TRU-main","path":"src/trainer/utils.py","file_url":"https://github.com/junfeng1212/TRU-main/blob/HEAD/src/trainer/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"ef1eb32faacefd3a","mcp_get_code":{"code_sha256":"ef1eb32faacefd3a"}},{"arxiv_id":"2601.03190","paper":"/paper/arxiv-2601-03190","title":"Maximizing Local Entropy Where It Matters: Prefix-Aware Localized LLM Unlearning","date":"2026-01-06","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"nxZhai/PALU","path":"src/trainer/utils.py","file_url":"https://github.com/nxZhai/PALU/blob/HEAD/src/trainer/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef1eb32faacefd3a","mcp_get_code":{"code_sha256":"ef1eb32faacefd3a"}},{"arxiv_id":"2510.13212","paper":"/paper/arxiv-2510-13212","title":"Towards Understanding Valuable Preference Data for Large Language Model Alignment","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"tmlr-group/TIF_LossDiff-IRM","path":"influence/analyze_loss_diff.py","file_url":"https://github.com/tmlr-group/TIF_LossDiff-IRM/blob/HEAD/influence/analyze_loss_diff.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ae9d6994bbaf2c28","mcp_get_code":{"code_sha256":"ae9d6994bbaf2c28"}},{"arxiv_id":"2510.13212","paper":"/paper/arxiv-2510-13212","title":"Towards Understanding Valuable Preference Data for Large Language Model Alignment","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"tmlr-group/TIF_LossDiff-IRM","path":"influence/analyze_slic_loss_diff.py","file_url":"https://github.com/tmlr-group/TIF_LossDiff-IRM/blob/HEAD/influence/analyze_slic_loss_diff.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"87d4a4018ae927d4","mcp_get_code":{"code_sha256":"87d4a4018ae927d4"}},{"arxiv_id":"2506.12618","paper":"/paper/openunlearning-accelerating-llm-unlearning","title":"OpenUnlearning: Accelerating LLM Unlearning via Unified Benchmarking of Methods and Metrics","date":"2025-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/open-unlearning","path":"src/trainer/utils.py","file_url":"https://github.com/locuslab/open-unlearning/blob/HEAD/src/trainer/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef1eb32faacefd3a","mcp_get_code":{"code_sha256":"ef1eb32faacefd3a"}},{"arxiv_id":"2407.15549","paper":"/paper/targeted-latent-adversarial-training-improves","title":"Latent Adversarial Training Improves Robustness to Persistent Harmful Behaviors in LLMs","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aengusl/latent-adversarial-training","path":"latent_at/lat_helpers.py","file_url":"https://github.com/aengusl/latent-adversarial-training/blob/HEAD/latent_at/lat_helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4c4e8ad30f33821","mcp_get_code":{"code_sha256":"a4c4e8ad30f33821"}}]}