{"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/f","entry":"f","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":17,"n_papers":15,"n_buckets":7,"n_distinct_outputs":17,"n_class_bearing":0,"not_compared":{"not_run_on_shared_input":{"n":4,"by_error":{"ValueError":3,"RuntimeError":1}},"no_array_argument_ran_on_own_fixture_arguments_only":{"n":2,"n_papers":2,"recorded_shared_digest_equals_own_fixture_digest":2},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/f","buckets":[{"bucket":[[1,"float","float64"],[1,"float","float64"]],"n_implementations_compared":3,"n_papers":3,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"6223a00f04771f54","size":1,"n_papers":1,"shape":[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.7409877437530008,0.35273480153688846,1.2697897622485403,1.6415668113332391,1.0762288449771853,0.6313731470108813,2.1484951295853705,1.0781149032419988],"values_recorded":8,"members":[{"code_sha256_prefix":"7e299e6776b649a1","path":"V-PBGD/toy/toy.py","papers":["2302.05185"],"paper_pages":[{"arxiv_id":"2302.05185","page":"/paper/on-penalty-based-bilevel-gradient-descent"}],"arg_sig_recorded":[["x",1,"float","float64"],["y",1,"float","float64"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"d8253e2acf3d3195","size":1,"n_papers":1,"shape":[1],"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.098079878583313],"values_recorded":1,"members":[{"code_sha256_prefix":"3e6c34b5d19d69a2","path":"autolrs_server.py","papers":["2105.10762"],"paper_pages":[{"arxiv_id":"2105.10762","page":"/paper/autolrs-automatic-learning-rate-schedule-by-1"}],"arg_sig_recorded":[["x",1,"float","float64"],["y",1,"float","float64"]],"scalar_args":{"b":"0.5"},"class_bearing":false}]},{"output_sha":"dc7fc7a423d0f923","size":1,"n_papers":1,"shape":[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":[7.183519710493251,4.56914764843566,1.9982175776220927,6.874627271821228,5.261716399842133,4.6106272099106915,8.472179075916056,5.266043682351411],"values_recorded":8,"members":[{"code_sha256_prefix":"075afe4d626a2df1","path":"contour_plot.py","papers":["1904.03537"],"paper_pages":[{"arxiv_id":"1904.03537","page":"/paper/convex-concave-backtracking-for-inertial"}],"arg_sig_recorded":[["x",1,"float","float64"],["y",1,"float","float64"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[1,"float","float64"]],"n_implementations_compared":3,"n_papers":3,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"0eea27186dfb9c44","size":1,"n_papers":1,"shape":[],"dtype":"float64","type":"float64","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.364865361795361],"values_recorded":1,"members":[{"code_sha256_prefix":"6a51d68741d2ae12","path":"aix360/algorithms/ecertify/ExpCertifyBB.py","papers":["2402.11168"],"paper_pages":[{"arxiv_id":"2402.11168","page":"/paper/trust-regions-for-explanations-via-black-box"}],"arg_sig_recorded":[["x",1,"float","float64"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"8bdee69ca0d07932","size":1,"n_papers":1,"shape":[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":[0.289068978156229,0.5392269281873444,0.7112642253291006,0.3187507223571437,0.4560808960879184,0.5132576362830893,0.1666959568017836,0.4557643921210188],"values_recorded":8,"members":[{"code_sha256_prefix":"9dc92202a028ac23","path":"regression_with_GP.py","papers":["1506.02142"],"paper_pages":[{"arxiv_id":"1506.02142","page":"/paper/dropout-as-a-bayesian-approximation"}],"arg_sig_recorded":[["x",1,"float","float64"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"c9e4554d6cfc8114","size":1,"n_papers":1,"shape":[],"dtype":"float64","type":"float64","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[-18.540538552818557],"values_recorded":1,"members":[{"code_sha256_prefix":"ed1fb9f8c95071f8","path":"bellman.py","papers":["2205.14327"],"paper_pages":[{"arxiv_id":"2205.14327","page":"/paper/efficient-policy-iteration-for-robust-markov"}],"arg_sig_recorded":[["V",1,"float","float64"]],"scalar_args":{"x":"2.0","p":"2"},"class_bearing":false}]}]},{"bucket":[[2,"float","float32"]],"n_implementations_compared":3,"n_papers":3,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"54b900409e7377cb","size":1,"n_papers":1,"shape":[4],"dtype":"float32","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[6.059452056884766,5.243280410766602,3.9274637699127197,6.341322422027588],"values_recorded":4,"members":[{"code_sha256_prefix":"c2cbec6be13031a9","path":"demo/base.py","papers":["2205.00293"],"paper_pages":[{"arxiv_id":"2205.00293","page":"/paper/ttopt-a-maximum-volume-quantized-tensor-train"}],"arg_sig_recorded":[["X",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"a4f377964998e1b2","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.9552338123321533,0.19533608853816986,0.959238588809967,0.4062190651893616,0.3403310477733612,0.30515754222869873,0.41569679975509644,1.0200680494308472,0.9858682751655579,1.2835599184036255,0.5141400098800659,0.1892881691455841,0.5592502951622009,2.4156596660614014,0.4685210585594177,1.005827784538269,0.726895809173584,0.18009445071220398,0.9323635697364807,0.5105373859405518,0.6819138526916504,0.26776382327079773,0.4603169560432434,1.301352858543396,0.3724628686904907,0.9330689311027527,1.2733372449874878,1.3260986804962158,0.25737258791923523,1.5208042860031128,0.23629067838191986,0.4395793080329895],"values_recorded":32,"members":[{"code_sha256_prefix":"c69509c702f9ebb9","path":"models/operator/mask.py","papers":["2204.02738"],"paper_pages":[{"arxiv_id":"2204.02738","page":"/paper/masking-adversarial-damage-finding"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"name":"'softplus'"},"class_bearing":false}]},{"output_sha":"d358bbc89d2b6026","size":1,"n_papers":1,"shape":[4,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":[1.0,0.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0,0.0,0.0,0.0,0.0,1.0,0.0,1.0,1.0,1.0,0.0,1.0,0.0,0.0],"values_recorded":32,"members":[{"code_sha256_prefix":"54383f7845419e7a","path":"bidirectional_proof.py","papers":["1805.08006"],"paper_pages":[{"arxiv_id":"1805.08006","page":"/paper/bidirectional-learning-for-robust-neural"}],"arg_sig_recorded":[["v",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[2,"float","float64"]],"n_implementations_compared":3,"n_papers":3,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"83783416a6e4fa80","size":1,"n_papers":1,"shape":[4],"dtype":"float64","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[8.975660817330812,11.520033794921634,8.784967339824608,10.192558772952946],"values_recorded":4,"members":[{"code_sha256_prefix":"a4bc03655d50e577","path":"federated_shap.py","papers":["1905.04519"],"paper_pages":[{"arxiv_id":"1905.04519","page":"/paper/interpret-federated-learning-with-shapley"}],"arg_sig_recorded":[["X",2,"float","float64"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"d7bd5ceec8a69dcd","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.802628679592353,-1.5337762569179567,0.47605322923618437,-0.6908870620289821,-0.9028494964356759,-1.0304712253028872,-0.6627609239992189,0.572889220601701,0.5188759529457332,0.9591456414705227,-0.3971995733466898,-1.568348179202036,-0.2885350906311486,2.3221088606181515,-0.5147839769988166,0.5505285791931418,0.06639544283095257,-1.6228755249801277,0.4321114229703758,-0.40618587814690116,-0.022594224204796665,-1.1807823902688124,-0.5368682495213898,0.983674188609945,-0.7956127851079772,0.4332744095449241,0.9449777773193271,1.01751825335816,-1.2257857707553415,1.2742179092187245,-1.3222218927282292,-0.5941090922688514],"values_recorded":32,"members":[{"code_sha256_prefix":"554977c240abe619","path":"pyscf_ipu/dft.py","papers":["2311.01135"],"paper_pages":[{"arxiv_id":"2311.01135","page":"/paper/generating-qm1b-with-pyscf-text-ipu-1"}],"arg_sig_recorded":[["x",2,"float","float64"]],"scalar_args":{"float32":"False"},"class_bearing":false}]},{"output_sha":"d7fdf4321519da71","size":1,"n_papers":1,"shape":[4],"dtype":"float64","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[4.4751768165863375,4.925101223470184,2.8202202763468187,3.9882355982122673],"values_recorded":4,"members":[{"code_sha256_prefix":"4ecee13626733e8e","path":"mcmc_gaussian_nonisotropic_d_exps.py","papers":["1905.12247"],"paper_pages":[{"arxiv_id":"1905.12247","page":"/paper/fast-mixing-of-metropolized-hamiltonian-monte"}],"arg_sig_recorded":[["x",2,"float","float64"]],"scalar_args":{"mean":"0.0","sigma":"1.0"},"class_bearing":false}]}]},{"bucket":[[1,"float","float32"]],"n_implementations_compared":2,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"5dca9a6d311b1942","size":1,"n_papers":1,"shape":[8],"dtype":"float32","type":"Tensor","finite":false,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[NaN,0.7348673343658447,0.4112776219844818,NaN,NaN,0.1247270405292511,NaN,NaN],"values_recorded":8,"members":[{"code_sha256_prefix":"ffb5940236d57cb1","path":"Proxy-Uncertainty-Training-LLaMa-Factory/src/llmtuner/tuner/rm/trainer.py","papers":["2405.06424"],"paper_pages":[{"arxiv_id":"2405.06424","page":"/paper/improving-instruction-following-in-language"}],"arg_sig_recorded":[["x",1,"float","float32"]],"scalar_args":{"m":"0.0","s":"1.0","a":"1e-05","b":"0.99999","n":"10000"},"class_bearing":false}]},{"output_sha":"ea500555d9ee59d1","size":1,"n_papers":1,"shape":[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":[0.0,-0.5909940004348755,-0.7546027302742004,0.0,0.6465510725975037,-0.29225683212280273,-0.0,0.6380946040153503],"values_recorded":8,"members":[{"code_sha256_prefix":"dc7eaed619c6bc0d","path":"example.py","papers":["1511.02222"],"paper_pages":[{"arxiv_id":"1511.02222","page":"/paper/deep-kernel-learning"}],"arg_sig_recorded":[["x",1,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[2,"float","float32"],[2,"float","float32"]],"n_implementations_compared":2,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"29b0e89bd1454ec7","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":[-12.967727661132812,-15.909712791442871,-0.4777604043483734,-4.345517635345459,-6.756797790527344,-8.405888557434082,-4.059558391571045,-0.9116279482841492,-0.6563402414321899,-3.6309242248535156,-1.7941550016403198,-16.458799362182617,-1.1071138381958008,-18.235509872436523,-2.6974937915802,-0.8019225001335144,0.1045851856470108,-17.326990127563477,-0.31684112548828125,-1.8573999404907227,-0.04845554009079933,-10.507176399230957,-2.8851630687713623,-3.8508758544921875,-5.482148170471191,-0.3208056390285492,-3.5061681270599365,-4.162387371063232,-11.16483211517334,-6.788333892822266,-12.610795974731445,-3.397364377975464],"values_recorded":32,"members":[{"code_sha256_prefix":"cf69a4ee90924580","path":"styblinski_tang.py","papers":["2505.14670"],"paper_pages":[{"arxiv_id":"2505.14670","page":"/paper/quantum-optimization-via-gradient-based"}],"arg_sig_recorded":[["X",2,"float","float32"],["Y",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"95173d4a923395b2","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":[0.6599409580230713,0.3458820879459381,0.0032099783420562744,0.014239940792322159,0.041528042405843735,0.07047311216592789,0.012058896943926811,0.006732286419719458,0.004530375357717276,0.0528954453766346,0.0015556614380329847,0.3781376779079437,0.0004331861564423889,1.8172314167022705,0.004389146808534861,0.0057411580346524715,1.2145992513978854e-06,0.4335317611694336,0.0021790286991745234,0.0017012935131788254,1.6288076665205153e-08,0.121495321393013,0.005192194599658251,0.05851740762591362,0.02504304237663746,0.0022025825455784798,0.04983866214752197,0.0669960007071495,0.14110365509986877,0.16476118564605713,0.1910281479358673,0.0077865468338131905],"values_recorded":32,"members":[{"code_sha256_prefix":"79551e8e8ab3e337","path":"convex_optim.py","papers":["2505.14670"],"paper_pages":[{"arxiv_id":"2505.14670","page":"/paper/quantum-optimization-via-gradient-based"}],"arg_sig_recorded":[["X",2,"float","float32"],["Y",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[2,"float","float64"],[2,"float","float64"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"7ca814d45b89364a","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":[-0.12025609220067536,0.9476347368597435,-6.528228836302398e-18,2.1090467771593843e-11,6.364158451272574e-07,7.250320738376783e-05,4.050091901405405e-12,-1.1781145013743038e-14,-2.152646000107664e-16,-5.80441842855078e-06,4.082008195385704e-21,1.0006874881827075,8.622582453710453e-27,-0.5907605465394629,1.5618281280631162e-16,-2.3629385812458567e-15,-6.094547721306698e-53,0.8952039356383585,-1.2675443458434544e-19,1.0170339709168676e-20,3.903557333608144e-72,0.005733670743765954,8.556908072937986e-16,-1.4309172717592564e-05,5.286589734399675e-09,-1.4142527894940256e-19,-3.3900982717846144e-06,-4.686411264376237e-05,0.016607397920100582,-0.04593592286134047,0.11028324192717946,5.093808067354421e-14],"values_recorded":32,"members":[{"code_sha256_prefix":"7e5517769dd75a5c","path":"nonconvex_optim.py","papers":["2505.14670"],"paper_pages":[{"arxiv_id":"2505.14670","page":"/paper/quantum-optimization-via-gradient-based"}],"arg_sig_recorded":[["X",2,"float","float64"],["Y",2,"float","float64"]],"scalar_args":{},"class_bearing":false}]}]}]}