{"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/transform","entry":"transform","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":6,"n_papers":7,"n_buckets":5,"n_distinct_outputs":6,"n_class_bearing":0,"not_compared":{"not_run_on_shared_input":{"n":2,"by_error":{"RuntimeError":1,"ValueError":1}},"no_array_argument_ran_on_own_fixture_arguments_only":{"n":1,"n_papers":1,"recorded_shared_digest_equals_own_fixture_digest":1},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/transform","buckets":[{"bucket":[[1,"float","float64"]],"n_implementations_compared":2,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"41918e2c35216374","size":1,"n_papers":1,"shape":[16],"dtype":"float64","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[-0.28740344094272924,0.04996202130561456,0.2854075817470128,-0.24235013517446602,-0.056042783331236926,0.016862135800352316,-0.5177840867768335,-0.05644906657328996,-0.28740344094272924,0.04996202130561456,0.2854075817470128,-0.24235013517446602,-0.056042783331236926,0.016862135800352316,-0.5177840867768335,-0.05644906657328996],"values_recorded":16,"members":[{"code_sha256_prefix":"12899114f3022a68","path":"Experiments/NeuralTS.py","papers":["2010.00827"],"paper_pages":[{"arxiv_id":"2010.00827","page":"/paper/neural-thompson-sampling"}],"arg_sig_recorded":[["x",1,"float","float64"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"e81457fb13156f03","size":1,"n_papers":1,"shape":[8],"dtype":"float64","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.0,0.06338270024159486,0.27820741500526003,0.0,0.0,0.022441453806670637,0.0,0.0],"values_recorded":8,"members":[{"code_sha256_prefix":"cfea1ab5ece03bb6","path":"atari5.py","papers":["2210.02019"],"paper_pages":[{"arxiv_id":"2210.02019","page":"/paper/atari-5-distilling-the-arcade-learning"}],"arg_sig_recorded":[["x",1,"float","float64"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[1,"float","float32"]],"n_implementations_compared":1,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"4bbddb43a24b7fdf","size":1,"n_papers":2,"shape":[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":[0.09134259074926376,0.17976094782352448,0.2414676696062088,0.1031503677368164,0.15197870135307312,0.17108596861362457,0.030963310971856117,0.15187221765518188],"values_recorded":8,"members":[{"code_sha256_prefix":"b92d018d6cbdd419","path":"planner/goal_plan.py","papers":["2303.11166","1908.05451"],"paper_pages":[{"arxiv_id":"2303.11166","page":"/paper/imitating-graph-based-planning-with-goal"},{"arxiv_id":"1908.05451","page":"/paper/mapping-state-space-using-landmarks-for"}],"arg_sig_recorded":[["p",1,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[2,"float","float32"],[1,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"e3b0c44298fc1c14","size":1,"n_papers":1,"shape":[0,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":0,"torch_reference_conventions_with_this_digest":[],"values":[],"values_recorded":0,"members":[{"code_sha256_prefix":"be59209c162975a9","path":"run_pymoo_experiments.py","papers":["2210.02177"],"paper_pages":[{"arxiv_id":"2210.02177","page":"/paper/multi-objective-optimization-via-equivariant"}],"arg_sig_recorded":[["x",2,"float","float32"],["ref_point",1,"float","float32"]],"scalar_args":{"do_normalize":"True"},"class_bearing":false}]}]},{"bucket":[[2,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"48e680d0884b62f9","size":1,"n_papers":1,"shape":[4,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":[2.605257272720337,-4.06755256652832,-0.047893524169921875,-2.3817739486694336,-2.805698871612549,-3.0609424114227295,-2.325521945953369,0.14577841758728027,0.03775191307067871,0.9182913303375244,-1.7943991422653198,-4.1366963386535645,-1.5770702362060547,3.6442174911499023,-2.0295679569244385,0.10105717182159424,-0.8672091364860535,-4.24575138092041,-0.13577717542648315,-1.8123717308044434,-1.0451884269714355,-3.361564874649048,-2.0737366676330566,0.9673483371734619,-2.5912256240844727,-0.1334511637687683,0.8899555206298828,1.035036563873291,-3.451571464538574,1.548435926437378,-3.6444437503814697,-2.188218116760254],"values_recorded":32,"members":[{"code_sha256_prefix":"574268d8d2672f71","path":"lstm_src/train_det_rnn_h36m.py","papers":["1704.05831"],"paper_pages":[{"arxiv_id":"1704.05831","page":"/paper/learning-to-generate-long-term-future-via"}],"arg_sig_recorded":[["input_",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[3,"float","float32"],[3,"float","float32"],[4,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"c7624d6bc9076fd3","size":1,"n_papers":1,"shape":[2,3,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.7771936058998108,1.4590362310409546,-1.0920583009719849,-0.2339460700750351,0.1410641372203827,-1.215523362159729,-0.29138121008872986,-0.3015068471431732,-1.842403769493103,-0.005182256922125816,-0.7403875589370728,-0.6701945662498474,0.7250304818153381,-0.14866086840629578,0.13275405764579773,0.3577459156513214,1.5945931673049927,-0.6386748552322388,-0.06583322584629059,0.6431503295898438,-0.4805354177951813,0.9585846662521362,-0.35638073086738586,0.799116313457489,0.7923933267593384,0.8018006086349487,-0.6210430264472961,-0.271638959646225,-0.8557107448577881,1.073378324508667,-0.7973955869674683,1.550223469734192,-0.8303655385971069,1.6331688165664673,-1.0282459259033203,-0.6895075440406799,0.8645390868186951,0.5248972773551941,0.037349849939346313,1.4942305088043213,-1.0504392385482788,-0.7659087181091309,-0.8789622187614441,-0.5957480072975159,0.8606369495391846,-0.121453657746315,0.3412756025791168,0.7868780493736267,-0.2594076097011566,-0.09009944647550583,0.6461510062217712,-0.8409183621406555,0.44952961802482605,0.18276646733283997,-0.6097725033760071,-0.8087090849876404,-1.0733743906021118,1.0099706649780273,1.413244366645813,-0.4992290139198303,1.600469946861267,1.0880440473556519,-1.10135018825531,-0.7069946527481079,0.8440517783164978,-1.0907533168792725,0.7723703980445862,2.0942370891571045,0.4846275746822357,0.022118685767054558,3.1044223308563232,0.0736190527677536,0.6060231924057007,0.28421318531036377,0.5158193111419678,-0.6696537733078003,1.0927388668060303,0.267061322927475,0.6621701121330261,0.2371496558189392,-2.2168080806732178,-0.08749820291996002,0.16540314257144928,-0.8387367129325867,0.7167379260063171,1.2303640842437744,-1.5213911533355713,1.0778614282608032,0.22837327420711517,0.4391850531101227,1.9725817441940308,-1.1686570644378662,0.49750959873199463,0.14785639941692352,-1.3677366971969604,-0.28564757108688354],"values_recorded":96,"members":[{"code_sha256_prefix":"298f30782ca9898e","path":"StyleTransfer.py","papers":["1705.08086"],"paper_pages":[{"arxiv_id":"1705.08086","page":"/paper/universal-style-transfer-via-feature"}],"arg_sig_recorded":[["cF",3,"float","float32"],["sF",3,"float","float32"],["csF",4,"float","float32"]],"scalar_args":{"alpha":"0.5"},"class_bearing":false}]}]}]}