{"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/round-pass","entry":"round_pass","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":9,"n_buckets":2,"n_distinct_outputs":2,"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/round-pass","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":2,"n_papers":7,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"2ae5fe50a75bc28f","size":2,"n_papers":7,"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":[2.0,-2.0,0.0,-1.0,-1.0,-1.0,-1.0,1.0,1.0,1.0,0.0,-2.0,0.0,2.0,-1.0,1.0,0.0,-2.0,0.0,0.0,0.0,-1.0,-1.0,1.0,-1.0,0.0,1.0,1.0,-1.0,1.0,-1.0,-1.0],"values_recorded":32,"members":[{"code_sha256_prefix":"ed1a69e092272dba","path":"LSQ.py","papers":["1902.08153","2004.09576","2203.08368","2302.02210","2406.03470"],"paper_pages":[{"arxiv_id":"1902.08153","page":"/paper/learned-step-size-quantization"},{"arxiv_id":"2004.09576","page":"/paper/lsq-improving-low-bit-quantization-through"},{"arxiv_id":"2203.08368","page":"/paper/mixed-precision-neural-network-quantization"},{"arxiv_id":"2302.02210","page":"/paper/oscillation-free-quantization-for-low-bit"},{"arxiv_id":"2406.03470","page":"/paper/spikezip-tf-conversion-is-all-you-need-for"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"40027e5e78ca8837","path":"lsq.py","papers":["2501.13492","1902.08153","2407.20708"],"paper_pages":[{"arxiv_id":"2501.13492","page":"/paper/quantized-spike-driven-transformer"},{"arxiv_id":"1902.08153","page":"/paper/learned-step-size-quantization"},{"arxiv_id":"2407.20708","page":"/paper/integer-valued-training-and-spike-driven"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[1,"float","float32"]],"n_implementations_compared":1,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"c2a2b5a99c54d614","size":1,"n_papers":2,"shape":[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.00019999999494757503,0.00019999999494757503,0.00019999999494757503,0.00019999999494757503,0.00019999999494757503,0.00019999999494757503,0.00019999999494757503,0.00019999999494757503],"values_recorded":8,"members":[{"code_sha256_prefix":"5111a3243a80feb0","path":"2_step2_rebnn/rebnn.py","papers":["2003.03488","2103.12369"],"paper_pages":[{"arxiv_id":"2003.03488","page":"/paper/reactnet-towards-precise-binary-neural"},{"arxiv_id":"2103.12369","page":"/paper/recu-reviving-the-dead-weights-in-binary"}],"arg_sig_recorded":[["p",1,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}