{"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/log-prob","entry":"log_prob","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":9,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":9,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":2,"unverified":3},"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":"2605.11711","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11711","title":"Debiased Model-based Representations for Sample-efficient Continuous Control","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"nothingbutbut/FoG","path":"jaxrl/agents/obac/obac_learner.py","file_url":"https://github.com/nothingbutbut/FoG/blob/HEAD/jaxrl/agents/obac/obac_learner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nothingbutbut/FoG when it was checked","code_sha256":"273220d61679b547","code_sha256_prefix":"273220d61679b547","mcp_get_code":{"code_sha256":"273220d61679b547"}},{"arxiv_id":"2605.03802","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-03802","title":"Towards accurate extreme event likelihoods from diffusion model climate emulators","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"NVlabs/cBottle","path":"src/cbottle/likelihood.py","file_url":"https://github.com/NVlabs/cBottle/blob/HEAD/src/cbottle/likelihood.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":"6068a3aa8e8b2883","code_sha256_prefix":"6068a3aa8e8b2883","mcp_get_code":{"code_sha256":"6068a3aa8e8b2883"}},{"arxiv_id":"2502.07154","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-fine-tuning-when-scaling-test-time","title":"Rethinking Fine-Tuning when Scaling Test-Time Compute: Limiting Confidence Improves Mathematical Reasoning","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allanraventos/refine","path":"refine/training/NCO.py","file_url":"https://github.com/allanraventos/refine/blob/HEAD/refine/training/NCO.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":"b6819f7fc99f31be","code_sha256_prefix":"b6819f7fc99f31be","mcp_get_code":{"code_sha256":"b6819f7fc99f31be"}},{"arxiv_id":"2410.02942","arxiv_id_is_arxiv":true,"paper":"/paper/symmetricdiffusers-learning-discrete","title":"SymmetricDiffusers: Learning Discrete Diffusion on Finite Symmetric Groups","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsl-lab/symmetricdiffusers","path":"diffusion.py","file_url":"https://github.com/dsl-lab/symmetricdiffusers/blob/HEAD/diffusion.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dsl-lab/symmetricdiffusers when it was checked","code_sha256":"b0dff81faf5d2126","code_sha256_prefix":"b0dff81faf5d2126","mcp_get_code":{"code_sha256":"b0dff81faf5d2126"}},{"arxiv_id":"2408.01584","arxiv_id_is_arxiv":true,"paper":"/paper/2408-01584","title":"GPUDrive: Data-driven, multi-agent driving simulation at 1 million FPS","date":"2024-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Emerge-Lab/gpudrive","path":"gpudrive/networks/late_fusion.py","file_url":"https://github.com/Emerge-Lab/gpudrive/blob/HEAD/gpudrive/networks/late_fusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54928c52a27bfaa2","code_sha256_prefix":"54928c52a27bfaa2","mcp_get_code":{"code_sha256":"54928c52a27bfaa2"}},{"arxiv_id":"2307.01050","arxiv_id_is_arxiv":true,"paper":"/paper/transport-variational-inference-and","title":"Transport meets Variational Inference: Controlled Monte Carlo Diffusions","date":"2023-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shreyaspadhy/cmcd","path":"src/mcd_cais_var.py","file_url":"https://github.com/shreyaspadhy/cmcd/blob/HEAD/src/mcd_cais_var.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd633cefc4aea1fe","code_sha256_prefix":"dd633cefc4aea1fe","mcp_get_code":{"code_sha256":"dd633cefc4aea1fe"}},{"arxiv_id":"2205.02309","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-and-semantically-organised","title":"Towards Robust and Semantically Organised Latent Representations for Unsupervised Text Style Transfer","date":"2022-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sharan21/EPAAE","path":"model.py","file_url":"https://github.com/sharan21/EPAAE/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, sharan21/EPAAE when it was checked","code_sha256":"4ebc241db4d9569d","code_sha256_prefix":"4ebc241db4d9569d","mcp_get_code":{"code_sha256":"4ebc241db4d9569d"}},{"arxiv_id":"2106.08630","arxiv_id_is_arxiv":true,"paper":"/paper/help-hardware-adaptive-efficient-latency","title":"HELP: Hardware-Adaptive Efficient Latency Prediction for NAS via Meta-Learning","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HayeonLee/HELP","path":"utils.py","file_url":"https://github.com/HayeonLee/HELP/blob/HEAD/utils.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":"9b55ec99f8807af5","code_sha256_prefix":"9b55ec99f8807af5","mcp_get_code":{"code_sha256":"9b55ec99f8807af5"}},{"arxiv_id":"1907.03382","arxiv_id_is_arxiv":true,"paper":"/paper/etalumis-bringing-probabilistic-programming","title":"Etalumis: Bringing Probabilistic Programming to Scientific Simulators at Scale","date":"2019-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"probprog/pyprob","path":"pyprob/diagnostics.py","file_url":"https://github.com/probprog/pyprob/blob/HEAD/pyprob/diagnostics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"45a8cf83a7db0d79","code_sha256_prefix":"45a8cf83a7db0d79","mcp_get_code":{"code_sha256":"45a8cf83a7db0d79"}}],"record_sha256":"040a5f7106d11b84cf964f255f07678c5c52fd872a17d4f58b5c3eb377cfe938","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}