{"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":"/census/approx-standard-normal-cdf","entry":"approx_standard_normal_cdf","source":"Syntology differential census (groundwork/55, run v2_2026-09-22), per sample; not an archive number","census_date":"2026-09-22","battery_sha256":["b986f7e04d794a0d88ad4c5f32cf63ec3590b5deff0192150737bc5f1c0b4677"],"runner_sha256":["5a452d0e7c0da5b80771d1be2afe3572e253568cf5c5d59a0d08ebd663d00808"],"bucket_key":"positional (rank, kind, dtype) of each array argument; the argument name is not part of the key because the harness draws the shared array from (rank, kind) and casts it to the dtype, whatever the name","bucket_fields":["rank","kind","dtype"],"claim":"Implementations sharing this entry name were each run on one shared input fixed by the positional (rank, kind, dtype) of their array arguments (the bucket). A cluster is the set whose recorded output digest (sha256 of the output rounded to 6 decimals) is identical. Identical values to six decimals on the shared input are agreement on those inputs, not a statement about the whole domain and not a substitution claim.","n_implementations_compared":4,"n_papers":14,"n_buckets":1,"n_distinct_outputs":1,"n_class_bearing":0,"not_compared":{"not_run_on_shared_input":{"n":0,"by_error":{}},"no_array_argument_ran_on_own_fixture_arguments_only":{"n":0,"n_papers":0,"recorded_shared_digest_equals_own_fixture_digest":0},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/approx-standard-normal-cdf","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":4,"n_papers":14,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"f058bd6bd9534d53","size":4,"n_papers":14,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":4,"torch_reference_conventions_with_this_digest":[],"values":[0.9642412662506104,0.06267821788787842,0.6829515695571899,0.24489495158195496,0.18343400955200195,0.1515529453754425,0.2538115382194519,0.7165912389755249,0.6980384588241577,0.8311131000518799,0.3456285893917084,0.058525413274765015,0.3864760398864746,0.9900383353233337,0.30338913202285767,0.7089773416519165,0.5264683961868286,0.05241519212722778,0.6671465039253235,0.3423226475715637,0.49098697304725647,0.11902162432670593,0.29572075605392456,0.8372126817703247,0.2132323980331421,0.6675688624382019,0.8275238871574402,0.8453903794288635,0.11031842231750488,0.898528516292572,0.09322276711463928,0.27627313137054443],"values_recorded":32,"members":[{"code_sha256_prefix":"d6a68e210556f857","path":"MoH-DiT/diffusion/diffusion_utils.py","papers":["2402.03478","2410.11842","2305.13311","2412.05628","2606.18209"],"paper_pages":[{"arxiv_id":"2402.03478","page":"/paper/hyper-diffusion-estimating-epistemic-and"},{"arxiv_id":"2410.11842","page":"/paper/moh-multi-head-attention-as-mixture-of-head"},{"arxiv_id":"2305.13311","page":"/paper/vdt-an-empirical-study-on-video-diffusion"},{"arxiv_id":"2412.05628","page":"/paper/remix-dit-mixing-diffusion-transformers-for"},{"arxiv_id":"2606.18209","page":"/paper/arxiv-2606-18209"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"9deab2a47adbf3b7","path":"DSTPP/DiffusionModel.py","papers":["2006.11239","2305.12403","2404.00491","2601.22816"],"paper_pages":[{"arxiv_id":"2006.11239","page":"/paper/denoising-diffusion-probabilistic-models"},{"arxiv_id":"2305.12403","page":"/paper/spatio-temporal-diffusion-point-processes"},{"arxiv_id":"2404.00491","page":"/paper/denoising-monte-carlo-renders-with-diffusion"},{"arxiv_id":"2601.22816","page":"/paper/arxiv-2601-22816"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"cfd76fd0d89574a4","path":"models/losses.py","papers":["2502.01441","2304.08577","2608.00716","2606.13022"],"paper_pages":[{"arxiv_id":"2502.01441","page":"/paper/improved-training-technique-for-latent"},{"arxiv_id":"2304.08577","page":"/paper/avatars-grow-legs-generating-smooth-human"},{"arxiv_id":"2608.00716","page":"/paper/arxiv-2608-00716"},{"arxiv_id":"2606.13022","page":"/paper/arxiv-2606-13022"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"770545141dcc88e9","path":"improved_diffusion/respace.py","papers":["2010.02502"],"paper_pages":[{"arxiv_id":"2010.02502","page":"/paper/denoising-diffusion-implicit-models-1"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}