{"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/args-to-dict","entry":"args_to_dict","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":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"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":0,"ran_fixture":0,"ran":3,"unverified":0},"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":"2507.00846","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.00846","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"RishalAggarwal/BoltzNCE","path":"BoltzNCE/utils/arguments.py","file_url":"https://github.com/RishalAggarwal/BoltzNCE/blob/HEAD/BoltzNCE/utils/arguments.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":"ecdd17b39b0ffced","code_sha256_prefix":"ecdd17b39b0ffced","mcp_get_code":{"code_sha256":"ecdd17b39b0ffced"}},{"arxiv_id":"2407.16125","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-prior-based-amortized-variational","title":"Diffusion Prior-Based Amortized Variational Inference for Noisy Inverse Problems","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/davi","path":"cm/script_util.py","file_url":"https://github.com/mlvlab/davi/blob/HEAD/cm/script_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":"4e2ac192b520c457","code_sha256_prefix":"4e2ac192b520c457","mcp_get_code":{"code_sha256":"4e2ac192b520c457"}},{"arxiv_id":"2402.17733","arxiv_id_is_arxiv":true,"paper":"/paper/tower-an-open-multilingual-large-language","title":"Tower: An Open Multilingual Large Language Model for Translation-Related Tasks","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-spin/tower-eval","path":"tower_eval/utils.py","file_url":"https://github.com/deep-spin/tower-eval/blob/HEAD/tower_eval/utils.py","status":"ran","verification_level":1,"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, deep-spin/tower-eval when it was checked","code_sha256":"37646a69cb702ffb","code_sha256_prefix":"37646a69cb702ffb","mcp_get_code":{"code_sha256":"37646a69cb702ffb"}},{"arxiv_id":"2402.11838","arxiv_id_is_arxiv":true,"paper":"/paper/unist-a-prompt-empowered-universal-model-for","title":"UniST: A Prompt-Empowered Universal Model for Urban Spatio-Temporal Prediction","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/unist","path":"src/utils.py","file_url":"https://github.com/tsinghua-fib-lab/unist/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"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, tsinghua-fib-lab/unist when it was checked","code_sha256":"4e2ac192b520c457","code_sha256_prefix":"4e2ac192b520c457","mcp_get_code":{"code_sha256":"4e2ac192b520c457"}},{"arxiv_id":"2312.02139","arxiv_id_is_arxiv":true,"paper":"/paper/diffit-diffusion-vision-transformers-for","title":"DiffiT: Diffusion Vision Transformers for Image Generation","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvlabs/diffit","path":"diffit/script_util.py","file_url":"https://github.com/nvlabs/diffit/blob/HEAD/diffit/script_util.py","status":"ran","verification_level":1,"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, nvlabs/diffit when it was checked","code_sha256":"4e2ac192b520c457","code_sha256_prefix":"4e2ac192b520c457","mcp_get_code":{"code_sha256":"4e2ac192b520c457"}},{"arxiv_id":"2211.15388","arxiv_id_is_arxiv":true,"paper":"/paper/shifted-diffusion-for-text-to-image","title":"Shifted Diffusion for Text-to-image Generation","date":"2022-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drboog/Shifted_Diffusion","path":"model_lib/diffusion/script_util.py","file_url":"https://github.com/drboog/Shifted_Diffusion/blob/HEAD/model_lib/diffusion/script_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e2ac192b520c457","code_sha256_prefix":"4e2ac192b520c457","mcp_get_code":{"code_sha256":"4e2ac192b520c457"}},{"arxiv_id":"2211.09120","arxiv_id_is_arxiv":true,"paper":"/paper/adamae-adaptive-masking-for-efficient","title":"AdaMAE: Adaptive Masking for Efficient Spatiotemporal Learning with Masked Autoencoders","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nithin-GK/UniteandConquer","path":"class_utils/script_util.py","file_url":"https://github.com/Nithin-GK/UniteandConquer/blob/HEAD/class_utils/script_util.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":"4e2ac192b520c457","code_sha256_prefix":"4e2ac192b520c457","mcp_get_code":{"code_sha256":"4e2ac192b520c457"}},{"arxiv_id":"Liu_DOLCE_A_Model-Based_Probabilistic_Diffusion_Framework_for_Limited-Angle_CT_Reconstruction_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Liu_DOLCE_A_Model-Based_Probabilistic_Diffusion_Framework_for_Limited-Angle_CT_Reconstruction_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wustl-cig/DOLCE","path":"guided_diffusion/script_util.py","file_url":"https://github.com/wustl-cig/DOLCE/blob/HEAD/guided_diffusion/script_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":"4e2ac192b520c457","code_sha256_prefix":"4e2ac192b520c457","mcp_get_code":{"code_sha256":"4e2ac192b520c457"}}],"record_sha256":"7e9a5b260306858b6d56c51bd2d18b2de25907191e0822b3c75d4962b8843b84","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}