{"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/atanh","entry":"atanh","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":3,"n_papers":5,"n_buckets":1,"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/atanh","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":3,"n_papers":5,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"9017a9e5156cf38e","size":2,"n_papers":4,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":false,"max_difference_among_recorded_values":2.9802322387695312e-08,"members_with_recorded_values":2,"torch_reference_conventions_with_this_digest":[],"values":[NaN,NaN,0.5178685188293457,-0.8496508598327637,-1.4874231815338135,NaN,-0.7977213263511658,0.6518130302429199,0.5748003721237183,1.935125470161438,-0.420319527387619,NaN,-0.29696759581565857,NaN,-0.5692169666290283,0.6191394329071045,0.06649324297904968,NaN,0.46248993277549744,-0.43103495240211487,-0.022598059847950935,NaN,-0.5997452735900879,2.3999786376953125,-1.0865427255630493,0.46392080187797546,1.7826341390609741,NaN,NaN,NaN,NaN,-0.6839929819107056],"values_recorded":32,"members":[{"code_sha256_prefix":"cf5ce98955ab4534","path":"smodice_pytorch.py","papers":["2202.02433","2403.01734","2602.10793"],"paper_pages":[{"arxiv_id":"2202.02433","page":"/paper/smodice-versatile-offline-imitation-learning"},{"arxiv_id":"2403.01734","page":"/paper/offline-goal-conditioned-reinforcement"},{"arxiv_id":"2602.10793","page":"/paper/arxiv-2602-10793"}],"arg_sig_recorded":[["z",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"094cf207447fa2a5","path":"planet.py","papers":["1912.01603"],"paper_pages":[{"arxiv_id":"1912.01603","page":"/paper/dream-to-control-learning-behaviors-by-latent"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"84c8f3284afd1c26","size":1,"n_papers":1,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":false,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[NaN,NaN,0.5178678631782532,-0.8496494889259338,-1.487418293952942,NaN,-0.7977200746536255,0.6518121361732483,0.574799656867981,1.9351134300231934,-0.4203190207481384,NaN,-0.2969672679901123,NaN,-0.569216251373291,0.6191385984420776,0.06649316102266312,NaN,0.46248936653137207,-0.4310344159603119,-0.022598007693886757,NaN,-0.5997444987297058,2.3999483585357666,-1.0865405797958374,0.4639202654361725,1.7826253175735474,NaN,NaN,NaN,NaN,-0.6839920282363892],"values_recorded":32,"members":[{"code_sha256_prefix":"264c9e17d7dfe7eb","path":"Sources/algo/ppo.py","papers":["1707.06347"],"paper_pages":[{"arxiv_id":"1707.06347","page":"/paper/proximal-policy-optimization-algorithms"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}