{"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/softplus-inverse","entry":"softplus_inverse","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":6,"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/softplus-inverse","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":2,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"99b12d3a0cddc941","size":2,"n_papers":2,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":false,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":2,"torch_reference_conventions_with_this_digest":[],"values":[1.622466802597046,NaN,-0.4947739243507385,NaN,NaN,NaN,NaN,-0.2569804787635803,-0.3854594826698303,0.4759025573730469,NaN,NaN,NaN,2.2188942432403564,NaN,-0.3090154528617859,-2.6787455081939697,NaN,-0.6152482032775879,NaN,NaN,NaN,NaN,0.5153736472129822,NaN,-0.6119370460510254,0.45282959938049316,0.5688989162445068,NaN,0.9462004899978638,NaN,NaN],"values_recorded":32,"members":[{"code_sha256_prefix":"e8c84302100af2af","path":"src/models.py","papers":["2209.10091","2312.16560"],"paper_pages":[{"arxiv_id":"2209.10091","page":"/paper/variational-inference-for-infinitely-deep"},{"arxiv_id":"2312.16560","page":"/paper/adaptive-message-passing-a-general-framework"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"2741eba57a8334ef","path":"src/models.py","papers":["2209.10091"],"paper_pages":[{"arxiv_id":"2209.10091","page":"/paper/variational-inference-for-infinitely-deep"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[1,"float","float32"]],"n_implementations_compared":1,"n_papers":4,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"ff80b225e4c72a7a","size":1,"n_papers":4,"shape":[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,-1.7710782289505005,0.3741372227668762,NaN,NaN,-2.9102320671081543,NaN,NaN],"values_recorded":8,"members":[{"code_sha256_prefix":"bc43b93c22207f08","path":"OpenDFT/QHBench/QH9/models/QHNet.py","papers":["2306.09549","2306.04922","2502.01171","2406.03794"],"paper_pages":[{"arxiv_id":"2306.09549","page":"/paper/qh9-a-quantum-hamiltonian-prediction-1"},{"arxiv_id":"2306.04922","page":"/paper/efficient-and-equivariant-graph-networks-for"},{"arxiv_id":"2502.01171","page":"/paper/efficient-and-scalable-density-functional"},{"arxiv_id":"2406.03794","page":"/paper/infusing-self-consistency-into-density"}],"arg_sig_recorded":[["x",1,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}