{"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/rand-log-normal","entry":"rand_log_normal","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":3,"ran_fixture":0,"ran":0,"unverified":0},"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":"2412.12953","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-diffusion-transformer-policies-with","title":"Efficient Diffusion Transformer Policies with Mixture of Expert Denoisers for Multitask Learning","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intuitive-robots/MoDE_Diffusion_Policy","path":"mode/models/edm_diffusion/utils.py","file_url":"https://github.com/intuitive-robots/MoDE_Diffusion_Policy/blob/HEAD/mode/models/edm_diffusion/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from tianyucodings/cdiff, and GitHub detected no licence in that repository when it was checked","code_sha256":"ec8364ee198f15b3","code_sha256_prefix":"ec8364ee198f15b3","mcp_get_code":{"code_sha256":"ec8364ee198f15b3"}},{"arxiv_id":"2410.19105","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-diffusions-for-neural-posterior","title":"Conditional diffusions for amortized neural posterior estimation","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyucodings/cdiff","path":"models/diffusion.py","file_url":"https://github.com/tianyucodings/cdiff/blob/HEAD/models/diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tianyucodings/cdiff when it was checked","code_sha256":"ec8364ee198f15b3","code_sha256_prefix":"ec8364ee198f15b3","mcp_get_code":{"code_sha256":"ec8364ee198f15b3"}},{"arxiv_id":"2405.19690","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-policies-creating-a-trust-region","title":"Diffusion Policies creating a Trust Region for Offline Reinforcement Learning","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TianyuCodings/Diffusion_Trusted_Q_Learning","path":"diffusion/utils.py","file_url":"https://github.com/TianyuCodings/Diffusion_Trusted_Q_Learning/blob/HEAD/diffusion/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TianyuCodings/Diffusion_Trusted_Q_Learning when it was checked","code_sha256":"ec8364ee198f15b3","code_sha256_prefix":"ec8364ee198f15b3","mcp_get_code":{"code_sha256":"ec8364ee198f15b3"}},{"arxiv_id":"2402.01566","arxiv_id_is_arxiv":true,"paper":"/paper/boximator-generating-rich-and-controllable","title":"Boximator: Generating Rich and Controllable Motions for Video Synthesis","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"fface7ec62e39a3b","code_sha256_prefix":"fface7ec62e39a3b","mcp_get_code":{"code_sha256":"fface7ec62e39a3b"}},{"arxiv_id":"2402.00769","arxiv_id_is_arxiv":true,"paper":"/paper/animatelcm-accelerating-the-animation-of","title":"AnimateLCM: Computation-Efficient Personalized Style Video Generation without Personalized Video Data","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"g-u-n/animatelcm","path":"animatelcm_svd/train_svd_lcm.py","file_url":"https://github.com/g-u-n/animatelcm/blob/HEAD/animatelcm_svd/train_svd_lcm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from pixeli99/svd_xtend, and GitHub detected no licence in that repository when it was checked","code_sha256":"fface7ec62e39a3b","code_sha256_prefix":"fface7ec62e39a3b","mcp_get_code":{"code_sha256":"fface7ec62e39a3b"}},{"arxiv_id":"2312.00651","arxiv_id_is_arxiv":true,"paper":"/paper/trackdiffusion-multi-object-tracking-data","title":"TrackDiffusion: Tracklet-Conditioned Video Generation via Diffusion Models","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pixeli99/svd_xtend","path":"train_svd.py","file_url":"https://github.com/pixeli99/svd_xtend/blob/HEAD/train_svd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pixeli99/svd_xtend when it was checked","code_sha256":"fface7ec62e39a3b","code_sha256_prefix":"fface7ec62e39a3b","mcp_get_code":{"code_sha256":"fface7ec62e39a3b"}},{"arxiv_id":"2309.16948","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-bridge-models","title":"Denoising Diffusion Bridge Models","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"galaxygliese/Latent-DDBM","path":"train_full_resolution.py","file_url":"https://github.com/galaxygliese/Latent-DDBM/blob/HEAD/train_full_resolution.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4be6c31da10c3331","code_sha256_prefix":"4be6c31da10c3331","mcp_get_code":{"code_sha256":"4be6c31da10c3331"}}],"record_sha256":"f4fbf31fcad582524e2357d79d4b0f612fab9965dac4296bc3069214fd730668","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}