{"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/b2mb","entry":"b2mb","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":12,"n_papers_ran":12,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":9,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"2605.15491","paper":"/paper/arxiv-2605-15491","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Nota-NetsPresso/shortened-llm","path":"src/gen_batch_eval_vram.py","file_url":"https://github.com/Nota-NetsPresso/shortened-llm/blob/HEAD/src/gen_batch_eval_vram.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2412.06785","paper":"/paper/tactile-dreamfusion-exploiting-tactile","title":"Tactile DreamFusion: Exploiting Tactile Sensing for 3D Generation","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruihangao/tactiledreamfusion","path":"TextureDreambooth/train_dreambooth.py","file_url":"https://github.com/ruihangao/tactiledreamfusion/blob/HEAD/TextureDreambooth/train_dreambooth.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2411.16775","paper":"/paper/parameter-efficient-instruction-tuning-an","title":"Parameter Efficient Instruction Tuning: An Empirical Study","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2411.04358","paper":"/paper/robust-and-efficient-fine-tuning-of-llms-with","title":"Robust and Efficient Fine-tuning of LLMs with Bayesian Reparameterization of Low-Rank Adaptation","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2408.16500","paper":"/paper/cogvlm2-visual-language-models-for-image-and","title":"CogVLM2: Visual Language Models for Image and Video Understanding","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/cogvlm2","path":"finetune_demo/peft_lora.py","file_url":"https://github.com/thudm/cogvlm2/blob/HEAD/finetune_demo/peft_lora.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2408.15300","paper":"/paper/gift-sw-gaussian-noise-injected-fine-tuning","title":"GIFT-SW: Gaussian noise Injected Fine-Tuning of Salient Weights for LLMs","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2406.09413","paper":"/paper/interpreting-the-weight-space-of-customized","title":"Interpreting the Weight Space of Customized Diffusion Models","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-research/weights2weights","path":"train_dreambooth.py","file_url":"https://github.com/snap-research/weights2weights/blob/HEAD/train_dreambooth.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2403.09450","paper":"/paper/shake-to-leak-fine-tuning-diffusion-models","title":"Shake to Leak: Fine-tuning Diffusion Models Can Amplify the Generative Privacy Risk","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2403.08370","paper":"/paper/smart-submodular-data-mixture-strategy-for","title":"SMART: Submodular Data Mixture Strategy for Instruction Tuning","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2402.02834","paper":"/paper/shortened-llama-a-simple-depth-pruning-for","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nota-netspresso/shortened-llm","path":"src/gen_batch_eval_vram.py","file_url":"https://github.com/nota-netspresso/shortened-llm/blob/HEAD/src/gen_batch_eval_vram.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2401.16405","paper":"/paper/scaling-sparse-fine-tuning-to-large-language","title":"Scaling Sparse Fine-Tuning to Large Language Models","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}},{"arxiv_id":"2303.18223","paper":"/paper/a-survey-of-large-language-models","title":"A Survey of Large Language Models","date":"2023-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/peft","path":"examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py","file_url":"https://github.com/huggingface/peft/blob/HEAD/examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"32380a050ca033d4","mcp_get_code":{"code_sha256":"32380a050ca033d4"}}]}