{"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/gen-data","entry":"gen_data","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":14,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":3,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":6,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":5,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":4,"unverified":6},"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":"2405.04923","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alanlahoud/datasp when it was checked","code_sha256":"734a6852070b9b8f","code_sha256_prefix":"734a6852070b9b8f","mcp_get_code":{"code_sha256":"734a6852070b9b8f"}},{"arxiv_id":"2403.00258","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"03518593ba2ab3b7","code_sha256_prefix":"03518593ba2ab3b7","mcp_get_code":{"code_sha256":"03518593ba2ab3b7"}},{"arxiv_id":"2402.02697","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, stephenli24/inn_eqvi_enn when it was checked","code_sha256":"61d75f1d5c488836","code_sha256_prefix":"61d75f1d5c488836","mcp_get_code":{"code_sha256":"61d75f1d5c488836"}},{"arxiv_id":"2312.00935","arxiv_id_is_arxiv":true,"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_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, yedizhang/unimodal-bias when it was checked","code_sha256":"46f4fe4903bf7dbc","code_sha256_prefix":"46f4fe4903bf7dbc","mcp_get_code":{"code_sha256":"46f4fe4903bf7dbc"}},{"arxiv_id":"2211.15423","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f798af1b6014a405","code_sha256_prefix":"f798af1b6014a405","mcp_get_code":{"code_sha256":"f798af1b6014a405"}},{"arxiv_id":"2210.06036","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"581865281c139f39","code_sha256_prefix":"581865281c139f39","mcp_get_code":{"code_sha256":"581865281c139f39"}},{"arxiv_id":"2209.15265","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pilancilab/neural-recovery when it was checked","code_sha256":"2f524b457b6a6b77","code_sha256_prefix":"2f524b457b6a6b77","mcp_get_code":{"code_sha256":"2f524b457b6a6b77"}},{"arxiv_id":"2108.09810","arxiv_id_is_arxiv":true,"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":"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":"afa0e81b8654f178","code_sha256_prefix":"afa0e81b8654f178","mcp_get_code":{"code_sha256":"afa0e81b8654f178"}},{"arxiv_id":"2105.13831","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fawuuu/irmsmd when it was checked","code_sha256":"e41eada09c86601c","code_sha256_prefix":"e41eada09c86601c","mcp_get_code":{"code_sha256":"e41eada09c86601c"}},{"arxiv_id":"2105.10821","arxiv_id_is_arxiv":true,"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":"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":"c23060621f3cbf10","code_sha256_prefix":"c23060621f3cbf10","mcp_get_code":{"code_sha256":"c23060621f3cbf10"}},{"arxiv_id":"2006.02796","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"489bca8eff673095","code_sha256_prefix":"489bca8eff673095","mcp_get_code":{"code_sha256":"489bca8eff673095"}},{"arxiv_id":"1901.09036","arxiv_id_is_arxiv":true,"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":"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":"857ed32658e1afae","code_sha256_prefix":"857ed32658e1afae","mcp_get_code":{"code_sha256":"857ed32658e1afae"}},{"arxiv_id":"1807.05748","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"77ec784d9e1a6d0f","code_sha256_prefix":"77ec784d9e1a6d0f","mcp_get_code":{"code_sha256":"77ec784d9e1a6d0f"}},{"arxiv_id":"1303.5778","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1326b96281ef4a4f","code_sha256_prefix":"1326b96281ef4a4f","mcp_get_code":{"code_sha256":"1326b96281ef4a4f"}}],"record_sha256":"ae20c8ebadf1bbde3ef0af1892404a2a6eb7fa8f1c55d1e50e29ad3b4539a44a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}