{"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/rotate-every-two","entry":"rotate_every_two","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":5,"n_papers":8,"n_buckets":2,"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/rotate-every-two","buckets":[{"bucket":[[4,"float","float32"]],"n_implementations_compared":3,"n_papers":6,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"9694354400b71f19","size":3,"n_papers":6,"shape":[2,3,4,4],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":3,"torch_reference_conventions_with_this_digest":[],"values":[-0.6530793309211731,0.7231047749519348,-1.0985400676727295,1.4460861682891846,0.19992724061012268,1.1372957229614258,-0.8319791555404663,-0.2714869976043701,0.13238386809825897,0.3433533310890198,0.012713957577943802,-1.1905570030212402,0.4362029433250427,-0.709074079990387,-0.812962532043457,-2.665717124938965,-0.12553228437900543,-0.45303258299827576,1.463806390762329,0.5928415060043335,-1.1514394283294678,-0.7250184416770935,-1.4335219860076904,-0.3975509703159332,-1.184694528579712,0.22366678714752197,0.16907231509685516,-2.0680742263793945,-0.00391392083838582,0.3742450773715973,0.4980470836162567,0.895301342010498,-1.020633339881897,-0.4213716387748718,0.4854681193828583,-0.4836711883544922,-1.982889175415039,-0.6618722677230835,1.2040232419967651,0.2125764787197113,1.479430913925171,-0.21204684674739838,-1.2173826694488525,-0.7425822019577026,0.16384494304656982,0.022702597081661224,1.246457576751709,0.3325777053833008,-0.47569993138313293,1.0319796800613403,0.01877530850470066,2.1016592979431152,0.6244865655899048,1.654322624206543,0.21435445547103882,-2.408447742462158,2.00654673576355,-1.3870023488998413,0.026417039334774017,-1.3687102794647217,0.7385192513465881,-2.796109437942505,-0.21286723017692566,-0.6348524689674377,1.0907533168792725,0.8440517783164978,-2.0942370891571045,0.7723703980445862,-0.022118685767054558,0.4846275746822357,-0.0736190527677536,3.1044223308563232,-0.28421318531036377,0.6060231924057007,0.6696537733078003,0.5158193111419678,-0.267061322927475,1.0927388668060303,-0.2371496558189392,0.6621701121330261,0.08749820291996002,-2.2168080806732178,0.8387367129325867,0.16540314257144928,-1.2303640842437744,0.7167379260063171,-1.0778614282608032,-1.5213911533355713,-0.4391850531101227,0.22837327420711517,1.1686570644378662,1.9725817441940308,-0.14785639941692352,0.49750959873199463,0.28564757108688354,-1.3677366971969604],"values_recorded":96,"members":[{"code_sha256_prefix":"c66149010337c505","path":"codegen1/jaxformer/hf/codegen/modeling_codegen.py","papers":["2512.02315","2203.13474","2206.13517"],"paper_pages":[{"arxiv_id":"2512.02315","page":"/paper/arxiv-2512-02315"},{"arxiv_id":"2203.13474","page":"/paper/a-conversational-paradigm-for-program"},{"arxiv_id":"2206.13517","page":"/paper/progen2-exploring-the-boundaries-of-protein"}],"arg_sig_recorded":[["x",4,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"5edaeffae06137e0","path":"classfication/RALA.py","papers":["2507.00698","2411.07635"],"paper_pages":[{"arxiv_id":"2507.00698","page":null},{"arxiv_id":"2411.07635","page":"/paper/breaking-the-low-rank-dilemma-of-linear"}],"arg_sig_recorded":[["x",4,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"965428aef96cf65e","path":"apicoder/CodeGenAPI/nl2code/modeling_codegen.py","papers":["2206.06888"],"paper_pages":[{"arxiv_id":"2206.06888","page":"/paper/cert-continual-pre-training-on-sketches-for"}],"arg_sig_recorded":[["x",4,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[2,"float","float32"]],"n_implementations_compared":2,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"ccd07400c61f225c","size":2,"n_papers":2,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":2,"torch_reference_conventions_with_this_digest":[],"values":[1.5337762832641602,1.8026286363601685,0.6908870339393616,0.47605323791503906,1.0304712057113647,-0.9028494954109192,-0.5728892087936401,-0.6627609133720398,-0.9591456651687622,0.5188759565353394,1.5683481693267822,-0.3971995711326599,-2.322108745574951,-0.28853508830070496,-0.5505285859107971,-0.5147839784622192,1.6228755712509155,0.06639543920755386,0.4061858654022217,0.4321114122867584,1.180782437324524,-0.02259422466158867,-0.983674168586731,-0.5368682742118835,-0.43327441811561584,-0.7956128120422363,-1.0175182819366455,0.9449777603149414,-1.274217963218689,-1.225785732269287,0.5941091179847717,-1.3222218751907349],"values_recorded":32,"members":[{"code_sha256_prefix":"07e3c5417d5f77fc","path":"timesformer_pytorch/timesformer_pytorch.py","papers":["2102.05095"],"paper_pages":[{"arxiv_id":"2102.05095","page":"/paper/is-space-time-attention-all-you-need-for"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"1ac67506c6a0368b","path":"transganformer/transganformer.py","papers":["2103.01209"],"paper_pages":[{"arxiv_id":"2103.01209","page":"/paper/generative-adversarial-transformers"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}