{"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/sample-mask","entry":"sample_mask","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":4,"n_papers":5,"n_buckets":1,"n_distinct_outputs":4,"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":6,"recorded_shared_digest_equals_own_fixture_digest":1},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/sample-mask","buckets":[{"bucket":[[1,"int","int64"]],"n_implementations_compared":4,"n_papers":5,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"b2fe8c0415c63489","size":1,"n_papers":2,"shape":[7],"dtype":"bool","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0,1.0,1.0,1.0,0.0,0.0,0.0],"values_recorded":7,"members":[{"code_sha256_prefix":"72ba653e4f5592f9","path":"load_data.py","papers":["1905.03994","2104.07892"],"paper_pages":[{"arxiv_id":"1905.03994","page":"/paper/predicting-path-failure-in-time-evolving"},{"arxiv_id":"2104.07892","page":"/paper/higher-order-attribute-enhancing"}],"arg_sig_recorded":[["idx",1,"int","int64"]],"scalar_args":{"l":"7"},"class_bearing":false}]},{"output_sha":"100e0f922c6f007f","size":1,"n_papers":1,"shape":[5],"dtype":"bool","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0,1.0,1.0,1.0,0.0],"values_recorded":5,"members":[{"code_sha256_prefix":"780134f804064be1","path":"models/M3S.py","papers":["1902.11038"],"paper_pages":[{"arxiv_id":"1902.11038","page":"/paper/multi-stage-self-supervised-learning-for"}],"arg_sig_recorded":[["idx",1,"int","int64"]],"scalar_args":{"l":"5"},"class_bearing":false}]},{"output_sha":"3e41584d656ae9da","size":1,"n_papers":1,"shape":[10],"dtype":"bool","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0],"values_recorded":10,"members":[{"code_sha256_prefix":"61cb7d8c95b55c0c","path":"utils.py","papers":["2002.05287"],"paper_pages":[{"arxiv_id":"2002.05287","page":"/paper/geom-gcn-geometric-graph-convolutional-1"}],"arg_sig_recorded":[["idx",1,"int","int64"]],"scalar_args":{"l":"10"},"class_bearing":false}]},{"output_sha":"7317d367e0366380","size":1,"n_papers":1,"shape":[8,4],"dtype":"bool","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.0,0.0,1.0,1.0,0.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,0.0,1.0,1.0,1.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,1.0,1.0,0.0,1.0,0.0],"values_recorded":32,"members":[{"code_sha256_prefix":"f3ac4b1a18df2e8f","path":"models/networks.py","papers":["2103.15619"],"paper_pages":[{"arxiv_id":"2103.15619","page":"/paper/setvae-learning-hierarchical-composition-for"}],"arg_sig_recorded":[["sample_sizes",1,"int","int64"]],"scalar_args":{"max_size":"4"},"class_bearing":false}]}]}]}