{"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/rank","entry":"rank","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":5,"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":1,"n_papers":1,"recorded_shared_digest_equals_own_fixture_digest":1},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/rank","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":2,"n_papers":3,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"c23b89931ac398d4","size":1,"n_papers":2,"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":[0.0,7.0,2.0,4.0,5.0,6.0,3.0,1.0,3.0,1.0,5.0,7.0,4.0,0.0,6.0,2.0,2.0,7.0,1.0,4.0,3.0,6.0,5.0,0.0,5.0,3.0,2.0,1.0,6.0,0.0,7.0,4.0],"values_recorded":32,"members":[{"code_sha256_prefix":"2e1e2e8c543195f7","path":"agedb-dir/ranksim.py","papers":["2205.15236","2410.22124"],"paper_pages":[{"arxiv_id":"2205.15236","page":"/paper/ranksim-ranking-similarity-regularization-for"},{"arxiv_id":"2410.22124","page":"/paper/rankup-boosting-semi-supervised-regression"}],"arg_sig_recorded":[["seq",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"d45b02bfbe40e2e8","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,8.0,3.0,5.0,6.0,7.0,4.0,2.0,4.0,2.0,6.0,8.0,5.0,1.0,7.0,3.0,3.0,8.0,2.0,5.0,4.0,7.0,6.0,1.0,6.0,4.0,3.0,2.0,7.0,1.0,8.0,5.0],"values_recorded":32,"members":[{"code_sha256_prefix":"85bac81fb967d1ed","path":"happier/losses/hap_loss.py","papers":["2207.04873"],"paper_pages":[{"arxiv_id":"2207.04873","page":"/paper/hierarchical-average-precision-training-for"}],"arg_sig_recorded":[["tens",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[1,"float","float64"]],"n_implementations_compared":1,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"88e400efebb2e85e","size":1,"n_papers":2,"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":[4.1342511751008555],"values_recorded":1,"members":[{"code_sha256_prefix":"eb3b2353d3baa939","path":"rootCP/rootcp/rootCP.py","papers":["2307.05109","2104.06648"],"paper_pages":[{"arxiv_id":"2307.05109","page":"/paper/conformalization-of-sparse-generalized-linear"},{"arxiv_id":"2104.06648","page":"/paper/root-finding-approaches-for-computing"}],"arg_sig_recorded":[["u",1,"float","float64"]],"scalar_args":{"gamma":"0.5"},"class_bearing":false}]}]}]}