{"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/find-latest-checkpoint","entry":"find_latest_checkpoint","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":6,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":7,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":11,"n_places_pointer_only":3,"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":7,"ran_fixture":0,"ran":3,"unverified":1},"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":"2607.17060","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f57d9f09cdca659","code_sha256_prefix":"6f57d9f09cdca659","mcp_get_code":{"code_sha256":"6f57d9f09cdca659"}},{"arxiv_id":"2606.12733","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, stoneboat/dpsgd-auditbench when it was checked","code_sha256":"904a9f6a042ad180","code_sha256_prefix":"904a9f6a042ad180","mcp_get_code":{"code_sha256":"904a9f6a042ad180"}},{"arxiv_id":"2512.11784","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, eboursier/softmax_as_linear when it was checked","code_sha256":"d5a7e5d3fda38361","code_sha256_prefix":"d5a7e5d3fda38361","mcp_get_code":{"code_sha256":"d5a7e5d3fda38361"}},{"arxiv_id":"2510.00523","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ee2dcbdf5dce10a","code_sha256_prefix":"2ee2dcbdf5dce10a","mcp_get_code":{"code_sha256":"2ee2dcbdf5dce10a"}},{"arxiv_id":"2406.01561","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0021e29612552771","code_sha256_prefix":"0021e29612552771","mcp_get_code":{"code_sha256":"0021e29612552771"}},{"arxiv_id":"2310.06389","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54145599584b3b04","code_sha256_prefix":"54145599584b3b04","mcp_get_code":{"code_sha256":"54145599584b3b04"}},{"arxiv_id":"2206.06340","arxiv_id_is_arxiv":true,"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":"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":"67cbda99e73243e0","code_sha256_prefix":"67cbda99e73243e0","mcp_get_code":{"code_sha256":"67cbda99e73243e0"}},{"arxiv_id":"1912.00594","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f2880ff3aa20a21d","code_sha256_prefix":"f2880ff3aa20a21d","mcp_get_code":{"code_sha256":"f2880ff3aa20a21d"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"83c00452992f6c60","code_sha256_prefix":"83c00452992f6c60","mcp_get_code":{"code_sha256":"83c00452992f6c60"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Maveric4/pr19aaw01 when it was checked","code_sha256":"a6240c825bf1db0c","code_sha256_prefix":"a6240c825bf1db0c","mcp_get_code":{"code_sha256":"a6240c825bf1db0c"}},{"arxiv_id":"openreview_g9G7qyAzki","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id 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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c0d6eca71e25b83","code_sha256_prefix":"5c0d6eca71e25b83","mcp_get_code":{"code_sha256":"5c0d6eca71e25b83"}}],"record_sha256":"6fcfc4e855f9ba035ff32a8e5bf5eb500660afa143ff194b30643c12b1b67551","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}