{"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/index-to-mask","entry":"index_to_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":3,"n_papers":7,"n_buckets":1,"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/index-to-mask","buckets":[{"bucket":[[1,"int","int64"]],"n_implementations_compared":3,"n_papers":7,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"100e0f922c6f007f","size":2,"n_papers":3,"shape":[5],"dtype":"bool","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":2,"torch_reference_conventions_with_this_digest":[],"values":[1.0,1.0,1.0,1.0,0.0],"values_recorded":5,"members":[{"code_sha256_prefix":"9664f4b5c60ab1bf","path":"nbfnet/models.py","papers":["2106.06935","2502.01113"],"paper_pages":[{"arxiv_id":"2106.06935","page":"/paper/neural-bellman-ford-networks-a-general-graph"},{"arxiv_id":"2502.01113","page":"/paper/gfm-rag-graph-foundation-model-for-retrieval"}],"arg_sig_recorded":[["index",1,"int","int64"]],"scalar_args":{"size":"5"},"class_bearing":false},{"code_sha256_prefix":"b575184b083dc83b","path":"generate_noisedata/attack_injection_noise.py","papers":["2408.00700"],"paper_pages":[{"arxiv_id":"2408.00700","page":"/paper/you-can-t-ignore-either-unifying-structure"}],"arg_sig_recorded":[["index",1,"int","int64"]],"scalar_args":{"size":"5"},"class_bearing":false}]},{"output_sha":"b2fe8c0415c63489","size":1,"n_papers":4,"shape":[7],"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,0.0,0.0],"values_recorded":7,"members":[{"code_sha256_prefix":"da80a2b9fd449bd2","path":"NLGNN/src/train_eval.py","papers":["2512.11561","2005.14612","2007.09296","2205.14403"],"paper_pages":[{"arxiv_id":"2512.11561","page":"/paper/arxiv-2512-11561"},{"arxiv_id":"2005.14612","page":"/paper/non-local-graph-neural-networks"},{"arxiv_id":"2007.09296","page":"/paper/towards-deeper-graph-neural-networks"},{"arxiv_id":"2205.14403","page":"/paper/rethinking-the-setting-of-semi-supervised"}],"arg_sig_recorded":[["index",1,"int","int64"]],"scalar_args":{"size":"7"},"class_bearing":false}]}]}]}