{"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/stack-dicts","entry":"stack_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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":7,"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":4,"ran_fixture":0,"ran":2,"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":"2501.06911","arxiv_id_is_arxiv":true,"paper":"/paper/risk-averse-finetuning-of-large-language","title":"Risk-Averse Finetuning of Large Language Models","date":"2025-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sapanachaudhary/ra-rlhf","path":"trl/core.py","file_url":"https://github.com/sapanachaudhary/ra-rlhf/blob/HEAD/trl/core.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":"7dc16cc69c54c94d","code_sha256_prefix":"7dc16cc69c54c94d","mcp_get_code":{"code_sha256":"7dc16cc69c54c94d"}},{"arxiv_id":"2410.17637","arxiv_id_is_arxiv":true,"paper":"/paper/mia-dpo-multi-image-augmented-direct","title":"MIA-DPO: Multi-Image Augmented Direct Preference Optimization For Large Vision-Language Models","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuziyu77/mia-dpo","path":"LLaVA-Hound-DPO/llava_hound_dpo/trl/core.py","file_url":"https://github.com/liuziyu77/mia-dpo/blob/HEAD/LLaVA-Hound-DPO/llava_hound_dpo/trl/core.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":"085e70e0bd6e492d","code_sha256_prefix":"085e70e0bd6e492d","mcp_get_code":{"code_sha256":"085e70e0bd6e492d"}},{"arxiv_id":"2410.16198","arxiv_id_is_arxiv":true,"paper":"/paper/improve-vision-language-model-chain-of","title":"Improve Vision Language Model Chain-of-thought Reasoning","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"riflezhang/llava-hound-dpo","path":"llava_hound_dpo/trl/core.py","file_url":"https://github.com/riflezhang/llava-hound-dpo/blob/HEAD/llava_hound_dpo/trl/core.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, riflezhang/llava-hound-dpo when it was checked","code_sha256":"085e70e0bd6e492d","code_sha256_prefix":"085e70e0bd6e492d","mcp_get_code":{"code_sha256":"085e70e0bd6e492d"}},{"arxiv_id":"2406.11280","arxiv_id_is_arxiv":true,"paper":"/paper/i-srt-aligning-large-multimodal-models-for","title":"ISR-DPO: Aligning Large Multimodal Models for Videos by Iterative Self-Retrospective DPO","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snumprlab/SRT","path":"trl/core.py","file_url":"https://github.com/snumprlab/SRT/blob/HEAD/trl/core.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, snumprlab/SRT when it was checked","code_sha256":"085e70e0bd6e492d","code_sha256_prefix":"085e70e0bd6e492d","mcp_get_code":{"code_sha256":"085e70e0bd6e492d"}},{"arxiv_id":"2403.06754","arxiv_id_is_arxiv":true,"paper":"/paper/alarm-align-language-models-via-hierarchical","title":"ALaRM: Align Language Models via Hierarchical Rewards Modeling","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"halfrot/ALaRM","path":"trl/trl/core.py","file_url":"https://github.com/halfrot/ALaRM/blob/HEAD/trl/trl/core.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":"7dc16cc69c54c94d","code_sha256_prefix":"7dc16cc69c54c94d","mcp_get_code":{"code_sha256":"7dc16cc69c54c94d"}},{"arxiv_id":"2402.11078","arxiv_id_is_arxiv":true,"paper":"/paper/model-editing-by-pure-fine-tuning","title":"Model Editing by Standard Fine-Tuning","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"au-revoir/model-editing-ft","path":"trl/core.py","file_url":"https://github.com/au-revoir/model-editing-ft/blob/HEAD/trl/core.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, au-revoir/model-editing-ft when it was checked","code_sha256":"7dc16cc69c54c94d","code_sha256_prefix":"7dc16cc69c54c94d","mcp_get_code":{"code_sha256":"7dc16cc69c54c94d"}},{"arxiv_id":"2311.09312","arxiv_id_is_arxiv":true,"paper":"/paper/h-packer-holographic-rotationally-equivariant","title":"H-Packer: Holographic Rotationally Equivariant Convolutional Neural Network for Protein Side-Chain Packing","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gvisani/hpacker","path":"hpacker/hpacker.py","file_url":"https://github.com/gvisani/hpacker/blob/HEAD/hpacker/hpacker.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":"6f83fa1a9fd166e8","code_sha256_prefix":"6f83fa1a9fd166e8","mcp_get_code":{"code_sha256":"6f83fa1a9fd166e8"}},{"arxiv_id":"2310.14503","arxiv_id_is_arxiv":true,"paper":"/paper/diversify-question-generation-with-retrieval","title":"Diversify Question Generation with Retrieval-Augmented Style Transfer","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gouqi666/RAST","path":"rag/core.py","file_url":"https://github.com/gouqi666/RAST/blob/HEAD/rag/core.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, gouqi666/RAST when it was checked","code_sha256":"c421e6f0c295b7fb","code_sha256_prefix":"c421e6f0c295b7fb","mcp_get_code":{"code_sha256":"c421e6f0c295b7fb"}},{"arxiv_id":"2309.12253","arxiv_id_is_arxiv":true,"paper":"/paper/salsa-clrs-a-sparse-and-scalable-benchmark","title":"SALSA-CLRS: A Sparse and Scalable Benchmark for Algorithmic Reasoning","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkminder/salsa-clrs","path":"baselines/core/utils.py","file_url":"https://github.com/jkminder/salsa-clrs/blob/HEAD/baselines/core/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":"1e034dd26fd03851","code_sha256_prefix":"1e034dd26fd03851","mcp_get_code":{"code_sha256":"1e034dd26fd03851"}},{"arxiv_id":"2206.00761","arxiv_id_is_arxiv":true,"paper":"/paper/on-reinforcement-learning-and-distribution","title":"On Reinforcement Learning and Distribution Matching for Fine-Tuning Language Models with no Catastrophic Forgetting","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver/gdc","path":"cdpg/cdpg/core.py","file_url":"https://github.com/naver/gdc/blob/HEAD/cdpg/cdpg/core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, naver/gdc (NOASSERTION)","code_sha256":"c421e6f0c295b7fb","code_sha256_prefix":"c421e6f0c295b7fb","mcp_get_code":{"code_sha256":"c421e6f0c295b7fb"}},{"arxiv_id":"2012.11635","arxiv_id_is_arxiv":true,"paper":"/paper/2012-11635","title":"A Distributional Approach to Controlled Text Generation","date":"2020-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver/gdc","path":"dpg/gdc/gdc/core.py","file_url":"https://github.com/naver/gdc/blob/HEAD/dpg/gdc/gdc/core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, naver/gdc (NOASSERTION)","code_sha256":"0757e25958eb0a41","code_sha256_prefix":"0757e25958eb0a41","mcp_get_code":{"code_sha256":"0757e25958eb0a41"}},{"arxiv_id":"2012.11635","arxiv_id_is_arxiv":true,"paper":"/paper/2012-11635","title":"A Distributional Approach to Controlled Text Generation","date":"2020-12-21","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":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":"c421e6f0c295b7fb","code_sha256_prefix":"c421e6f0c295b7fb","mcp_get_code":{"code_sha256":"c421e6f0c295b7fb"}}],"record_sha256":"d0d50294522060af8a5ee08328825fd169c27ea42088b8cc6209d55d103290ef","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}