{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/load-npz","entry":"load_npz","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":17,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":14,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":9,"unverified":2},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2603.17685","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-17685","title":"Flow Matching Policy Optimization with Mirror Descent and Entropy Constraints","date":"2026-03-18","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"lzqw/FLAME","path":"analysis/plot_three_obstacle_pullback_results.py","file_url":"https://github.com/lzqw/FLAME/blob/HEAD/analysis/plot_three_obstacle_pullback_results.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lzqw/FLAME when it was checked","code_sha256":"0385ed9d7ed29835","code_sha256_prefix":"0385ed9d7ed29835","mcp_get_code":{"code_sha256":"0385ed9d7ed29835"}},{"arxiv_id":"2601.18824","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18824","title":"Differential Voting: Loss Functions For Axiomatically Diverse Aggregation of Heterogeneous Preferences","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ryeii/Differential-Voting","path":"plot.py","file_url":"https://github.com/ryeii/Differential-Voting/blob/HEAD/plot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ryeii/Differential-Voting when it was checked","code_sha256":"de3df5d32fe205d9","code_sha256_prefix":"de3df5d32fe205d9","mcp_get_code":{"code_sha256":"de3df5d32fe205d9"}},{"arxiv_id":"2505.21887","arxiv_id_is_arxiv":true,"paper":"/paper/svrpbench-a-realistic-benchmark-for","title":"SVRPBench: A Realistic Benchmark for Stochastic Vehicle Routing Problem","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yehias21/vrp-benchmarks","path":"vrp_bench/dataset.py","file_url":"https://github.com/yehias21/vrp-benchmarks/blob/HEAD/vrp_bench/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8fee1e9cb8e95fd1","code_sha256_prefix":"8fee1e9cb8e95fd1","mcp_get_code":{"code_sha256":"8fee1e9cb8e95fd1"}},{"arxiv_id":"2412.12953","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-diffusion-transformer-policies-with","title":"Efficient Diffusion Transformer Policies with Mixture of Expert Denoisers for Multitask Learning","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intuitive-robots/MoDE_Diffusion_Policy","path":"mode/datasets/disk_dataset.py","file_url":"https://github.com/intuitive-robots/MoDE_Diffusion_Policy/blob/HEAD/mode/datasets/disk_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"68787b0149b5e4bf","code_sha256_prefix":"68787b0149b5e4bf","mcp_get_code":{"code_sha256":"68787b0149b5e4bf"}},{"arxiv_id":"2407.05996","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-diffusion-transformer-learning","title":"Multimodal Diffusion Transformer: Learning Versatile Behavior from Multimodal Goals","date":null,"month_inferred_from_arxiv_id":"2024-07","title_source":"archive","repo":"intuitive-robots/mdt_policy","path":"mdt/datasets/disk_dataset.py","file_url":"https://github.com/intuitive-robots/mdt_policy/blob/HEAD/mdt/datasets/disk_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c0de2c3f2828b5a3","code_sha256_prefix":"c0de2c3f2828b5a3","mcp_get_code":{"code_sha256":"c0de2c3f2828b5a3"}},{"arxiv_id":"2308.11606","arxiv_id_is_arxiv":true,"paper":"/paper/storybench-a-multifaceted-benchmark-for-1","title":"StoryBench: A Multifaceted Benchmark for Continuous Story Visualization","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/storybench","path":"metrics/utils.py","file_url":"https://github.com/google/storybench/blob/HEAD/metrics/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f492906c56e978ff","code_sha256_prefix":"f492906c56e978ff","mcp_get_code":{"code_sha256":"f492906c56e978ff"}},{"arxiv_id":"2305.14343","arxiv_id_is_arxiv":true,"paper":"/paper/video-prediction-models-as-rewards-for","title":"Video Prediction Models as Rewards for Reinforcement Learning","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alescontrela/viper_rl","path":"viper_rl/videogpt/data.py","file_url":"https://github.com/Alescontrela/viper_rl/blob/HEAD/viper_rl/videogpt/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3420673d38aa9a45","code_sha256_prefix":"3420673d38aa9a45","mcp_get_code":{"code_sha256":"3420673d38aa9a45"}},{"arxiv_id":"2112.03227","arxiv_id_is_arxiv":true,"paper":"/paper/calvin-a-benchmark-for-language-conditioned","title":"CALVIN: A Benchmark for Language-Conditioned Policy Learning for Long-Horizon Robot Manipulation Tasks","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mees/calvin","path":"calvin_models/calvin_agent/datasets/disk_dataset.py","file_url":"https://github.com/mees/calvin/blob/HEAD/calvin_models/calvin_agent/datasets/disk_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c0de2c3f2828b5a3","code_sha256_prefix":"c0de2c3f2828b5a3","mcp_get_code":{"code_sha256":"c0de2c3f2828b5a3"}},{"arxiv_id":"2111.13792","arxiv_id_is_arxiv":true,"paper":"/paper/lafite-towards-language-free-training-for","title":"LAFITE: Towards Language-Free Training for Text-to-Image Generation","date":"2021-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxygenlu/ratlip","path":"code/lib/utils.py","file_url":"https://github.com/oxygenlu/ratlip/blob/HEAD/code/lib/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6364051ef9e418c9","code_sha256_prefix":"6364051ef9e418c9","mcp_get_code":{"code_sha256":"6364051ef9e418c9"}},{"arxiv_id":"2009.03488","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attack-on-large-scale-graph","title":"Adversarial Attack on Large Scale Graph","date":"2020-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EdisonLeeeee/SGAttack","path":"src/utils.py","file_url":"https://github.com/EdisonLeeeee/SGAttack/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b49e3b820a0cded","code_sha256_prefix":"3b49e3b820a0cded","mcp_get_code":{"code_sha256":"3b49e3b820a0cded"}},{"arxiv_id":"2005.11079","arxiv_id_is_arxiv":true,"paper":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junzhuang-code/lindt","path":"src/baselines/nettack/utils.py","file_url":"https://github.com/junzhuang-code/lindt/blob/HEAD/src/baselines/nettack/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a0244a98c124e9a","code_sha256_prefix":"3a0244a98c124e9a","mcp_get_code":{"code_sha256":"3a0244a98c124e9a"}},{"arxiv_id":"2004.13825","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-attack-on-graph-data-by-injecting","title":"Scalable Attack on Graph Data by Injecting Vicious Nodes","date":"2020-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangjh-github/AFGSM","path":"utils.py","file_url":"https://github.com/wangjh-github/AFGSM/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"927f1359253b2330","code_sha256_prefix":"927f1359253b2330","mcp_get_code":{"code_sha256":"927f1359253b2330"}},{"arxiv_id":"2002.04784","arxiv_id_is_arxiv":true,"paper":"/paper/graph-universal-adversarial-attacks-a-few-bad","title":"Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chisam0217/Graph-Universal-Attack","path":"GUA/utils.py","file_url":"https://github.com/chisam0217/Graph-Universal-Attack/blob/HEAD/GUA/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d18cf730d25baa5","code_sha256_prefix":"4d18cf730d25baa5","mcp_get_code":{"code_sha256":"4d18cf730d25baa5"}},{"arxiv_id":"1902.08412","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attacks-on-graph-neural-networks","title":"Adversarial Attacks on Graph Neural Networks via Meta Learning","date":"2019-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielzuegner/gnn-meta-attack","path":"metattack/utils.py","file_url":"https://github.com/danielzuegner/gnn-meta-attack/blob/HEAD/metattack/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d18cf730d25baa5","code_sha256_prefix":"4d18cf730d25baa5","mcp_get_code":{"code_sha256":"4d18cf730d25baa5"}},{"arxiv_id":"1807.01985","arxiv_id_is_arxiv":true,"paper":"/paper/bayesgrad-explaining-predictions-of-graph","title":"BayesGrad: Explaining Predictions of Graph Convolutional Networks","date":"2018-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/bayesgrad","path":"experiments/tox21/utils.py","file_url":"https://github.com/pfnet-research/bayesgrad/blob/HEAD/experiments/tox21/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"faff5ff0e5fabfb8","code_sha256_prefix":"faff5ff0e5fabfb8","mcp_get_code":{"code_sha256":"faff5ff0e5fabfb8"}},{"arxiv_id":"1805.07984","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attacks-on-neural-networks-for","title":"Adversarial Attacks on Neural Networks for Graph Data","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielzuegner/nettack","path":"nettack/utils.py","file_url":"https://github.com/danielzuegner/nettack/blob/HEAD/nettack/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a0244a98c124e9a","code_sha256_prefix":"3a0244a98c124e9a","mcp_get_code":{"code_sha256":"3a0244a98c124e9a"}},{"arxiv_id":"1803.00816","arxiv_id_is_arxiv":true,"paper":"/paper/netgan-generating-graphs-via-random-walks","title":"NetGAN: Generating Graphs via Random Walks","date":"2018-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielzuegner/netgan","path":"netgan/utils.py","file_url":"https://github.com/danielzuegner/netgan/blob/HEAD/netgan/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a21cb3c39009ec5c","code_sha256_prefix":"a21cb3c39009ec5c","mcp_get_code":{"code_sha256":"a21cb3c39009ec5c"}}],"record_sha256":"ae318a583d4497aa2b2f9f0bfbd9ef83e73b03d305dfb00371f27f433543d8f5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}