{"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/get-batch-loss","entry":"get_batch_loss","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"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":"2606.27683","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-27683","title":"CBD: API-Only LLM Black-Box Unlearning through Controlled Behavioral Divergence","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"DGL-codes/CBD","path":"uld/tofuutil/data_module.py","file_url":"https://github.com/DGL-codes/CBD/blob/HEAD/uld/tofuutil/data_module.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"44dd25d964127b38","code_sha256_prefix":"44dd25d964127b38","mcp_get_code":{"code_sha256":"44dd25d964127b38"}},{"arxiv_id":"2510.02392","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-02392","title":"KnowledgeSmith: Uncovering Knowledge Updating in LLMs with Model Editing and Unlearning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"AIFrontierLab/KnowledgeSmith","path":"training/unlearn/baselines/src/utils.py","file_url":"https://github.com/AIFrontierLab/KnowledgeSmith/blob/HEAD/training/unlearn/baselines/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, AIFrontierLab/KnowledgeSmith when it was checked","code_sha256":"373cbe86765cc7cc","code_sha256_prefix":"373cbe86765cc7cc","mcp_get_code":{"code_sha256":"373cbe86765cc7cc"}},{"arxiv_id":"2506.01339","arxiv_id_is_arxiv":true,"paper":"/paper/invariance-makes-llm-unlearning-resilient","title":"Invariance Makes LLM Unlearning Resilient Even to Unanticipated Downstream Fine-Tuning","date":"2025-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OPTML-Group/Unlearn-ILU","path":"src/unlearn/utils.py","file_url":"https://github.com/OPTML-Group/Unlearn-ILU/blob/HEAD/src/unlearn/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from carol-gutianle/meow, and GitHub detected no licence in that repository when it was checked","code_sha256":"442bc919060e0f2b","code_sha256_prefix":"442bc919060e0f2b","mcp_get_code":{"code_sha256":"442bc919060e0f2b"}},{"arxiv_id":"2502.14829","arxiv_id_is_arxiv":true,"paper":"/paper/measuring-faithfulness-of-chains-of-thought","title":"Measuring Faithfulness of Chains of Thought by Unlearning Reasoning Steps","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","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":"44dd25d964127b38","code_sha256_prefix":"44dd25d964127b38","mcp_get_code":{"code_sha256":"44dd25d964127b38"}},{"arxiv_id":"2502.11190","arxiv_id_is_arxiv":true,"paper":"/paper/relearn-unlearning-via-learning-for-large","title":"ReLearn: Unlearning via Learning for Large Language Models","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/unlearn","path":"baselines/src/utils.py","file_url":"https://github.com/zjunlp/unlearn/blob/HEAD/baselines/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from AIFrontierLab/KnowledgeSmith, and GitHub detected no licence in that repository when it was checked","code_sha256":"373cbe86765cc7cc","code_sha256_prefix":"373cbe86765cc7cc","mcp_get_code":{"code_sha256":"373cbe86765cc7cc"}},{"arxiv_id":"2409.11844","arxiv_id_is_arxiv":true,"paper":"/paper/meow-memory-supervised-llm-unlearning-via","title":"MEOW: MEMOry Supervised LLM Unlearning Via Inverted Facts","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carol-gutianle/meow","path":"meow/utils.py","file_url":"https://github.com/carol-gutianle/meow/blob/HEAD/meow/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, carol-gutianle/meow when it was checked","code_sha256":"442bc919060e0f2b","code_sha256_prefix":"442bc919060e0f2b","mcp_get_code":{"code_sha256":"442bc919060e0f2b"}},{"arxiv_id":"2307.13702","arxiv_id_is_arxiv":true,"paper":"/paper/measuring-faithfulness-in-chain-of-thought","title":"Measuring Faithfulness in Chain-of-Thought Reasoning","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"technion-cs-nlp/parametric-faithfulness","path":"unlearn.py","file_url":"https://github.com/technion-cs-nlp/parametric-faithfulness/blob/HEAD/unlearn.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"44dd25d964127b38","code_sha256_prefix":"44dd25d964127b38","mcp_get_code":{"code_sha256":"44dd25d964127b38"}},{"arxiv_id":"1906.04225","arxiv_id_is_arxiv":true,"paper":"/paper/label-agnostic-sequence-labeling-by-copying","title":"Label-Agnostic Sequence Labeling by Copying Nearest Neighbors","date":"2019-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swiseman/neighbor-tagging","path":"train_words.py","file_url":"https://github.com/swiseman/neighbor-tagging/blob/HEAD/train_words.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, swiseman/neighbor-tagging when it was checked","code_sha256":"16a42c9a9ed5df3c","code_sha256_prefix":"16a42c9a9ed5df3c","mcp_get_code":{"code_sha256":"16a42c9a9ed5df3c"}}],"record_sha256":"cd98a6f3f8a58496a9092f20c286fe0be19335ae92b4c1f82461a0ab72c6e0b5","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}