{"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/get-data-loaders","entry":"get_data_loaders","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":22,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":24,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":17,"n_samples_fingerprinted":0,"n_places":25,"n_places_pointer_only":8,"n_places_pointer_only_link_open":1,"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":0,"ran_fixture":0,"ran":7,"unverified":17},"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":"2607.23649","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-23649","title":"DP-IVON-Gradsq: Differentially Private Squared-Gradient Improved Variational Online Newton","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"NourJamoussi/DP-IVON-Gradsq","path":"utils/data.py","file_url":"https://github.com/NourJamoussi/DP-IVON-Gradsq/blob/HEAD/utils/data.py","status":"ran","verification_level":1,"contract_check":null,"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, NourJamoussi/DP-IVON-Gradsq when it was checked","code_sha256":"c9ab185ad5f93ae1","code_sha256_prefix":"c9ab185ad5f93ae1","mcp_get_code":{"code_sha256":"c9ab185ad5f93ae1"}},{"arxiv_id":"2606.12733","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-12733","title":"Let's Ask Gauss: Improved One-Run Privacy Auditing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"stoneboat/dpsgd-auditbench","path":"src/dataset.py","file_url":"https://github.com/stoneboat/dpsgd-auditbench/blob/HEAD/src/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"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, stoneboat/dpsgd-auditbench when it was checked","code_sha256":"6b7236e752a60f7d","code_sha256_prefix":"6b7236e752a60f7d","mcp_get_code":{"code_sha256":"6b7236e752a60f7d"}},{"arxiv_id":"2604.11011","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11011","title":"K-Way Energy Probes for Metacognition Reduce to Softmax in Discriminative Predictive Coding Networks","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"synthiumjp/ima","path":"src/cifar10_data.py","file_url":"https://github.com/synthiumjp/ima/blob/HEAD/src/cifar10_data.py","status":"unverified","verification_level":0,"contract_check":null,"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, synthiumjp/ima when it was checked","code_sha256":"ec53570b5ce2c74b","code_sha256_prefix":"ec53570b5ce2c74b","mcp_get_code":{"code_sha256":"ec53570b5ce2c74b"}},{"arxiv_id":"2603.04340","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-04340","title":"Balancing Fidelity, Utility, and Privacy in Synthetic Cardiac MRI Generation: A Comparative Study","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"vlbthambawita/SynCMRI","path":"diffusion_DDPM/data_loader.py","file_url":"https://github.com/vlbthambawita/SynCMRI/blob/HEAD/diffusion_DDPM/data_loader.py","status":"unverified","verification_level":0,"contract_check":null,"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, vlbthambawita/SynCMRI when it was checked","code_sha256":"eb9d293dd6e86049","code_sha256_prefix":"eb9d293dd6e86049","mcp_get_code":{"code_sha256":"eb9d293dd6e86049"}},{"arxiv_id":"2601.18546","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18546","title":"Information Hidden in Gradients of Regression with Target Noise","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"edahelsinki/noisy_targets","path":"notes/utils.py","file_url":"https://github.com/edahelsinki/noisy_targets/blob/HEAD/notes/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":"350dd8e43f88e64b","code_sha256_prefix":"350dd8e43f88e64b","mcp_get_code":{"code_sha256":"350dd8e43f88e64b"}},{"arxiv_id":"2412.06566","arxiv_id_is_arxiv":true,"paper":"/paper/dex-data-channel-extension-for-efficient-cnn","title":"DEX: Data Channel Extension for Efficient CNN Inference on Tiny AI Accelerators","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nokia-Bell-Labs/data-channel-extension","path":"run_nas_network_search.py","file_url":"https://github.com/Nokia-Bell-Labs/data-channel-extension/blob/HEAD/run_nas_network_search.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Nokia-Bell-Labs/data-channel-extension (NOASSERTION)","code_sha256":"0b1206ef7396e7eb","code_sha256_prefix":"0b1206ef7396e7eb","mcp_get_code":{"code_sha256":"0b1206ef7396e7eb"}},{"arxiv_id":"2404.03331","arxiv_id_is_arxiv":true,"paper":"/paper/lancbio-dynamic-lanczos-aided-bilevel","title":"LancBiO: dynamic Lanczos-aided bilevel optimization via Krylov subspace","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UCAS-YanYang/LancBiO","path":"Code/LancBiO_hyperclean_Fashion/utils/dataset.py","file_url":"https://github.com/UCAS-YanYang/LancBiO/blob/HEAD/Code/LancBiO_hyperclean_Fashion/utils/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"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, UCAS-YanYang/LancBiO when it was checked","code_sha256":"c890685368211e89","code_sha256_prefix":"c890685368211e89","mcp_get_code":{"code_sha256":"c890685368211e89"}},{"arxiv_id":"2312.03631","arxiv_id_is_arxiv":true,"paper":"/paper/mocha-multi-objective-reinforcement","title":"Mitigating Open-Vocabulary Caption Hallucinations","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"assafbk/mocha_code","path":"vlm_rlhf.py","file_url":"https://github.com/assafbk/mocha_code/blob/HEAD/vlm_rlhf.py","status":"unverified","verification_level":0,"contract_check":null,"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, assafbk/mocha_code when it was checked","code_sha256":"24f6f2d5b6395922","code_sha256_prefix":"24f6f2d5b6395922","mcp_get_code":{"code_sha256":"24f6f2d5b6395922"}},{"arxiv_id":"2305.14286","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-neural-simulators-for-stochastic-1","title":"Equivariant Neural Simulators for Stochastic Spatiotemporal Dynamics","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kminartz/EPNS","path":"datasets/Cell_Combined_Dataset.py","file_url":"https://github.com/kminartz/EPNS/blob/HEAD/datasets/Cell_Combined_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":"87bab19f49c868f7","code_sha256_prefix":"87bab19f49c868f7","mcp_get_code":{"code_sha256":"87bab19f49c868f7"}},{"arxiv_id":"2305.14286","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-neural-simulators-for-stochastic-1","title":"Equivariant Neural Simulators for Stochastic Spatiotemporal Dynamics","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kminartz/EPNS","path":"datasets/N_Body_Dataset.py","file_url":"https://github.com/kminartz/EPNS/blob/HEAD/datasets/N_Body_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":"a77c39a49bdc63f5","code_sha256_prefix":"a77c39a49bdc63f5","mcp_get_code":{"code_sha256":"a77c39a49bdc63f5"}},{"arxiv_id":"2201.02177","arxiv_id_is_arxiv":true,"paper":"/paper/grokking-generalization-beyond-overfitting-on","title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","date":"2022-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielmamay/grokking","path":"grokking/data.py","file_url":"https://github.com/danielmamay/grokking/blob/HEAD/grokking/data.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":"ab942b3fd9d96975","code_sha256_prefix":"ab942b3fd9d96975","mcp_get_code":{"code_sha256":"ab942b3fd9d96975"}},{"arxiv_id":"2109.02288","arxiv_id_is_arxiv":true,"paper":"/paper/toward-realistic-single-view-3d-object","title":"Toward Realistic Single-View 3D Object Reconstruction with Unsupervised Learning from Multiple Images","date":"2021-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinairesearch/lemul","path":"dataloaders.py","file_url":"https://github.com/vinairesearch/lemul/blob/HEAD/dataloaders.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc0a1e9daff55e54","code_sha256_prefix":"cc0a1e9daff55e54","mcp_get_code":{"code_sha256":"cc0a1e9daff55e54"}},{"arxiv_id":"2104.03954","arxiv_id_is_arxiv":true,"paper":"/paper/de-rendering-the-world-s-revolutionary","title":"De-rendering the World's Revolutionary Artefacts","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elliottwu/sorderender","path":"derender/dataloaders.py","file_url":"https://github.com/elliottwu/sorderender/blob/HEAD/derender/dataloaders.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":"afcb544a47dec12a","code_sha256_prefix":"afcb544a47dec12a","mcp_get_code":{"code_sha256":"afcb544a47dec12a"}},{"arxiv_id":"2010.07962","arxiv_id_is_arxiv":true,"paper":"/paper/provably-faster-algorithms-for-bilevel-1","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junjieyang97/stocbio_hp","path":"Hyperparameter-optimization/experimental/mnist_exp.py","file_url":"https://github.com/junjieyang97/stocbio_hp/blob/HEAD/Hyperparameter-optimization/experimental/mnist_exp.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":"3851e32f29e94b92","code_sha256_prefix":"3851e32f29e94b92","mcp_get_code":{"code_sha256":"3851e32f29e94b92"}},{"arxiv_id":"2009.10588","arxiv_id_is_arxiv":true,"paper":"/paper/anomalous-diffusion-dynamics-of-learning-in","title":"Anomalous diffusion dynamics of learning in deep neural networks","date":"2020-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ifgovh/Anomalous-diffusion-dynamics-of-SGD","path":"train_DNN_code/dataloader.py","file_url":"https://github.com/ifgovh/Anomalous-diffusion-dynamics-of-SGD/blob/HEAD/train_DNN_code/dataloader.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":"191831befedc50f5","code_sha256_prefix":"191831befedc50f5","mcp_get_code":{"code_sha256":"191831befedc50f5"}},{"arxiv_id":"2008.06520","arxiv_id_is_arxiv":true,"paper":"/paper/learning-gradient-fields-for-shape-generation","title":"Learning Gradient Fields for Shape Generation","date":"2020-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuojinCai/ShapeGF","path":"datasets/pointflow_datasets.py","file_url":"https://github.com/RuojinCai/ShapeGF/blob/HEAD/datasets/pointflow_datasets.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":"8c812eb8082d2cdc","code_sha256_prefix":"8c812eb8082d2cdc","mcp_get_code":{"code_sha256":"8c812eb8082d2cdc"}},{"arxiv_id":"2002.08599","arxiv_id_is_arxiv":true,"paper":"/paper/on-learning-sets-of-symmetric-elements","title":"On Learning Sets of Symmetric Elements","date":"2020-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/On-Learning-Sets-of-Symmetric-Elements","path":"synthetic_exp/dataset.py","file_url":"https://github.com/NVlabs/On-Learning-Sets-of-Symmetric-Elements/blob/HEAD/synthetic_exp/dataset.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":"76aaf9d1578e0d4c","code_sha256_prefix":"76aaf9d1578e0d4c","mcp_get_code":{"code_sha256":"76aaf9d1578e0d4c"}},{"arxiv_id":"1912.03250","arxiv_id_is_arxiv":true,"paper":"/paper/differentially-private-mixed-type-data-1","title":"Differentially Private Synthetic Mixed-Type Data Generation For Unsupervised Learning","date":"2019-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DPautoGAN/DPautoGAN","path":"mimic/sampling.py","file_url":"https://github.com/DPautoGAN/DPautoGAN/blob/HEAD/mimic/sampling.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":"d18aa2d6a3614265","code_sha256_prefix":"d18aa2d6a3614265","mcp_get_code":{"code_sha256":"d18aa2d6a3614265"}},{"arxiv_id":"1911.11130","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-of-probably-symmetric","title":"Unsupervised Learning of Probably Symmetric Deformable 3D Objects from Images in the Wild","date":"2019-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elliottwu/unsup3d","path":"unsup3d/dataloaders.py","file_url":"https://github.com/elliottwu/unsup3d/blob/HEAD/unsup3d/dataloaders.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":"e49ea94e0987a6e8","code_sha256_prefix":"e49ea94e0987a6e8","mcp_get_code":{"code_sha256":"e49ea94e0987a6e8"}},{"arxiv_id":"1908.09791","arxiv_id_is_arxiv":true,"paper":"/paper/once-for-all-train-one-network-and-specialize","title":"Once-for-All: Train One Network and Specialize it for Efficient Deployment","date":"2019-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"analogdevicesinc/ai8x-training","path":"run_nas_network_search.py","file_url":"https://github.com/analogdevicesinc/ai8x-training/blob/HEAD/run_nas_network_search.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Nokia-Bell-Labs/data-channel-extension, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"0b1206ef7396e7eb","code_sha256_prefix":"0b1206ef7396e7eb","mcp_get_code":{"code_sha256":"0b1206ef7396e7eb"}},{"arxiv_id":"1906.12320","arxiv_id_is_arxiv":true,"paper":"/paper/pointflow-3d-point-cloud-generation-with","title":"PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flows","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevenygd/PointFlow","path":"datasets.py","file_url":"https://github.com/stevenygd/PointFlow/blob/HEAD/datasets.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":"92805c7faaa80e02","code_sha256_prefix":"92805c7faaa80e02","mcp_get_code":{"code_sha256":"92805c7faaa80e02"}},{"arxiv_id":"1906.12320","arxiv_id_is_arxiv":true,"paper":"/paper/pointflow-3d-point-cloud-generation-with","title":"PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flows","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmum/LoCondA","path":"datasets/pointflow.py","file_url":"https://github.com/gmum/LoCondA/blob/HEAD/datasets/pointflow.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":"423797b5261350e2","code_sha256_prefix":"423797b5261350e2","mcp_get_code":{"code_sha256":"423797b5261350e2"}},{"arxiv_id":"1906.12320","arxiv_id_is_arxiv":true,"paper":"/paper/pointflow-3d-point-cloud-generation-with","title":"PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flows","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rg321/pointFlow_exp","path":"datasets.py","file_url":"https://github.com/rg321/pointFlow_exp/blob/HEAD/datasets.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":"00c2d6048b70226a","code_sha256_prefix":"00c2d6048b70226a","mcp_get_code":{"code_sha256":"00c2d6048b70226a"}},{"arxiv_id":"1806.04321","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-learning-of-energy-constrained","title":"Energy-Constrained Compression for Deep Neural Networks via Weighted Sparse Projection and Layer Input Masking","date":"2018-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyang1990/model_based_energy_constrained_compression","path":"utils.py","file_url":"https://github.com/hyang1990/model_based_energy_constrained_compression/blob/HEAD/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":"274396f6683440b3","code_sha256_prefix":"274396f6683440b3","mcp_get_code":{"code_sha256":"274396f6683440b3"}},{"arxiv_id":"1511.00561","arxiv_id_is_arxiv":true,"paper":"/paper/segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control","path":"control_functions.py","file_url":"https://github.com/zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control/blob/HEAD/control_functions.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":"5ff542951a6359ce","code_sha256_prefix":"5ff542951a6359ce","mcp_get_code":{"code_sha256":"5ff542951a6359ce"}}],"record_sha256":"1cf78f862c40cc617c33eecd81c327e7fb8f57771154a560ab9ed57320422ffc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}