{"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/to-numpy","entry":"to_numpy","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":24,"n_papers":29,"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":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/to-numpy","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":23,"n_papers":28,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"d7bd5ceec8a69dcd","size":23,"n_papers":28,"shape":[4,8],"dtype":"float32","type":"ndarray","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":23,"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":"962843b3fc75bc61","path":"scripts/optimize_procrustes_alter.py","papers":["2404.00456","2402.17762","2412.00648"],"paper_pages":[{"arxiv_id":"2404.00456","page":"/paper/quarot-outlier-free-4-bit-inference-in"},{"arxiv_id":"2402.17762","page":"/paper/massive-activations-in-large-language-models"},{"arxiv_id":"2412.00648","page":"/paper/dfrot-achieving-outlier-free-and-massive"}],"arg_sig_recorded":[["data",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"4589e45c8e59e6fe","path":"pip/src/demovae/model.py","papers":["2112.04645","2405.07977"],"paper_pages":[{"arxiv_id":"2112.04645","page":"/paper/bacon-band-limited-coordinate-networks-for"},{"arxiv_id":"2405.07977","page":"/paper/a-demographic-conditioned-variational"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"4e11fa374508129f","path":"implicit_maml/learner_model.py","papers":["1909.04630","2601.21048"],"paper_pages":[{"arxiv_id":"1909.04630","page":"/paper/meta-learning-with-implicit-gradients"},{"arxiv_id":"2601.21048","page":"/paper/arxiv-2601-21048"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"b476623700945834","path":"reid/cluster_utils/cluster.py","papers":["2308.09951","2103.11658"],"paper_pages":[{"arxiv_id":"2308.09951","page":"/paper/semantics-meets-temporal-correspondence-self"},{"arxiv_id":"2103.11658","page":"/paper/intra-inter-camera-similarity-for"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"206093cc91ccd0b8","path":"source/DEQs.py","papers":["2202.03397"],"paper_pages":[{"arxiv_id":"2202.03397","page":"/paper/bilevel-optimization-with-a-lower-level"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"21853363fde13d45","path":"agent_system/environments/skillrise_alfworld/env_manager.py","papers":["2607.26784"],"paper_pages":[{"arxiv_id":"2607.26784","page":"/paper/arxiv-2607-26784"}],"arg_sig_recorded":[["data",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"2a066b9a11c2f824","path":"pytorch_quantizer/quantization/qtypes/int_quantizer.py","papers":["1810.05723"],"paper_pages":[{"arxiv_id":"1810.05723","page":"/paper/post-training-4-bit-quantization-of"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"334c0b12ef01ad4c","path":"discogan/discogan.py","papers":["1703.05192"],"paper_pages":[{"arxiv_id":"1703.05192","page":"/paper/learning-to-discover-cross-domain-relations"}],"arg_sig_recorded":[["data",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"4f00b7f646079156","path":"algorithm/further/agent.py","papers":["2203.03535"],"paper_pages":[{"arxiv_id":"2203.03535","page":"/paper/influencing-long-term-behavior-in-multiagent"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{"dtype":"<class 'numpy.float32'>"},"class_bearing":false},{"code_sha256_prefix":"5e6ec5e528bee1c0","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":{},"class_bearing":false},{"code_sha256_prefix":"6fda52188df3ae12","path":"bliss/models/models.py","papers":["2106.03084"],"paper_pages":[{"arxiv_id":"2106.03084","page":"/paper/combining-static-word-embeddings-and"}],"arg_sig_recorded":[["t",2,"float","float32"]],"scalar_args":{"gpu":"False"},"class_bearing":false},{"code_sha256_prefix":"71438f30b0e17975","path":"scripts/saliency_maps.py","papers":["2308.02062"],"paper_pages":[{"arxiv_id":"2308.02062","page":"/paper/diffusion-models-for-counterfactual-1"}],"arg_sig_recorded":[["z",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"78b0af73923a5d41","path":"real_datasets/isr.py","papers":["1911.08731"],"paper_pages":[{"arxiv_id":"1911.08731","page":"/paper/distributionally-robust-neural-networks-for"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"913b7c90cd8a95a7","path":"criterions/hsic.py","papers":["1910.02806"],"paper_pages":[{"arxiv_id":"1910.02806","page":"/paper/learning-de-biased-representations-with-1"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"941c9927c65dd80e","path":"semantic_guidance/env_ins.py","papers":["Singh_Combining_Semantic_Guidance_and_Deep_Reinforcement_Learning_for_Generating_Human_CVPR_2021_paper"],"paper_pages":[{"arxiv_id":"Singh_Combining_Semantic_Guidance_and_Deep_Reinforcement_Learning_for_Generating_Human_CVPR_2021_paper","page":null}],"arg_sig_recorded":[["var",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"a2a91d3eb9618070","path":"r3pm_net/model.py","papers":["2604.05060"],"paper_pages":[{"arxiv_id":"2604.05060","page":"/paper/arxiv-2604-05060"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"b3b18dfd6cac61b7","path":"src/config.py","papers":["2206.08497"],"paper_pages":[{"arxiv_id":"2206.08497","page":"/paper/unsupervised-kinematic-motion-detection-for"}],"arg_sig_recorded":[["item",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"d68951798159c3ef","path":"scripts/export_onnx_model.py","papers":["2308.16184"],"paper_pages":[{"arxiv_id":"2308.16184","page":"/paper/sam-med2d"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"dcc242b0ed171083","path":"src/fair_model.py","papers":["2204.01819"],"paper_pages":[{"arxiv_id":"2204.01819","page":"/paper/achieving-long-term-fairness-in-sequential"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"e329883dde48a331","path":"maml_rl/metalearners/maml_trpo.py","papers":["1703.03400"],"paper_pages":[{"arxiv_id":"1703.03400","page":"/paper/model-agnostic-meta-learning-for-fast"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"e8a1a77da0a39f61","path":"fcdl/model/inference_ours_base.py","papers":["2406.03234"],"paper_pages":[{"arxiv_id":"2406.03234","page":"/paper/fine-grained-causal-dynamics-learning-with"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"eca7268d93d00565","path":"src/maxi/lib/loss/lime_loss.py","papers":["1602.04938"],"paper_pages":[{"arxiv_id":"1602.04938","page":"/paper/why-should-i-trust-you-explaining-the"}],"arg_sig_recorded":[["data",2,"float","float32"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"fb4d1734a924c453","path":"cdl/model/inference_cmi.py","papers":["2206.13452"],"paper_pages":[{"arxiv_id":"2206.13452","page":"/paper/causal-dynamics-learning-for-task-independent"}],"arg_sig_recorded":[["tensor",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[2,"float","float64"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"d7bd5ceec8a69dcd","size":1,"n_papers":1,"shape":[4,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":[1.802628679592353,-1.5337762569179567,0.47605322923618437,-0.6908870620289821,-0.9028494964356759,-1.0304712253028872,-0.6627609239992189,0.572889220601701,0.5188759529457332,0.9591456414705227,-0.3971995733466898,-1.568348179202036,-0.2885350906311486,2.3221088606181515,-0.5147839769988166,0.5505285791931418,0.06639544283095257,-1.6228755249801277,0.4321114229703758,-0.40618587814690116,-0.022594224204796665,-1.1807823902688124,-0.5368682495213898,0.983674188609945,-0.7956127851079772,0.4332744095449241,0.9449777773193271,1.01751825335816,-1.2257857707553415,1.2742179092187245,-1.3222218927282292,-0.5941090922688514],"values_recorded":32,"members":[{"code_sha256_prefix":"d7484a73d272b454","path":"src/tabebm/TabEBM.py","papers":["2409.16118"],"paper_pages":[{"arxiv_id":"2409.16118","page":"/paper/tabebm-a-tabular-data-augmentation-method"}],"arg_sig_recorded":[["X",2,"float","float64"]],"scalar_args":{},"class_bearing":false}]}]}]}