{"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/to-var","entry":"to_var","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":12,"n_papers":21,"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/to-var","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":12,"n_papers":21,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"d7bd5ceec8a69dcd","size":12,"n_papers":21,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":12,"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":"502c50812b7f31ab","path":"models.py","papers":["1511.06349","1502.03044","1905.01639","1704.03162","2403.11561"],"paper_pages":[{"arxiv_id":"1511.06349","page":"/paper/generating-sentences-from-a-continuous-space"},{"arxiv_id":"1502.03044","page":"/paper/show-attend-and-tell-neural-image-caption"},{"arxiv_id":"1905.01639","page":"/paper/deep-video-inpainting"},{"arxiv_id":"1704.03162","page":"/paper/show-ask-attend-and-answer-a-strong-baseline"},{"arxiv_id":"2403.11561","page":"/paper/learning-unified-reference-representation-for"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"volatile":"False"},"class_bearing":false},{"code_sha256_prefix":"a2f6a25906e664c5","path":"section4/Class_Imbalance/LT1.py","papers":["2104.15092","2202.05613","2603.29108"],"paper_pages":[{"arxiv_id":"2104.15092","page":"/paper/faster-meta-update-strategy-for-noise-robust"},{"arxiv_id":"2202.05613","page":"/paper/cmw-net-learning-a-class-aware-sample"},{"arxiv_id":"2603.29108","page":"/paper/arxiv-2603-29108"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"requires_grad":"True"},"class_bearing":false},{"code_sha256_prefix":"bbebd95a156061b0","path":"run_pplm.py","papers":["1912.02164","2105.00164","2010.05906"],"paper_pages":[{"arxiv_id":"1912.02164","page":"/paper/plug-and-play-language-models-a-simple"},{"arxiv_id":"2105.00164","page":"/paper/hidden-backdoors-in-human-centric-language"},{"arxiv_id":"2010.05906","page":"/paper/back-to-the-future-unsupervised-backprop"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"requires_grad":"True","volatile":"False","device":"'cpu'"},"class_bearing":false},{"code_sha256_prefix":"21adbeb5db124ddb","path":"trainer.py","papers":["1902.07379","2104.09045"],"paper_pages":[{"arxiv_id":"1902.07379","page":"/paper/push-the-student-to-learn-right-progressive"},{"arxiv_id":"2104.09045","page":"/paper/do-we-really-need-gold-samples-for-sample"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"requires_grad":"True"},"class_bearing":false},{"code_sha256_prefix":"2cddc9768ef9402a","path":"model.py","papers":["2008.09887","2603.13501"],"paper_pages":[{"arxiv_id":"2008.09887","page":"/paper/data-programming-using-semi-supervision-and"},{"arxiv_id":"2603.13501","page":"/paper/arxiv-2603-13501"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"requires_grad":"True"},"class_bearing":false},{"code_sha256_prefix":"36326e7b5eb789e9","path":"model.py","papers":["1511.06349"],"paper_pages":[{"arxiv_id":"1511.06349","page":"/paper/generating-sentences-from-a-continuous-space"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"8857afb4339bfbee","path":"paper_code/pplm.py","papers":["2010.08618"],"paper_pages":[{"arxiv_id":"2010.08618","page":"/paper/substance-over-style-document-level-targeted"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"requires_grad":"False","volatile":"False"},"class_bearing":false},{"code_sha256_prefix":"8c20544f7278d430","path":"multiple_attribute/model.py","papers":["2004.14983"],"paper_pages":[{"arxiv_id":"2004.14983","page":"/paper/control-generate-augment-a-scalable-framework"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"cuda2":"device(type='cpu')","volatile":"False"},"class_bearing":false},{"code_sha256_prefix":"a56c253f53bf5251","path":"poison_rli_agr_twp.py","papers":["2303.02242"],"paper_pages":[{"arxiv_id":"2303.02242","page":"/paper/trojtext-test-time-invisible-textual-trojan"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"requires_grad":"False"},"class_bearing":false},{"code_sha256_prefix":"ad808d0123ba9821","path":"train/discoeval_example.py","papers":["1909.00142"],"paper_pages":[{"arxiv_id":"1909.00142","page":"/paper/evaluation-benchmarks-and-learning"}],"arg_sig_recorded":[["inputs",2,"float","float32"]],"scalar_args":{"model":"MinimalModel(\n  (linear): Linear(in_features=4, out_features"},"class_bearing":false},{"code_sha256_prefix":"c87e08e7b5f708e9","path":"desire/nn/cvae.py","papers":["1704.04394"],"paper_pages":[{"arxiv_id":"1704.04394","page":"/paper/desire-distant-future-prediction-in-dynamic"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"d35744eb1d104e9b","path":"my_sinkhorn_ops.py","papers":["2502.14628"],"paper_pages":[{"arxiv_id":"2502.14628","page":"/paper/pearl-towards-permutation-resilient-llms"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}