{"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/find-latest-checkpoint","entry":"find_latest_checkpoint","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":10,"n_papers_ran":5,"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":11,"n_samples_ran":6,"n_samples_fingerprinted":5,"n_places":11,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":3,"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":"2607.17060","paper":"/paper/arxiv-2607-17060","title":"What does a Bayes-filtered transformer believe? A predictive Monte Carlo approach","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"afiq-aswadi/bft-pmc","path":"analysis/checkpoints.py","file_url":"https://github.com/afiq-aswadi/bft-pmc/blob/HEAD/analysis/checkpoints.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f57d9f09cdca659","mcp_get_code":{"code_sha256":"6f57d9f09cdca659"}},{"arxiv_id":"2606.12733","paper":"/paper/arxiv-2606-12733","title":"Let's Ask Gauss: Improved One-Run Privacy Auditing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"stoneboat/dpsgd-auditbench","path":"src/utils.py","file_url":"https://github.com/stoneboat/dpsgd-auditbench/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"904a9f6a042ad180","mcp_get_code":{"code_sha256":"904a9f6a042ad180"}},{"arxiv_id":"2512.11784","paper":"/paper/arxiv-2512-11784","title":"Softmax as Linear Attention in the Large-Prompt Regime: a Measure-based Perspective","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"eboursier/softmax_as_linear","path":"utils/data_utils.py","file_url":"https://github.com/eboursier/softmax_as_linear/blob/HEAD/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d5a7e5d3fda38361","mcp_get_code":{"code_sha256":"d5a7e5d3fda38361"}},{"arxiv_id":"2510.00523","paper":"/paper/arxiv-2510-00523","title":"VIRTUE: Visual-Interactive Text-Image Universal Embedder","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"sony/virtue","path":"codes/src/utils.py","file_url":"https://github.com/sony/virtue/blob/HEAD/codes/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":"2ee2dcbdf5dce10a","mcp_get_code":{"code_sha256":"2ee2dcbdf5dce10a"}},{"arxiv_id":"2406.01561","paper":"/paper/long-and-short-guidance-in-score-identity","title":"Long and Short Guidance in Score identity Distillation for One-Step Text-to-Image Generation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyuanzhou/sid-lsg","path":"sid_train.py","file_url":"https://github.com/mingyuanzhou/sid-lsg/blob/HEAD/sid_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0021e29612552771","mcp_get_code":{"code_sha256":"0021e29612552771"}},{"arxiv_id":"2310.06389","paper":"/paper/learning-stackable-and-skippable-lego-bricks","title":"Learning Stackable and Skippable LEGO Bricks for Efficient, Reconfigurable, and Variable-Resolution Diffusion Modeling","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JegZheng/LEGODiffusion","path":"generate.py","file_url":"https://github.com/JegZheng/LEGODiffusion/blob/HEAD/generate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"54145599584b3b04","mcp_get_code":{"code_sha256":"54145599584b3b04"}},{"arxiv_id":"2206.06340","paper":"/paper/snes-learning-probably-symmetric-neural","title":"SNeS: Learning Probably Symmetric Neural Surfaces from Incomplete Data","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eldar/snes","path":"exp_runner.py","file_url":"https://github.com/eldar/snes/blob/HEAD/exp_runner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"67cbda99e73243e0","mcp_get_code":{"code_sha256":"67cbda99e73243e0"}},{"arxiv_id":"1912.00594","paper":"/paper/combining-mixmatch-and-active-learning-for-1","title":"Combining MixMatch and Active Learning for Better Accuracy with Fewer Labels","date":"2019-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/mma","path":"libml/utils.py","file_url":"https://github.com/google-research/mma/blob/HEAD/libml/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":"f2880ff3aa20a21d","mcp_get_code":{"code_sha256":"f2880ff3aa20a21d"}},{"arxiv_id":"1505.04597","paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divamgupta/image-segmentation-keras","path":"keras_segmentation/models/unet.py","file_url":"https://github.com/divamgupta/image-segmentation-keras/blob/HEAD/keras_segmentation/models/unet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"83c00452992f6c60","mcp_get_code":{"code_sha256":"83c00452992f6c60"}},{"arxiv_id":"1505.04597","paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Maveric4/pr19aaw01","path":"SRC/keras_segmentation/models/unet.py","file_url":"https://github.com/Maveric4/pr19aaw01/blob/HEAD/SRC/keras_segmentation/models/unet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a6240c825bf1db0c","mcp_get_code":{"code_sha256":"a6240c825bf1db0c"}},{"arxiv_id":"openreview_g9G7qyAzki","paper":null,"title":"arXiv:openreview_g9G7qyAzki","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"The-Inscrutable-X/CalibratedModelAgnosticCorrectness","path":"tuning_models/utils/training_utils.py","file_url":"https://github.com/The-Inscrutable-X/CalibratedModelAgnosticCorrectness/blob/HEAD/tuning_models/utils/training_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":"5c0d6eca71e25b83","mcp_get_code":{"code_sha256":"5c0d6eca71e25b83"}}]}