{"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":"/code/gen-data","entry":"gen_data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":14,"n_papers_ran":5,"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":5,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":5,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"unverified":9},"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":"2405.04923","paper":"/paper/datasp-a-differential-all-to-all-shortest","title":"DataSP: A Differential All-to-All Shortest Path Algorithm for Learning Costs and Predicting Paths with Context","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alanlahoud/datasp","path":"data_generation.py","file_url":"https://github.com/alanlahoud/datasp/blob/HEAD/data_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"734a6852070b9b8f","mcp_get_code":{"code_sha256":"734a6852070b9b8f"}},{"arxiv_id":"2403.00258","paper":"/paper/lossless-compression-of-deep-neural-networks-1","title":"\"Lossless\" Compression of Deep Neural Networks: A High-dimensional Neural Tangent Kernel Approach","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Model-Compression/Lossless_Compression","path":"code/compression/new_MNIST/GMM_data.py","file_url":"https://github.com/Model-Compression/Lossless_Compression/blob/HEAD/code/compression/new_MNIST/GMM_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"03518593ba2ab3b7","mcp_get_code":{"code_sha256":"03518593ba2ab3b7"}},{"arxiv_id":"2402.02697","paper":"/paper/deep-equilibrium-models-are-almost-equivalent","title":"Deep Equilibrium Models are Almost Equivalent to Not-so-deep Explicit Models for High-dimensional Gaussian Mixtures","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephenli24/inn_eqvi_enn","path":"data_prepare.py","file_url":"https://github.com/stephenli24/inn_eqvi_enn/blob/HEAD/data_prepare.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"61d75f1d5c488836","mcp_get_code":{"code_sha256":"61d75f1d5c488836"}},{"arxiv_id":"2312.00935","paper":"/paper/a-theory-of-unimodal-bias-in-multimodal","title":"Understanding Unimodal Bias in Multimodal Deep Linear Networks","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yedizhang/unimodal-bias","path":"data.py","file_url":"https://github.com/yedizhang/unimodal-bias/blob/HEAD/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"46f4fe4903bf7dbc","mcp_get_code":{"code_sha256":"46f4fe4903bf7dbc"}},{"arxiv_id":"2211.15423","paper":"/paper/effective-data-sampling-strategies-and","title":"Effective Data Sampling Strategies and Boundary Condition Constraints of Physics-Informed Neural Networks for Identifying Material Properties in Solid Mechanics","date":null,"month_inferred_from_arxiv_id":"2022-11","title_source":"archive","repo":"lu-group/pinn-material-identification","path":"src/2D/linear_elastic_steady_state_inverse/soft_constraints.py","file_url":"https://github.com/lu-group/pinn-material-identification/blob/HEAD/src/2D/linear_elastic_steady_state_inverse/soft_constraints.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f798af1b6014a405","mcp_get_code":{"code_sha256":"f798af1b6014a405"}},{"arxiv_id":"2210.06036","paper":"/paper/guaranteed-conservation-of-momentum-for","title":"Guaranteed Conservation of Momentum for Learning Particle-based Fluid Dynamics","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tum-pbs/dmcf","path":"datasets/column_gen.py","file_url":"https://github.com/tum-pbs/dmcf/blob/HEAD/datasets/column_gen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"581865281c139f39","mcp_get_code":{"code_sha256":"581865281c139f39"}},{"arxiv_id":"2209.15265","paper":"/paper/relu-neural-networks-learn-the-simplest","title":"Overparameterized ReLU Neural Networks Learn the Simplest Models: Neural Isometry and Exact Recovery","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pilancilab/neural-recovery","path":"ReLU_normal/cvx_train_normal.py","file_url":"https://github.com/pilancilab/neural-recovery/blob/HEAD/ReLU_normal/cvx_train_normal.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2f524b457b6a6b77","mcp_get_code":{"code_sha256":"2f524b457b6a6b77"}},{"arxiv_id":"2108.09810","paper":"/paper/iclr-2021-challenge-for-computational","title":"ICLR 2021 Challenge for Computational Geometry & Topology: Design and Results","date":null,"month_inferred_from_arxiv_id":"2021-08","title_source":"archive","repo":"geomstats/challenge-iclr-2021","path":"tomogwen__Fuzzy-C-Means-Clustering-for-Persistence-Diagrams-and-Riemannian-Manifolds/synthetic_data.py","file_url":"https://github.com/geomstats/challenge-iclr-2021/blob/HEAD/tomogwen__Fuzzy-C-Means-Clustering-for-Persistence-Diagrams-and-Riemannian-Manifolds/synthetic_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"afa0e81b8654f178","mcp_get_code":{"code_sha256":"afa0e81b8654f178"}},{"arxiv_id":"2105.13831","paper":"/paper/implicit-regularization-in-matrix-sensing-via","title":"Implicit Regularization in Matrix Sensing via Mirror Descent","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fawuuu/irmsmd","path":"algorithms.py","file_url":"https://github.com/fawuuu/irmsmd/blob/HEAD/algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e41eada09c86601c","mcp_get_code":{"code_sha256":"e41eada09c86601c"}},{"arxiv_id":"2105.10821","paper":"/paper/statistical-testing-under-distributional","title":"Statistical Testing under Distributional Shifts","date":null,"month_inferred_from_arxiv_id":"2021-05","title_source":"archive","repo":"nikolajthams/testing-under-shifts","path":"experiments/section-5-4/experiment-dormant-binary.py","file_url":"https://github.com/nikolajthams/testing-under-shifts/blob/HEAD/experiments/section-5-4/experiment-dormant-binary.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c23060621f3cbf10","mcp_get_code":{"code_sha256":"c23060621f3cbf10"}},{"arxiv_id":"2006.02796","paper":"/paper/fuzzy-c-means-clustering-for-persistence","title":"Fuzzy c-Means Clustering for Persistence Diagrams","date":"2020-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomogwen/fpdcluster","path":"src/synthetic_data.py","file_url":"https://github.com/tomogwen/fpdcluster/blob/HEAD/src/synthetic_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"489bca8eff673095","mcp_get_code":{"code_sha256":"489bca8eff673095"}},{"arxiv_id":"1901.09036","paper":"/paper/orthogonal-statistical-learning","title":"Orthogonal Statistical Learning","date":"2019-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vsyrgkanis/orthogonal_learning","path":"experiments.py","file_url":"https://github.com/vsyrgkanis/orthogonal_learning/blob/HEAD/experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"857ed32658e1afae","mcp_get_code":{"code_sha256":"857ed32658e1afae"}},{"arxiv_id":"1807.05748","paper":"/paper/learning-stochastic-differential-equations","title":"Learning Stochastic Differential Equations With Gaussian Processes Without Gradient Matching","date":"2018-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cagatayyildiz/npde","path":"utils.py","file_url":"https://github.com/cagatayyildiz/npde/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77ec784d9e1a6d0f","mcp_get_code":{"code_sha256":"77ec784d9e1a6d0f"}},{"arxiv_id":"1303.5778","paper":"/paper/speech-recognition-with-deep-recurrent-neural","title":"Speech Recognition with Deep Recurrent Neural Networks","date":"2013-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1ytic/warp-rnnt","path":"pytorch_binding/benchmark2.py","file_url":"https://github.com/1ytic/warp-rnnt/blob/HEAD/pytorch_binding/benchmark2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1326b96281ef4a4f","mcp_get_code":{"code_sha256":"1326b96281ef4a4f"}}]}