{"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/get-entropy","entry":"get_entropy","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":7,"n_papers":7,"n_buckets":2,"n_distinct_outputs":7,"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":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/get-entropy","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":6,"n_papers":6,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"2399fcd7f479a73c","size":1,"n_papers":1,"shape":[],"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],"values_recorded":1,"members":[{"code_sha256_prefix":"cd0eee905c41d0c4","path":"train_yahoo_dataset.py","papers":["1902.04056"],"paper_pages":[{"arxiv_id":"1902.04056","page":"/paper/policy-learning-for-fairness-in-ranking"}],"arg_sig_recorded":[["probs",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"74999fd28ab18ccc","size":1,"n_papers":1,"shape":[],"dtype":"float64","type":"float","finite":false,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[NaN],"values_recorded":1,"members":[{"code_sha256_prefix":"bed3944a2f922019","path":"attribution/mask.py","papers":["2106.05303"],"paper_pages":[{"arxiv_id":"2106.05303","page":"/paper/explaining-time-series-predictions-with"}],"arg_sig_recorded":[["saliency",2,"float","float32"]],"scalar_args":{"ids_time":"[0, 2]","ids_feature":"[1, 3]","normalize":"True","eps":"1e-05"},"class_bearing":false}]},{"output_sha":"7e5824d63f9fbed5","size":1,"n_papers":1,"shape":[],"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.6227258443832397],"values_recorded":1,"members":[{"code_sha256_prefix":"b5e4e66a4c429046","path":"loss.py","papers":["2006.05065"],"paper_pages":[{"arxiv_id":"2006.05065","page":"/paper/self-distillation-as-instance-specific-label"}],"arg_sig_recorded":[["outputs",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"947540360b0cd8d6","size":1,"n_papers":1,"shape":[4],"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,NaN,NaN,NaN],"values_recorded":4,"members":[{"code_sha256_prefix":"a7625322cc9fda06","path":"pouf_lvm/examples/pouf/image_classification/pouf.py","papers":["2305.00350"],"paper_pages":[{"arxiv_id":"2305.00350","page":"/paper/pouf-prompt-oriented-unsupervised-fine-tuning"}],"arg_sig_recorded":[["input_",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"ad823c471dd59eab","size":1,"n_papers":1,"shape":[4],"dtype":"float32","type":"ndarray","finite":false,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[-Infinity,-Infinity,-Infinity,-Infinity],"values_recorded":4,"members":[{"code_sha256_prefix":"410618de180f045a","path":"hypergan_utils.py","papers":["1609.09106"],"paper_pages":[{"arxiv_id":"1609.09106","page":"/paper/hypernetworks"}],"arg_sig_recorded":[["mean",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"e0770880d670f9ad","size":1,"n_papers":1,"shape":[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":[1.4792882204055786,1.4573826789855957,1.822251558303833,1.7319810390472412],"values_recorded":4,"members":[{"code_sha256_prefix":"af280a71e2e6e9f0","path":"dime/cmi_estimator.py","papers":["2306.03301"],"paper_pages":[{"arxiv_id":"2306.03301","page":"/paper/estimating-conditional-mutual-information-for-1"}],"arg_sig_recorded":[["pred",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[2,"int","int64"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"5681d12a7b4528b2","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":[1.844621476365503,1.861986108168706,1.3296613488547582,2.0039308586596594],"values_recorded":4,"members":[{"code_sha256_prefix":"c11ef2293c1894fc","path":"utils/solvers.py","papers":["2212.07473"],"paper_pages":[{"arxiv_id":"2212.07473","page":"/paper/mabsplit-faster-forest-training-using-multi"}],"arg_sig_recorded":[["counts_vec",2,"int","int64"]],"scalar_args":{"ret_var":"False","pop_size":"None","n":"None"},"class_bearing":false}]}]}]}