{"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/get-lambda","entry":"get_lambda","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":8,"n_papers_ran":7,"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":7,"n_samples_ran":6,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":1},"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":"2606.26757","paper":"/paper/arxiv-2606-26757","title":"Explainable Insect Authentication","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"majharB/bisn","path":"src/grl.py","file_url":"https://github.com/majharB/bisn/blob/HEAD/src/grl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f05c8f31e82aa0c","mcp_get_code":{"code_sha256":"4f05c8f31e82aa0c"}},{"arxiv_id":"2606.18209","paper":"/paper/arxiv-2606-18209","title":"Rethinking Dataset Distillation for Classification: Do Distilled Sets Outperform Coresets?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Jiacheng8/FADRM","path":"models/util.py","file_url":"https://github.com/Jiacheng8/FADRM/blob/HEAD/models/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ba1399ac9cd62aa7","mcp_get_code":{"code_sha256":"ba1399ac9cd62aa7"}},{"arxiv_id":"2506.24125","paper":"/paper/fadrm-fast-and-accurate-data-residual","title":"FADRM: Fast and Accurate Data Residual Matching for Dataset Distillation","date":"2025-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/fadrm","path":"models/util.py","file_url":"https://github.com/jiacheng8/fadrm/blob/HEAD/models/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ba1399ac9cd62aa7","mcp_get_code":{"code_sha256":"ba1399ac9cd62aa7"}},{"arxiv_id":"2410.01723","paper":"/paper/harmonica-harmonizing-training-and-inference","title":"HarmoniCa: Harmonizing Training and Inference for Better Feature Caching in Diffusion Transformer Acceleration","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"modeltc/harmonica","path":"train_router.py","file_url":"https://github.com/modeltc/harmonica/blob/HEAD/train_router.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"495f938cb55dd81f","mcp_get_code":{"code_sha256":"495f938cb55dd81f"}},{"arxiv_id":"2406.10914","paper":"/paper/first-order-manifold-data-augmentation-for","title":"First-Order Manifold Data Augmentation for Regression Learning","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azencot-group/foma","path":"src/foma.py","file_url":"https://github.com/azencot-group/foma/blob/HEAD/src/foma.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b028feaa536c72d9","mcp_get_code":{"code_sha256":"b028feaa536c72d9"}},{"arxiv_id":"2402.14992","paper":"/paper/tinybenchmarks-evaluating-llms-with-fewer","title":"tinyBenchmarks: evaluating LLMs with fewer examples","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felipemaiapolo/efficbench","path":"utils.py","file_url":"https://github.com/felipemaiapolo/efficbench/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c030bb619c641f8c","mcp_get_code":{"code_sha256":"c030bb619c641f8c"}},{"arxiv_id":"2402.07341","paper":"/paper/noise-adaptive-confidence-sets-for-linear","title":"Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jungtaekkim/LOSAN-LOFAV","path":"losan_lofav/utils_regression.py","file_url":"https://github.com/jungtaekkim/LOSAN-LOFAV/blob/HEAD/losan_lofav/utils_regression.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"63057e612b635486","mcp_get_code":{"code_sha256":"63057e612b635486"}},{"arxiv_id":"2006.07794","paper":"/paper/patchup-a-regularization-technique-for","title":"PatchUp: A Feature-Space Block-Level Regularization Technique for Convolutional Neural Networks","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/PatchUp","path":"modules/mixup.py","file_url":"https://github.com/chandar-lab/PatchUp/blob/HEAD/modules/mixup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c24f9f03625f499d","mcp_get_code":{"code_sha256":"c24f9f03625f499d"}}]}