Home › Code › merge_dicts

merge_dicts

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

merge_dicts appears in the code Syntology harvested for 14 papers, as 10 distinct code bodies found in 14 places (a place is one code body under one paper). Of the 14 papers, 13 with a sample that ran: 4 with a run with no instrument failure, 9 where every run was a failure of Syntology's instrument. 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named merge_dicts do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 10 distinct code bodies named merge_dicts: 9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
5ran · our draft was wrong
0ran; the contract check could not run
4ran
1unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 5 of the 14 places are pointer only (Syntology does not serve that copy's text); at 1 of them this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

14 papers shown of 14, newest first; 14 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 3 papers added by Syntology; 2 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
DualOptim+: Bridging Shared and Decoupled Optimizer States for Better Machine Unlearning in Large Language Models added by Syntology 2026-05 (from id) CityU-MLO/DualOptimPlus/utils/utils.py 8076aab5782c4d02 ran · our draft was wrong no licence file found · pointer only
EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL added by Syntology 2026-02 (from id) LunjunZhang/ema-pg/math/rllm/misc.py b7aec73d6258eba0 ran · our draft was wrong MIT (permissive)
BranPO: Scalable Contrastive Branch Sampling for Long-Horizon Agentic Reinforcement Learning added by Syntology 2026-02 (from id) YubaoZhao/BranPO/rllm/misc.py b7aec73d6258eba0 ran · our draft was wrong Apache-2.0 (permissive)
ILLUME+: Illuminating Unified MLLM with Dual Visual Tokenization and Diffusion Refinement 2 Apr 2025 illume-unified-mllm/ILLUME_plus/ILLUME/illume/registry_utils.py 10f7276899092b15 ran Apache-2.0 (permissive)
A Closer Look at Machine Unlearning for Large Language Models 10 Oct 2024 sail-sg/closer-look-LLM-unlearning/utils/utils.py 8076aab5782c4d02 ran · our draft was wrong no licence file found · pointer only
Intrinsic Evaluation of Unlearning Using Parametric Knowledge Traces 17 Jun 2024 yihuaihong/conceptvectors/utils.py 8076aab5782c4d02 ran · our draft was wrong CC-BY-4.0 · pointer only
VoxPoser: Composable 3D Value Maps for Robotic Manipulation with Language Models 12 Jul 2023 huangwl18/voxposer/src/LMP.py d807172220243c93 ran · our draft was wrong MIT (permissive)
Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models 18 Jun 2023 vita-group/instant_soup/clip_assets/code/isp_all.py 3e174a2399a96927 ran · our draft was wrong MIT (permissive)
Clustering units in neural networks: upstream vs downstream information 22 Mar 2022 wrongu/modularity/util.py 028c5c4fc9dd3797 ran MIT (permissive)
Selecting Relevant Features from a Multi-domain Representation for Few-shot Classification 20 Mar 2020 dvornikita/SUR/utils.py 0735728c05cdb798 ran MIT (permissive)
Latent Space Subdivision: Stable and Controllable Time Predictions for Fluid Flow 12 Mar 2020 lij131/LatentSpaceSubdivision-base/keras_models_general.py 7ec35715d22802c5 unverified MIT (permissive)
Neural Ordinary Differential Equations 19 Jun 2018 boschresearch/numerics_independent_neural_odes/models/models.py 5c104e6fea609913 ran · our draft was wrong AGPL-3.0 (copyleft) · pointer only
CVF open access id Szeto_The_DEVIL_Is_in_the_Details_A_Diagnostic_Evaluation_Benchmark_CVPR_2022_paper MichiganCOG/devil/slurm/util.py ca5ad97e30cf1774 ran MIT (permissive)
ACL Anthology id 2025.findings-acl.949 renjie3/GRUN/baseline/utils.py 8076aab5782c4d02 ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections