{"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/identity","entry":"identity","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":11,"n_papers":39,"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/identity","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":10,"n_papers":38,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"d7bd5ceec8a69dcd","size":9,"n_papers":37,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":9,"torch_reference_conventions_with_this_digest":[],"values":[1.8026286363601685,-1.5337762832641602,0.47605323791503906,-0.6908870339393616,-0.9028494954109192,-1.0304712057113647,-0.6627609133720398,0.5728892087936401,0.5188759565353394,0.9591456651687622,-0.3971995711326599,-1.5683481693267822,-0.28853508830070496,2.322108745574951,-0.5147839784622192,0.5505285859107971,0.06639543920755386,-1.6228755712509155,0.4321114122867584,-0.4061858654022217,-0.02259422466158867,-1.180782437324524,-0.5368682742118835,0.983674168586731,-0.7956128120422363,0.43327441811561584,0.9449777603149414,1.0175182819366455,-1.225785732269287,1.274217963218689,-1.3222218751907349,-0.5941091179847717],"values_recorded":32,"members":[{"code_sha256_prefix":"7f1040f5e3991d5e","path":"recurrent_memory_transformer_pytorch/recurrent_memory_transformer.py","papers":["2207.06881","2412.10339","1907.01470","2110.05208","2110.06848","2310.06625","2212.00794","2303.08385","2403.17834","2404.01862","2601.19040"],"paper_pages":[{"arxiv_id":"2207.06881","page":"/paper/recurrent-memory-transformer"},{"arxiv_id":"2412.10339","page":"/paper/a-universal-degradation-based-bridging"},{"arxiv_id":"1907.01470","page":"/paper/augmenting-self-attention-with-persistent"},{"arxiv_id":"2110.05208","page":"/paper/supervision-exists-everywhere-a-data-1"},{"arxiv_id":"2110.06848","page":"/paper/decoupled-contrastive-learning-1"},{"arxiv_id":"2310.06625","page":"/paper/itransformer-inverted-transformers-are"},{"arxiv_id":"2212.00794","page":"/paper/scaling-language-image-pre-training-via"},{"arxiv_id":"2303.08385","page":"/paper/generating-symbolic-music-using-diffusion"},{"arxiv_id":"2403.17834","page":"/paper/a-foundation-model-utilizing-chest-ct-volumes"},{"arxiv_id":"2404.01862","page":"/paper/co-speech-gesture-video-generation-via-motion"},{"arxiv_id":"2601.19040","page":"/paper/arxiv-2601-19040"}],"arg_sig_recorded":[["t",2,"float","float32"]],"scalar_args":{"args":"(tensor([[-0.7193, -0.4033, -0.5966,  0.1820, -0.8567],\n    ","kwargs":"{'key1': 42, 'key2': [1, 2, 3]}"},"class_bearing":false},{"code_sha256_prefix":"9910e2fc297f8665","path":"sampling.py","papers":["2010.01851","2507.08387","2102.11174","1706.07296","2011.04268","2301.10972","2101.00962","2405.14077","2608.02332"],"paper_pages":[{"arxiv_id":"2010.01851","page":"/paper/on-the-universality-of-the-double-descent-1"},{"arxiv_id":"2507.08387","page":null},{"arxiv_id":"2102.11174","page":"/paper/linear-transformers-are-secretly-fast-weight"},{"arxiv_id":"1706.07296","page":"/paper/a-minimal-developmental-model-can-increase"},{"arxiv_id":"2011.04268","page":"/paper/solving-inverse-problems-with-deep-neural"},{"arxiv_id":"2301.10972","page":"/paper/on-the-importance-of-noise-scheduling-for"},{"arxiv_id":"2101.00962","page":"/paper/hybrid-fem-nn-models-combining-artificial"},{"arxiv_id":"2405.14077","page":"/paper/learning-to-transform-dynamically-for-better"},{"arxiv_id":"2608.02332","page":"/paper/arxiv-2608-02332"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"f3232418205f7cbd","path":"memorizing_transformers_pytorch/memorizing_transformers_pytorch.py","papers":["2203.08913","2406.03293","2411.06070","2412.10339","2505.22697","2011.10043","2408.11039","2602.09258"],"paper_pages":[{"arxiv_id":"2203.08913","page":"/paper/memorizing-transformers-1"},{"arxiv_id":"2406.03293","page":"/paper/text-to-image-rectified-flow-as-plug-and-play"},{"arxiv_id":"2411.06070","page":"/paper/gft-graph-foundation-model-with-transferable"},{"arxiv_id":"2412.10339","page":"/paper/a-universal-degradation-based-bridging"},{"arxiv_id":"2505.22697","page":"/paper/update-your-transformer-to-the-latest-release"},{"arxiv_id":"2011.10043","page":"/paper/propagate-yourself-exploring-pixel-level"},{"arxiv_id":"2408.11039","page":"/paper/transfusion-predict-the-next-token-and"},{"arxiv_id":"2602.09258","page":"/paper/arxiv-2602-09258"}],"arg_sig_recorded":[["t",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"caeb28d34b34bc2a","path":"marge_pytorch/marge_pytorch.py","papers":["2505.12500","2006.04768","2003.05997","2006.15020","2002.05202"],"paper_pages":[{"arxiv_id":"2505.12500","page":"/paper/marge-improving-math-reasoning-for-llms-with"},{"arxiv_id":"2006.04768","page":"/paper/linformer-self-attention-with-linear"},{"arxiv_id":"2003.05997","page":"/paper/efficient-content-based-sparse-attention-with-1"},{"arxiv_id":"2006.15020","page":"/paper/pre-training-via-paraphrasing"},{"arxiv_id":"2002.05202","page":"/paper/glu-variants-improve-transformer"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"args":"(tensor([[-0.7193, -0.4033, -0.5966,  0.1820, -0.8567],\n    ","kwargs":"{'key1': tensor([[ 0.7748,  0.1919,  1.2638],\n        [-1.29"},"class_bearing":false},{"code_sha256_prefix":"159ce9937af279f0","path":"genienlp/tasks/almond_task.py","papers":["2010.04806"],"paper_pages":[{"arxiv_id":"2010.04806","page":"/paper/autoqa-from-databases-to-qa-semantic-parsers"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"kw":"{'key1': 'some_value', 'key2': 42}"},"class_bearing":false},{"code_sha256_prefix":"5e613c5628f4b1ac","path":"DSTPP/DiffusionModel.py","papers":["2606.01273"],"paper_pages":[{"arxiv_id":"2606.01273","page":"/paper/arxiv-2606-01273"}],"arg_sig_recorded":[["t",2,"float","float32"]],"scalar_args":{"args":"(1, 2, 'test')","kwargs":"{'key1': 'value1', 'key2': 42}"},"class_bearing":false},{"code_sha256_prefix":"9adf3e5a14a94f24","path":"lightning_uq_box/uq_methods/raps.py","papers":["2009.14193"],"paper_pages":[{"arxiv_id":"2009.14193","page":"/paper/uncertainty-sets-for-image-classifiers-using"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"dim":"None"},"class_bearing":false},{"code_sha256_prefix":"c5bb65913ea0ddde","path":"dawin_rft/main_dawin.py","papers":["2410.03782"],"paper_pages":[{"arxiv_id":"2410.03782","page":"/paper/dawin-training-free-dynamic-weight"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"device":"'cpu'"},"class_bearing":false},{"code_sha256_prefix":"d6b55d231d2542c0","path":"Models/interpretable_diffusion/gaussian_diffusion.py","papers":["2406.10354"],"paper_pages":[{"arxiv_id":"2406.10354","page":"/paper/sigdiffusions-score-based-diffusion-models"}],"arg_sig_recorded":[["t",2,"float","float32"]],"scalar_args":{"args":"()","kwargs":"{}"},"class_bearing":false}]},{"output_sha":"4327b6dd66c2078e","size":1,"n_papers":1,"shape":[4,8,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0],"values_recorded":256,"members":[{"code_sha256_prefix":"2ac41ae231f55b5c","path":"learn_embedding/embedding.py","papers":["2403.11948"],"paper_pages":[{"arxiv_id":"2403.11948","page":"/paper/learning-dynamical-systems-encoding-non"}],"arg_sig_recorded":[["y",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[3,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"fe5b7d5309402fa7","size":1,"n_papers":1,"shape":[2,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":[1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0],"values_recorded":8,"members":[{"code_sha256_prefix":"0e4da82afd23903a","path":"wiener_loss/wiener_loss.py","papers":["2311.06558"],"paper_pages":[{"arxiv_id":"2311.06558","page":"/paper/convolve-and-conquer-data-comparison-with"}],"arg_sig_recorded":[["mesh",3,"float","float32"]],"scalar_args":{"val":"1"},"class_bearing":false}]}]}]}