{"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/min-max-norm","entry":"min_max_norm","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":3,"n_papers":6,"n_buckets":2,"n_distinct_outputs":3,"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/min-max-norm","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":2,"n_papers":4,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"771dbde58a2f354c","size":1,"n_papers":3,"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":[0.8683187961578369,0.022585459053516388,0.5320500135421753,0.23624643683433533,0.18251682817935944,0.15016646683216095,0.24337603151798248,0.556596577167511,0.5429049134254456,0.6545073390007019,0.3106922507286072,0.013821955770254135,0.3382371962070465,1.0,0.280886173248291,0.5509284734725952,0.42820724844932556,0.0,0.5209112763404846,0.3084143102169037,0.4056496024131775,0.11206460744142532,0.2752881348133087,0.6607249975204468,0.20969988405704498,0.5212060809135437,0.6509159803390503,0.6693039536476135,0.10065688192844391,0.7343738675117493,0.07621163129806519,0.2607783079147339],"values_recorded":32,"members":[{"code_sha256_prefix":"af0b22bd9efac86b","path":"model.py","papers":["2306.00006","2402.11887","2603.01806"],"paper_pages":[{"arxiv_id":"2306.00006","page":"/paper/truncated-affinity-maximization-one-class-1"},{"arxiv_id":"2402.11887","page":"/paper/generative-semi-supervised-graph-anomaly"},{"arxiv_id":"2603.01806","page":"/paper/arxiv-2603-01806"}],"arg_sig_recorded":[["feature",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"39b6e3abf587af88","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.6023938059806824,0.2526339888572693,0.18910378217697144,0.1508525162935257,0.2610640525817871,0.6314178705215454,0.5364984273910522,0.6496650576591492,0.30103111267089844,0.0,0.32896214723587036,1.0,0.27080732583999634,0.5446344017982483,0.6480869650840759,0.0,0.7883935570716858,0.46678170561790466,0.6139461994171143,0.16960854828357697,0.4166455566883087,1.0,0.20281966030597687,0.6761166453361511,0.873195469379425,0.9011340141296387,0.03714168071746826,1.0,0.0,0.28042736649513245],"values_recorded":32,"members":[{"code_sha256_prefix":"0da0f4c833bc9bdc","path":"Muesli_lunar_rgb.py","papers":["2104.06159"],"paper_pages":[{"arxiv_id":"2104.06159","page":"/paper/muesli-combining-improvements-in-policy"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[4,"float","float32"]],"n_implementations_compared":1,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"da5316ede1b7f5e0","size":1,"n_papers":2,"shape":[2,3,4,4],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.8241692781448364,0.8071389198303223,1.0,0.9154760241508484,0.9249014854431152,0.599685788154602,0.582282304763794,0.8506478667259216,0.7318128943443298,0.6161125302314758,0.35876235365867615,0.6452165246009827,0.4758601188659668,0.5422229766845703,0.0,0.84602290391922,0.4612300992012024,0.6264590620994568,0.7599151134490967,0.17256924510002136,0.3835552930831909,0.9194416999816895,0.4770748019218445,1.0,0.6544846296310425,0.9289388656616211,0.0,0.5423246622085571,0.697487473487854,0.5917267203330994,0.8462927937507629,0.4483746886253357,0.30559253692626953,0.7220777869224548,0.28759896755218506,0.28707998991012573,0.23613029718399048,1.0,0.4886918067932129,0.07954425364732742,0.36605051159858704,0.0,0.21281935274600983,0.778903603553772,0.4338517189025879,0.379972368478775,0.5233509540557861,0.06728821247816086,0.7815985679626465,0.6680203676223755,1.0,0.5670610666275024,0.908665120601654,0.4433901906013489,0.07915066927671432,0.5271287560462952,0.28770387172698975,0.1612086445093155,0.29143863916397095,0.5655008554458618,0.0,0.4201076626777649,0.4412737786769867,0.6143565773963928,0.4611976444721222,0.0,0.4441109895706177,0.7592031359672546,0.37552204728126526,0.2652742266654968,1.0,0.2775503098964691,0.40445899963378906,0.32774946093559265,0.38295719027519226,0.10037709772586823,0.5204769372940063,0.3236609697341919,0.41784268617630005,0.3165309727191925,0.0,0.508262574672699,0.5686296224594116,0.3289432227611542,0.7002323269844055,0.8228339552879333,0.1659948080778122,0.7864319086074829,0.5836605429649353,0.633980929851532,1.0,0.2501918077468872,0.6479029059410095,0.5644413232803345,0.2026718556880951,0.4609646201133728],"values_recorded":96,"members":[{"code_sha256_prefix":"f11714f9833718d2","path":"model/HolisticAttention.py","papers":["2106.13389","2207.04655"],"paper_pages":[{"arxiv_id":"2106.13389","page":"/paper/energy-based-generative-cooperative-saliency"},{"arxiv_id":"2207.04655","page":"/paper/personalizing-federated-medical-image"}],"arg_sig_recorded":[["in_",4,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}