{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/lcm","entry":"lcm","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"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":"2407.18242","paper":"/paper/lora-pro-are-low-rank-adapters-properly","title":"LoRA-Pro: Are Low-Rank Adapters Properly Optimized?","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrflogs/LoRA-Pro","path":"DeepSpeed-0.15.1/deepspeed/runtime/zero/stage_1_and_2.py","file_url":"https://github.com/mrflogs/LoRA-Pro/blob/HEAD/DeepSpeed-0.15.1/deepspeed/runtime/zero/stage_1_and_2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"29e02b1391f2ac78","mcp_get_code":{"code_sha256":"29e02b1391f2ac78"}},{"arxiv_id":"2307.03190","paper":"/paper/synthesizing-artistic-cinemagraphs-from-text","title":"Text-Guided Synthesis of Eulerian Cinemagraphs","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"text2cinemagraph/text2cinemagraph","path":"train_motion.py","file_url":"https://github.com/text2cinemagraph/text2cinemagraph/blob/HEAD/train_motion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"81e8721e2bf7575c","mcp_get_code":{"code_sha256":"81e8721e2bf7575c"}},{"arxiv_id":"2301.13379","paper":"/paper/faithful-chain-of-thought-reasoning","title":"Faithful Chain-of-Thought Reasoning","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"veronica320/faithful-cot","path":"source/scratch.py","file_url":"https://github.com/veronica320/faithful-cot/blob/HEAD/source/scratch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2410baeb6a8ae747","mcp_get_code":{"code_sha256":"2410baeb6a8ae747"}},{"arxiv_id":"2209.10280","paper":"/paper/periodic-extrapolative-generalisation-in","title":"Periodic Extrapolative Generalisation in Neural Networks","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pbelcak/perkit","path":"benchmark/forms.py","file_url":"https://github.com/pbelcak/perkit/blob/HEAD/benchmark/forms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cc785748f8d51e7c","mcp_get_code":{"code_sha256":"cc785748f8d51e7c"}},{"arxiv_id":"2106.12672","paper":"/paper/charformer-fast-character-transformers-via","title":"Charformer: Fast Character Transformers via Gradient-based Subword Tokenization","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/charformer-pytorch","path":"charformer_pytorch/charformer_pytorch.py","file_url":"https://github.com/lucidrains/charformer-pytorch/blob/HEAD/charformer_pytorch/charformer_pytorch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f9701376e781647","mcp_get_code":{"code_sha256":"9f9701376e781647"}},{"arxiv_id":"2001.04555","paper":"/paper/optimal-approximate-sampling-from-discrete","title":"Optimal Approximate Sampling from Discrete Probability Distributions","date":null,"month_inferred_from_arxiv_id":"2020-01","title_source":"archive","repo":"probcomp/optimal-approximate-sampling","path":"src/utils.py","file_url":"https://github.com/probcomp/optimal-approximate-sampling/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9a61b5ea009c49ab","mcp_get_code":{"code_sha256":"9a61b5ea009c49ab"}}]}