{"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/g","entry":"g","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":6,"n_buckets":3,"n_distinct_outputs":6,"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":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/g","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":4,"n_papers":4,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"1a8345ec26899827","size":1,"n_papers":1,"shape":[4,3],"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.6767888069152832,-1.152360200881958,0.22547465562820435,0.8411508798599243,-0.3041890859603882,0.34998318552970886,-1.286258339881897,-1.695931315422058,0.9987618923187256,0.7501894235610962,-0.15222272276878357,0.7715807557106018],"values_recorded":12,"members":[{"code_sha256_prefix":"203f94a4b5a85512","path":"experiments/fleace.py","papers":["2306.03819"],"paper_pages":[{"arxiv_id":"2306.03819","page":"/paper/leace-perfect-linear-concept-erasure-in"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"k":"3","device":"'cpu'"},"class_bearing":false}]},{"output_sha":"2d334d61d2a2d784","size":1,"n_papers":1,"shape":[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.707106351852417,2.2154526710510254,1.8570011854171753,-0.14259803295135498],"values_recorded":4,"members":[{"code_sha256_prefix":"217aabe5ff223b11","path":"burger.py","papers":["1708.07469"],"paper_pages":[{"arxiv_id":"1708.07469","page":"/paper/dgm-a-deep-learning-algorithm-for-solving"}],"arg_sig_recorded":[["S",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"3d1e96d76eeb865a","size":1,"n_papers":1,"shape":[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":[0.21583585441112518,-0.14123588800430298,-0.0036921855062246323,-0.15038053691387177,-0.04172571375966072,-0.09061402827501297,-0.02313525602221489,0.0964045524597168,-0.14123588800430298,0.3164685368537903,-0.07285875827074051,0.034038715064525604,0.0318649597465992,0.3259316384792328,0.04264460876584053,-0.1144813671708107,-0.0036921855062246323,-0.07285875827074051,0.07603376358747482,0.056090015918016434,-0.07703109830617905,-0.03734036162495613,-0.08270172029733658,-0.004274384118616581,-0.15038053691387177,0.034038715064525604,0.056090015918016434,0.21486268937587738,-0.008402182720601559,-0.05991823226213455,0.007163361646234989,-0.11753777414560318,-0.04172571375966072,0.0318649597465992,-0.07703109830617905,-0.008402182720601559,0.12471257150173187,-0.06620775163173676,0.12358806282281876,0.0015551395481452346,-0.09061402827501297,0.3259316384792328,-0.03734036162495613,-0.05991823226213455,-0.06620775163173676,0.49189838767051697,-0.0811857134103775,-0.06390193849802017,-0.02313525602221489,0.04264460876584053,-0.08270172029733658,0.007163361646234989,0.12358806282281876,-0.0811857134103775,0.1423332542181015,-0.021066348999738693,0.0964045524597168,-0.1144813671708107,-0.004274384118616581,-0.11753777414560318,0.0015551395481452346,-0.06390193849802017,-0.021066348999738693,0.10136456042528152],"values_recorded":64,"members":[{"code_sha256_prefix":"367057a642c441a6","path":"models_chains.py","papers":["2202.10720"],"paper_pages":[{"arxiv_id":"2202.10720","page":"/paper/eignn-efficient-infinite-depth-graph-neural-1"}],"arg_sig_recorded":[["F",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"d7bd5ceec8a69dcd","size":1,"n_papers":1,"shape":[4,8],"dtype":"float32","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"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":"ee4beedde707a811","path":"alfworld/linear_corex.py","papers":["2502.15147"],"paper_pages":[{"arxiv_id":"2502.15147","page":null}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"t":"4"},"class_bearing":false}]}]},{"bucket":[[1,"float","float64"],[1,"float","float64"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"4b3e46391b1f5778","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":[2.413991789803941,0.11377547262422147,4.075984363266448,1.5632128017536484,0.10325417834555853,0.011843797864470835,10.585722634348048,0.104615209484124],"values_recorded":8,"members":[{"code_sha256_prefix":"aaae9088694d9425","path":"V-PBGD/toy/toy.py","papers":["2302.05185"],"paper_pages":[{"arxiv_id":"2302.05185","page":"/paper/on-penalty-based-bilevel-gradient-descent"}],"arg_sig_recorded":[["x",1,"float","float64"],["y",1,"float","float64"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[3,"float","float32"],[3,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"e91a592968ed1dcf","size":1,"n_papers":1,"shape":[2,4,1],"dtype":"float32","type":"ndarray","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[-0.6931471824645996,-0.6931471824645996,-0.6931471824645996,-0.6931471824645996,-0.6931471824645996,-0.6931471824645996,-0.6931471824645996,-0.6931471824645996],"values_recorded":8,"members":[{"code_sha256_prefix":"d25c6435028dd30c","path":"HamiltonJacobiBellman100D.py","papers":["2209.13104"],"paper_pages":[{"arxiv_id":"2209.13104","page":"/paper/a-neural-network-approach-for-stochastic"}],"arg_sig_recorded":[["X",3,"float","float32"],["X_targ",3,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}