{"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-model-dir","entry":"get_model_dir","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":12,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":12,"n_places_pointer_only":6,"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":3,"ran_fixture":0,"ran":4,"unverified":2},"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":"2502.16282","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-the-emergence-of-multimodal","title":"Understanding the Emergence of Multimodal Representation Alignment","date":"2025-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megantj/multimodal_alignment","path":"scripts/evaluate_multiseed.py","file_url":"https://github.com/megantj/multimodal_alignment/blob/HEAD/scripts/evaluate_multiseed.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, megantj/multimodal_alignment when it was checked","code_sha256":"254e2c8b9a3bbb86","code_sha256_prefix":"254e2c8b9a3bbb86","mcp_get_code":{"code_sha256":"254e2c8b9a3bbb86"}},{"arxiv_id":"2406.13144","arxiv_id_is_arxiv":true,"paper":"/paper/dialsim-a-real-time-simulator-for-evaluating","title":"DialSim: A Real-Time Simulator for Evaluating Long-Term Multi-Party Dialogue Understanding of Conversational Agents","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiho283/simulator","path":"models/load_opensource_model.py","file_url":"https://github.com/jiho283/simulator/blob/HEAD/models/load_opensource_model.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, jiho283/simulator when it was checked","code_sha256":"1550680a576f475f","code_sha256_prefix":"1550680a576f475f","mcp_get_code":{"code_sha256":"1550680a576f475f"}},{"arxiv_id":"2406.02066","arxiv_id_is_arxiv":true,"paper":"/paper/preference-optimization-for-molecule","title":"Preference Optimization for Molecule Synthesis with Conditional Residual Energy-based Models","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songtaoliu0823/crebm","path":"GraphRetro/scripts/benchmarks/run_model.py","file_url":"https://github.com/songtaoliu0823/crebm/blob/HEAD/GraphRetro/scripts/benchmarks/run_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6ffa7d3b10e36bff","code_sha256_prefix":"6ffa7d3b10e36bff","mcp_get_code":{"code_sha256":"6ffa7d3b10e36bff"}},{"arxiv_id":"2306.00323","arxiv_id_is_arxiv":true,"paper":"/paper/thought-cloning-learning-to-think-while-1","title":"Thought Cloning: Learning to Think while Acting by Imitating Human Thinking","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShengranHu/Thought-Cloning","path":"babyai/utils/model.py","file_url":"https://github.com/ShengranHu/Thought-Cloning/blob/HEAD/babyai/utils/model.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":"2cbc87bf930aff09","code_sha256_prefix":"2cbc87bf930aff09","mcp_get_code":{"code_sha256":"2cbc87bf930aff09"}},{"arxiv_id":"2106.02797","arxiv_id_is_arxiv":true,"paper":"/paper/neural-distributed-source-coding","title":"Neural Distributed Source Coding","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acnagle/neural-dsc","path":"run_discus.py","file_url":"https://github.com/acnagle/neural-dsc/blob/HEAD/run_discus.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":"fd3c45d3ebd7603b","code_sha256_prefix":"fd3c45d3ebd7603b","mcp_get_code":{"code_sha256":"fd3c45d3ebd7603b"}},{"arxiv_id":"2007.12770","arxiv_id_is_arxiv":true,"paper":"/paper/babyai-1-1","title":"BabyAI 1.1","date":"2020-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mila-udem/babyai","path":"babyai/utils/model.py","file_url":"https://github.com/mila-udem/babyai/blob/HEAD/babyai/utils/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"45eb1b6abf367f37","code_sha256_prefix":"45eb1b6abf367f37","mcp_get_code":{"code_sha256":"45eb1b6abf367f37"}},{"arxiv_id":"2006.07038","arxiv_id_is_arxiv":true,"paper":"/paper/learning-graph-models-for-template-free","title":"Learning Graph Models for Retrosynthesis Prediction","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"6ffa7d3b10e36bff","code_sha256_prefix":"6ffa7d3b10e36bff","mcp_get_code":{"code_sha256":"6ffa7d3b10e36bff"}},{"arxiv_id":"2003.11963","arxiv_id_is_arxiv":true,"paper":"/paper/tldr-token-loss-dynamic-reweighting-for","title":"TLDR: Token Loss Dynamic Reweighting for Reducing Repetitive Utterance Generation","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShaojieJiang/tldr","path":"parlai/core/build_data.py","file_url":"https://github.com/ShaojieJiang/tldr/blob/HEAD/parlai/core/build_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ShaojieJiang/tldr, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"019aeff4cb65bf1a","code_sha256_prefix":"019aeff4cb65bf1a","mcp_get_code":{"code_sha256":"019aeff4cb65bf1a"}},{"arxiv_id":"1906.02341","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-initialize-your-network-robust","title":"How to Initialize your Network? Robust Initialization for WeightNorm & ResNets","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"victorcampos7/weightnorm-init","path":"src/util/misc.py","file_url":"https://github.com/victorcampos7/weightnorm-init/blob/HEAD/src/util/misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, victorcampos7/weightnorm-init, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"ac5e4caf2614e958","code_sha256_prefix":"ac5e4caf2614e958","mcp_get_code":{"code_sha256":"ac5e4caf2614e958"}},{"arxiv_id":"1906.01603","arxiv_id_is_arxiv":true,"paper":"/paper/do-neural-dialog-systems-use-the-conversation","title":"Do Neural Dialog Systems Use the Conversation History Effectively? An Empirical Study","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chinnadhurai/ParlAI","path":"parlai/core/build_data.py","file_url":"https://github.com/chinnadhurai/ParlAI/blob/HEAD/parlai/core/build_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, chinnadhurai/ParlAI, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"019aeff4cb65bf1a","code_sha256_prefix":"019aeff4cb65bf1a","mcp_get_code":{"code_sha256":"019aeff4cb65bf1a"}},{"arxiv_id":"1810.08272","arxiv_id_is_arxiv":true,"paper":"/paper/babyai-first-steps-towards-grounded-language","title":"BabyAI: A Platform to Study the Sample Efficiency of Grounded Language Learning","date":"2018-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MathijsMul/babyai-emergent-guidance","path":"babyai/utils/model.py","file_url":"https://github.com/MathijsMul/babyai-emergent-guidance/blob/HEAD/babyai/utils/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"45eb1b6abf367f37","code_sha256_prefix":"45eb1b6abf367f37","mcp_get_code":{"code_sha256":"45eb1b6abf367f37"}},{"arxiv_id":"aaai_20764","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20764","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Giseung-Park/BlockSeq","path":"code_on_policy_minigrid/utils/storage.py","file_url":"https://github.com/Giseung-Park/BlockSeq/blob/HEAD/code_on_policy_minigrid/utils/storage.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c010a9d40b9931b","code_sha256_prefix":"5c010a9d40b9931b","mcp_get_code":{"code_sha256":"5c010a9d40b9931b"}}],"record_sha256":"bec63009e0546fa68916c397ce515b78317a60a221f8be68a037c64dc119e811","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}