{"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-similarity","entry":"get_similarity","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":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/get-similarity","buckets":[{"bucket":[[2,"float","float64"],[2,"float","float64"]],"n_implementations_compared":2,"n_papers":3,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"af5570f5a1810b7a","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":[0.0],"values_recorded":1,"members":[{"code_sha256_prefix":"b3d657e0309bf67d","path":"all_baselines/fed-cluster/models/fedcluster.py","papers":["2005.01026","2108.08647"],"paper_pages":[{"arxiv_id":"2005.01026","page":"/paper/multi-center-federated-learning"},{"arxiv_id":"2108.08647","page":"/paper/multi-center-federated-learning-1"}],"arg_sig_recorded":[["X_c1",2,"float","float64"],["X_c2",2,"float","float64"]],"scalar_args":{"c1":"'cluster_1'","c2":"'cluster_2'"},"class_bearing":false}]},{"output_sha":"92eb2826d9faad6d","size":1,"n_papers":1,"shape":[4,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.0,0.44051321786090547,0.8695645661612922,0.3803311980720498,0.44051321786090547,1.0,0.3004922729615789,0.5957653248364353,0.8695645661612922,0.3004922729615789,1.0,0.34253711718313584,0.3803311980720498,0.5957653248364353,0.34253711718313584,1.0],"values_recorded":16,"members":[{"code_sha256_prefix":"6e7c054c599e7013","path":"extract_alignments.py","papers":["2109.04556"],"paper_pages":[{"arxiv_id":"2109.04556","page":"/paper/subword-mapping-and-anchoring-across"}],"arg_sig_recorded":[["X",2,"float","float64"],["Y",2,"float","float64"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[4,"float","float32"],[4,"float","float32"],[3,"int","int64"]],"n_implementations_compared":1,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"cf71868516e464b9","size":1,"n_papers":2,"shape":[2,1,4,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":[0.9999720454216003,1.0,0.6244810819625854,0.9999999403953552,1.0000001192092896,0.9999998807907104,0.33454710245132446,0.22866366803646088,0.5318602323532104,0.34425899386405945,0.5434719920158386,0.8101045489311218,0.8215076327323914,0.9999995231628418,0.8426104187965393,0.8952403664588928,0.689116358757019,0.5102018713951111,0.0,0.8229587078094482,0.0,0.628939151763916,0.9999998807907104,0.4047446846961975,0.9626468420028687,1.0,0.7382482886314392,0.9999999403953552,0.9729928374290466,0.9792652130126953,1.0,0.5853984355926514],"values_recorded":32,"members":[{"code_sha256_prefix":"878c68bef4a644c0","path":"model/AMFormer.py","papers":["2311.17626","2407.09842"],"paper_pages":[{"arxiv_id":"2311.17626","page":"/paper/focus-on-query-adversarial-mining-transformer-1"},{"arxiv_id":"2407.09842","page":"/paper/eliminating-feature-ambiguity-for-few-shot"}],"arg_sig_recorded":[["q",4,"float","float32"],["s",4,"float","float32"],["mask",3,"int","int64"]],"scalar_args":{},"class_bearing":false}]}]}]}