{"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/add-noise","entry":"add_noise","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":9,"n_papers":9,"n_buckets":3,"n_distinct_outputs":8,"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/add-noise","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":7,"n_papers":7,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"bf13ebefde930547","size":2,"n_papers":2,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":2,"torch_reference_conventions_with_this_digest":[],"values":[1.690044641494751,-1.6490123271942139,0.45099538564682007,-0.7342749238014221,-0.8179784417152405,-0.961270272731781,-0.6943621635437012,0.36136722564697266,0.5511034727096558,0.8328121900558472,-0.3622012436389923,-1.5375348329544067,-0.27655094861984253,2.4458744525909424,-0.4031062722206116,0.5258008241653442,-0.0688699409365654,-1.7924686670303345,0.48877647519111633,-0.326835036277771,0.03728972375392914,-1.3362919092178345,-0.571004331111908,1.168974757194519,-0.7205938696861267,0.37472471594810486,0.927638053894043,1.0358660221099854,-1.0868490934371948,1.4328514337539673,-1.2275919914245605,-0.6784768104553223],"values_recorded":32,"members":[{"code_sha256_prefix":"67139037acec0547","path":"PriorMetaLearning/Get_Objective_MPB.py","papers":["2402.04054"],"paper_pages":[{"arxiv_id":"2402.04054","page":"/paper/more-flexible-pac-bayesian-meta-learning-by"}],"arg_sig_recorded":[["param",2,"float","float32"]],"scalar_args":{"std":"0.1"},"class_bearing":false},{"code_sha256_prefix":"bc31f0e26e8ea404","path":"engine/fair_training.py","papers":["2210.10837"],"paper_pages":[{"arxiv_id":"2210.10837","page":"/paper/on-learning-fairness-and-accuracy-on-multiple"}],"arg_sig_recorded":[["param",2,"float","float32"]],"scalar_args":{"std":"0.1"},"class_bearing":false}]},{"output_sha":"3fb8df8321a970ba","size":1,"n_papers":1,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0,0.0,0.45099538564682007,0.0,0.0,0.0,0.0,0.36136722564697266,0.5511034727096558,0.8328121900558472,0.0,0.0,0.0,1.0,0.0,0.5258008241653442,0.0,0.0,0.48877647519111633,0.0,0.03728972375392914,0.0,0.0,1.0,0.0,0.37472471594810486,0.927638053894043,1.0,0.0,1.0,0.0,0.0],"values_recorded":32,"members":[{"code_sha256_prefix":"24610ea98446fa84","path":"classifier.py","papers":["2003.10596"],"paper_pages":[{"arxiv_id":"2003.10596","page":"/paper/adversarial-perturbations-fool-deepfake"}],"arg_sig_recorded":[["input",2,"float","float32"]],"scalar_args":{"noise_type":"'Gaussian'","noise1":"0.0","noise2":"0.1"},"class_bearing":false}]},{"output_sha":"4bdfd4681ff523a5","size":1,"n_papers":1,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.4658095836639404,-1.8785295486450195,0.40108728408813477,-0.8206911683082581,-0.6489396095275879,-0.8234418034553528,-0.7573028802871704,-0.05992406606674194,0.6200220584869385,0.5626477003097534,-0.28735724091529846,-1.4716402292251587,-0.2509227991104126,2.710548162460327,-0.16428309679031372,0.47292041778564453,-0.25485458970069885,-2.0256526470184326,0.5666887164115906,-0.21773070096969604,0.11962781846523285,-1.5501115322113037,-0.6179400086402893,1.4237558841705322,-0.5837394595146179,0.2679145336151123,0.8960058689117432,1.069337248802185,-0.8333919048309326,1.7222408056259155,-1.054962158203125,-0.832385778427124],"values_recorded":32,"members":[{"code_sha256_prefix":"e9968c45a27f2cad","path":"incdsi.py","papers":["2307.10323"],"paper_pages":[{"arxiv_id":"2307.10323","page":"/paper/incdsi-incrementally-updatable-document"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"scale":"0.1"},"class_bearing":false}]},{"output_sha":"6bab50e8b549cc6c","size":1,"n_papers":1,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.7975255250930786,-1.5247840881347656,0.47453927993774414,-0.68767249584198,-0.8981218934059143,-1.0239691734313965,-0.6582575440406799,0.5741530656814575,0.5186288952827454,0.9578689336776733,-0.3942851424217224,-1.5606526136398315,-0.2873207926750183,2.3136978149414062,-0.5116251111030579,0.5504035949707031,0.06886135041713715,-1.6134111881256104,0.43105247616767883,-0.40349656343460083,-0.019843431189656258,-1.1725950241088867,-0.5332199931144714,0.983246386051178,-0.7908666729927063,0.4337417483329773,0.9450080990791321,1.013684868812561,-1.2202738523483276,1.270699143409729,-1.3158650398254395,-0.5881476998329163],"values_recorded":32,"members":[{"code_sha256_prefix":"e75fa796ef0547d0","path":"ImageExperiments.py","papers":["2006.02548"],"paper_pages":[{"arxiv_id":"2006.02548","page":"/paper/graphical-normalizing-flows"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"e3210b56611f79b5","size":1,"n_papers":1,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0,0.0,0.4697887599468231,0.0,0.0,0.0,0.0,0.5200087428092957,0.5269328355789185,0.9275622963905334,0.0,0.0,0.0,1.0,0.0,0.5443466305732727,0.03257909417152405,0.0,0.4462776780128479,0.0,0.0,0.0,0.0,1.0,0.0,0.4186369776725769,0.9406428337097168,1.0,0.0,1.0,0.0,0.0],"values_recorded":32,"members":[{"code_sha256_prefix":"1c093f080000251b","path":"scripts/stage1.py","papers":["2307.12872"],"paper_pages":[{"arxiv_id":"2307.12872","page":"/paper/data-free-black-box-attack-based-on-diffusion"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"stddev":"0.025"},"class_bearing":false}]},{"output_sha":"e935c4041800a4ae","size":1,"n_papers":1,"shape":[4,8],"dtype":"float32","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.9790338277816772,-1.493760585784912,0.5739270448684692,-0.46679770946502686,-0.7160937190055847,-1.1281989812850952,-0.5677520632743835,0.5577535033226013,0.5085541009902954,1.0002055168151855,-0.38279521465301514,-1.422920823097229,-0.21243131160736084,2.3342761993408203,-0.4703976511955261,0.5838960409164429,0.2158033400774002,-1.6433913707733154,0.463418185710907,-0.49159544706344604,-0.27789321541786194,-1.1154205799102783,-0.4504246413707733,0.9094576835632324,-0.5686373710632324,0.2878378629684448,0.9495536088943481,0.9987999200820923,-1.0725078582763672,1.4211537837982178,-1.3067271709442139,-0.5562928915023804],"values_recorded":32,"members":[{"code_sha256_prefix":"7dac7a0f0d615414","path":"cryosim/add_ctf.py","papers":["2408.05526"],"paper_pages":[{"arxiv_id":"2408.05526","page":"/paper/cryobench-diverse-and-challenging-datasets"}],"arg_sig_recorded":[["particles",2,"float","float32"]],"scalar_args":{"D":"4","sigma":"0.1"},"class_bearing":false}]}]},{"bucket":[[1,"int","int64"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"98fd5c0e71ee7ead","size":1,"n_papers":1,"shape":[8],"dtype":"int64","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[2.0,1.0,0.0,2.0,2.0,2.0,1.0,2.0],"values_recorded":8,"members":[{"code_sha256_prefix":"07cde14d81af8f3d","path":"train_calibration_maxent.py","papers":["2310.17159"],"paper_pages":[{"arxiv_id":"2310.17159","page":"/paper/maxent-loss-constrained-maximum-entropy-for"}],"arg_sig_recorded":[["array",1,"int","int64"]],"scalar_args":{"noise_ratio":"0.5","num_classes":"3"},"class_bearing":false}]}]},{"bucket":[[2,"float","float64"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"4b76090c99564345","size":1,"n_papers":1,"shape":[4,8],"dtype":"float64","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.9790339141891193,-1.4937605360812345,0.5739270276467583,-0.4667977421088363,-0.7160936974206792,-1.1281990132905282,-0.56775208224666,0.5577534997719312,0.5085540677663773,1.00020549166436,-0.38279521623060203,-1.4229208285057384,-0.21243131811644927,2.3342763622674343,-0.47039765372427406,0.5838960119305685,0.2158033501467132,-1.6433913513567078,0.46341819313546595,-0.49159545207707367,-0.27789320578820453,-1.1154205307247764,-0.4504246296354392,0.9094576865693008,-0.5686373227092164,0.2878378420850476,0.9495536290494717,0.9987998683555765,-1.0725078493194957,1.4211537862087529,-1.3067271501585376,-0.5562928403086341],"values_recorded":32,"members":[{"code_sha256_prefix":"2e6b4551cf702be8","path":"create_data.py","papers":["2003.10775"],"paper_pages":[{"arxiv_id":"2003.10775","page":"/paper/generative-ode-modeling-with-known-unknowns"}],"arg_sig_recorded":[["data",2,"float","float64"]],"scalar_args":{"args":"