{"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/compress","entry":"compress","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":1,"n_papers":5,"n_buckets":1,"n_distinct_outputs":1,"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/compress","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":1,"n_papers":5,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"9392b85eaba90b4a","size":1,"n_papers":5,"shape":[4],"dtype":"int64","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.0,1.0,2.0,3.0],"values_recorded":4,"members":[{"code_sha256_prefix":"9a913678c56785e8","path":"goodpoints/compress.py","papers":["2111.07941","2404.12290","2105.05842","2110.01593","2301.05974"],"paper_pages":[{"arxiv_id":"2111.07941","page":"/paper/distribution-compression-in-near-linear-time-1"},{"arxiv_id":"2404.12290","page":"/paper/debiased-distribution-compression"},{"arxiv_id":"2105.05842","page":"/paper/kernel-thinning"},{"arxiv_id":"2110.01593","page":"/paper/generalized-kernel-thinning"},{"arxiv_id":"2301.05974","page":"/paper/compress-then-test-powerful-kernel-testing-in"}],"arg_sig_recorded":[["X",2,"float","float32"]],"scalar_args":{"halve":"<function halve at 0xffff6d66c180>","g":"1","indices":"None"},"class_bearing":false}]}]}]}