Home › Code › load_npz

load_npz

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

load_npz appears in the code Syntology harvested for 17 papers, as 14 distinct code bodies found in 17 places (a place is one code body under one paper). Of the 17 papers, 15 with a sample that ran: 11 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument. 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named load_npz do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 14 distinct code bodies named load_npz: 12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
3ran · our draft was wrong
0ran; the contract check could not run
9ran
2unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 2 of the 17 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

17 papers shown of 17, newest first; 17 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Flow Matching Policy Optimization with Mirror Descent and Entropy Constraints added by Syntology 18 Mar 2026 lzqw/FLAME/analysis/plot_three_obstacle_pullback_results.py 0385ed9d7ed29835 ran · our draft was wrong no licence file found · pointer only
Differential Voting: Loss Functions For Axiomatically Diverse Aggregation of Heterogeneous Preferences added by Syntology 2026-01 (from id) ryeii/Differential-Voting/plot.py de3df5d32fe205d9 ran · our draft was wrong no licence file found · pointer only
SVRPBench: A Realistic Benchmark for Stochastic Vehicle Routing Problem 28 May 2025 yehias21/vrp-benchmarks/vrp_bench/dataset.py 8fee1e9cb8e95fd1 ran MIT (permissive)
Efficient Diffusion Transformer Policies with Mixture of Expert Denoisers for Multitask Learning 17 Dec 2024 intuitive-robots/MoDE_Diffusion_Policy/mode/datasets/disk_dataset.py 68787b0149b5e4bf ran MIT (permissive)
Multimodal Diffusion Transformer: Learning Versatile Behavior from Multimodal Goals 2024-07 (from id) intuitive-robots/mdt_policy/mdt/datasets/disk_dataset.py c0de2c3f2828b5a3 ran · our draft was wrong MIT (permissive)
StoryBench: A Multifaceted Benchmark for Continuous Story Visualization 22 Aug 2023 google/storybench/metrics/utils.py f492906c56e978ff ran Apache-2.0 (permissive)
Video Prediction Models as Rewards for Reinforcement Learning 23 May 2023 Alescontrela/viper_rl/viper_rl/videogpt/data.py 3420673d38aa9a45 ran MIT (permissive)
CALVIN: A Benchmark for Language-Conditioned Policy Learning for Long-Horizon Robot Manipulation Tasks 6 Dec 2021 mees/calvin/calvin_models/calvin_agent/datasets/disk_dataset.py c0de2c3f2828b5a3 ran · our draft was wrong MIT (permissive)
LAFITE: Towards Language-Free Training for Text-to-Image Generation 27 Nov 2021 oxygenlu/ratlip/code/lib/utils.py 6364051ef9e418c9 ran MIT (permissive)
Adversarial Attack on Large Scale Graph 8 Sep 2020 EdisonLeeeee/SGAttack/src/utils.py 3b49e3b820a0cded unverified MIT (permissive)
Graph Random Neural Network for Semi-Supervised Learning on Graphs 22 May 2020 junzhuang-code/lindt/src/baselines/nettack/utils.py 3a0244a98c124e9a ran MIT (permissive)
Scalable Attack on Graph Data by Injecting Vicious Nodes 22 Apr 2020 wangjh-github/AFGSM/utils.py 927f1359253b2330 unverified Apache-2.0 (permissive)
Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models 12 Feb 2020 chisam0217/Graph-Universal-Attack/GUA/utils.py 4d18cf730d25baa5 ran MIT (permissive)
Adversarial Attacks on Graph Neural Networks via Meta Learning 22 Feb 2019 danielzuegner/gnn-meta-attack/metattack/utils.py 4d18cf730d25baa5 ran MIT (permissive)
BayesGrad: Explaining Predictions of Graph Convolutional Networks 4 Jul 2018 pfnet-research/bayesgrad/experiments/tox21/utils.py faff5ff0e5fabfb8 ran MIT (permissive)
Adversarial Attacks on Neural Networks for Graph Data 21 May 2018 danielzuegner/nettack/nettack/utils.py 3a0244a98c124e9a ran MIT (permissive)
NetGAN: Generating Graphs via Random Walks 2 Mar 2018 danielzuegner/netgan/netgan/utils.py a21cb3c39009ec5c ran MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections