{"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/merge-dicts","entry":"merge_dicts","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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":9,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":5,"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":5,"ran_fixture":0,"ran":4,"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":"2605.21539","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21539","title":"DualOptim+: Bridging Shared and Decoupled Optimizer States for Better Machine Unlearning in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"CityU-MLO/DualOptimPlus","path":"utils/utils.py","file_url":"https://github.com/CityU-MLO/DualOptimPlus/blob/HEAD/utils/utils.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, CityU-MLO/DualOptimPlus when it was checked","code_sha256":"8076aab5782c4d02","code_sha256_prefix":"8076aab5782c4d02","mcp_get_code":{"code_sha256":"8076aab5782c4d02"}},{"arxiv_id":"2602.04417","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-04417","title":"EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"LunjunZhang/ema-pg","path":"math/rllm/misc.py","file_url":"https://github.com/LunjunZhang/ema-pg/blob/HEAD/math/rllm/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7aec73d6258eba0","code_sha256_prefix":"b7aec73d6258eba0","mcp_get_code":{"code_sha256":"b7aec73d6258eba0"}},{"arxiv_id":"2602.03719","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03719","title":"BranPO: Scalable Contrastive Branch Sampling for Long-Horizon Agentic Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"YubaoZhao/BranPO","path":"rllm/misc.py","file_url":"https://github.com/YubaoZhao/BranPO/blob/HEAD/rllm/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7aec73d6258eba0","code_sha256_prefix":"b7aec73d6258eba0","mcp_get_code":{"code_sha256":"b7aec73d6258eba0"}},{"arxiv_id":"2504.01934","arxiv_id_is_arxiv":true,"paper":"/paper/illume-illuminating-unified-mllm-with-dual","title":"ILLUME+: Illuminating Unified MLLM with Dual Visual Tokenization and Diffusion Refinement","date":"2025-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"illume-unified-mllm/ILLUME_plus","path":"ILLUME/illume/registry_utils.py","file_url":"https://github.com/illume-unified-mllm/ILLUME_plus/blob/HEAD/ILLUME/illume/registry_utils.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":"10f7276899092b15","code_sha256_prefix":"10f7276899092b15","mcp_get_code":{"code_sha256":"10f7276899092b15"}},{"arxiv_id":"2410.08109","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-machine-unlearning-for-large","title":"A Closer Look at Machine Unlearning for Large Language Models","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/closer-look-LLM-unlearning","path":"utils/utils.py","file_url":"https://github.com/sail-sg/closer-look-LLM-unlearning/blob/HEAD/utils/utils.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, sail-sg/closer-look-LLM-unlearning when it was checked","code_sha256":"8076aab5782c4d02","code_sha256_prefix":"8076aab5782c4d02","mcp_get_code":{"code_sha256":"8076aab5782c4d02"}},{"arxiv_id":"2406.11614","arxiv_id_is_arxiv":true,"paper":"/paper/intrinsic-evaluation-of-unlearning-using","title":"Intrinsic Evaluation of Unlearning Using Parametric Knowledge Traces","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihuaihong/conceptvectors","path":"utils.py","file_url":"https://github.com/yihuaihong/conceptvectors/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, yihuaihong/conceptvectors, is not in the permissive set Syntology serves inline","code_sha256":"8076aab5782c4d02","code_sha256_prefix":"8076aab5782c4d02","mcp_get_code":{"code_sha256":"8076aab5782c4d02"}},{"arxiv_id":"2307.05973","arxiv_id_is_arxiv":true,"paper":"/paper/voxposer-composable-3d-value-maps-for-robotic","title":"VoxPoser: Composable 3D Value Maps for Robotic Manipulation with Language Models","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangwl18/voxposer","path":"src/LMP.py","file_url":"https://github.com/huangwl18/voxposer/blob/HEAD/src/LMP.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":"d807172220243c93","code_sha256_prefix":"d807172220243c93","mcp_get_code":{"code_sha256":"d807172220243c93"}},{"arxiv_id":"2306.10460","arxiv_id_is_arxiv":true,"paper":"/paper/instant-soup-cheap-pruning-ensembles-in-a","title":"Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models","date":"2023-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/instant_soup","path":"clip_assets/code/isp_all.py","file_url":"https://github.com/vita-group/instant_soup/blob/HEAD/clip_assets/code/isp_all.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":"3e174a2399a96927","code_sha256_prefix":"3e174a2399a96927","mcp_get_code":{"code_sha256":"3e174a2399a96927"}},{"arxiv_id":"2203.11815","arxiv_id_is_arxiv":true,"paper":"/paper/clustering-units-in-neural-networks-upstream","title":"Clustering units in neural networks: upstream vs downstream information","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wrongu/modularity","path":"util.py","file_url":"https://github.com/wrongu/modularity/blob/HEAD/util.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":"028c5c4fc9dd3797","code_sha256_prefix":"028c5c4fc9dd3797","mcp_get_code":{"code_sha256":"028c5c4fc9dd3797"}},{"arxiv_id":"2003.09338","arxiv_id_is_arxiv":true,"paper":"/paper/selecting-relevant-features-from-a-universal","title":"Selecting Relevant Features from a Multi-domain Representation for Few-shot Classification","date":"2020-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvornikita/SUR","path":"utils.py","file_url":"https://github.com/dvornikita/SUR/blob/HEAD/utils.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":"0735728c05cdb798","code_sha256_prefix":"0735728c05cdb798","mcp_get_code":{"code_sha256":"0735728c05cdb798"}},{"arxiv_id":"2003.08723","arxiv_id_is_arxiv":true,"paper":"/paper/latent-space-subdivision-stable-and","title":"Latent Space Subdivision: Stable and Controllable Time Predictions for Fluid Flow","date":"2020-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lij131/LatentSpaceSubdivision-base","path":"keras_models_general.py","file_url":"https://github.com/lij131/LatentSpaceSubdivision-base/blob/HEAD/keras_models_general.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7ec35715d22802c5","code_sha256_prefix":"7ec35715d22802c5","mcp_get_code":{"code_sha256":"7ec35715d22802c5"}},{"arxiv_id":"1806.07366","arxiv_id_is_arxiv":true,"paper":"/paper/neural-ordinary-differential-equations","title":"Neural Ordinary Differential Equations","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/numerics_independent_neural_odes","path":"models/models.py","file_url":"https://github.com/boschresearch/numerics_independent_neural_odes/blob/HEAD/models/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/numerics_independent_neural_odes, is not in the permissive set Syntology serves inline","code_sha256":"5c104e6fea609913","code_sha256_prefix":"5c104e6fea609913","mcp_get_code":{"code_sha256":"5c104e6fea609913"}},{"arxiv_id":"Szeto_The_DEVIL_Is_in_the_Details_A_Diagnostic_Evaluation_Benchmark_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Szeto_The_DEVIL_Is_in_the_Details_A_Diagnostic_Evaluation_Benchmark_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MichiganCOG/devil","path":"slurm/util.py","file_url":"https://github.com/MichiganCOG/devil/blob/HEAD/slurm/util.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":"ca5ad97e30cf1774","code_sha256_prefix":"ca5ad97e30cf1774","mcp_get_code":{"code_sha256":"ca5ad97e30cf1774"}},{"arxiv_id":"2025.findings-acl.949","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.949","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"renjie3/GRUN","path":"baseline/utils.py","file_url":"https://github.com/renjie3/GRUN/blob/HEAD/baseline/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 CityU-MLO/DualOptimPlus, and GitHub detected no licence in that repository when it was checked","code_sha256":"8076aab5782c4d02","code_sha256_prefix":"8076aab5782c4d02","mcp_get_code":{"code_sha256":"8076aab5782c4d02"}}],"record_sha256":"f5b85f826ce6105a659fa8d99c564d2cc7b39a29a48f5dcbe21ca0c6ee86e728","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}