{"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/g","entry":"g","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":21,"n_papers_ran":21,"n_papers_ran_no_instrument_failure":16,"n_papers_ran_instrument_only":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":25,"n_samples_ran":25,"n_samples_constructed":0,"n_samples_ran_checked":20,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":20,"n_places":25,"n_places_pointer_only":14,"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":6,"ran_violates":4,"ran_draft_wrong":3,"ran_fixture":2,"ran":10,"unverified":0},"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.05892","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-05892","title":"On the convergence of graph Laplacians with a symmetric divergence","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"lzx23/graph_laplacians_w_sdiv","path":"dilation_utils.py","file_url":"https://github.com/lzx23/graph_laplacians_w_sdiv/blob/HEAD/dilation_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lzx23/graph_laplacians_w_sdiv when it was checked","code_sha256":"c338fee69fa195e7","code_sha256_prefix":"c338fee69fa195e7","mcp_get_code":{"code_sha256":"c338fee69fa195e7"}},{"arxiv_id":"2602.12923","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-12923","title":"Annealing in variational inference mitigates mode collapse: A theoretical study on Gaussian mixtures","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Luijios/annealed_vi_gmms","path":"src/utils.py","file_url":"https://github.com/Luijios/annealed_vi_gmms/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Luijios/annealed_vi_gmms when it was checked","code_sha256":"2147890ce3e5b56d","code_sha256_prefix":"2147890ce3e5b56d","mcp_get_code":{"code_sha256":"2147890ce3e5b56d"}},{"arxiv_id":"2601.01248","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-01248","title":"Stochastic Control Methods for Optimization","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Jinnqiu/Stochastic-Control-Methods-for-Optimization","path":"F_Ackley_20d.py","file_url":"https://github.com/Jinnqiu/Stochastic-Control-Methods-for-Optimization/blob/HEAD/F_Ackley_20d.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Jinnqiu/Stochastic-Control-Methods-for-Optimization when it was checked","code_sha256":"42cd4fbe54bbf6af","code_sha256_prefix":"42cd4fbe54bbf6af","mcp_get_code":{"code_sha256":"42cd4fbe54bbf6af"}},{"arxiv_id":"2601.01248","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-01248","title":"Stochastic Control Methods for Optimization","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Jinnqiu/Stochastic-Control-Methods-for-Optimization","path":"F_VF_XSY4.py","file_url":"https://github.com/Jinnqiu/Stochastic-Control-Methods-for-Optimization/blob/HEAD/F_VF_XSY4.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Jinnqiu/Stochastic-Control-Methods-for-Optimization when it was checked","code_sha256":"2a5be50b1d7b3f17","code_sha256_prefix":"2a5be50b1d7b3f17","mcp_get_code":{"code_sha256":"2a5be50b1d7b3f17"}},{"arxiv_id":"2502.15147","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2502.15147","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":null,"repo":"allenai/instructLF","path":"alfworld/linear_corex.py","file_url":"https://github.com/allenai/instructLF/blob/HEAD/alfworld/linear_corex.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ee4beedde707a811","code_sha256_prefix":"ee4beedde707a811","mcp_get_code":{"code_sha256":"ee4beedde707a811"}},{"arxiv_id":"2410.10637","arxiv_id_is_arxiv":true,"paper":"/paper/high-dimensional-differential-parameter","title":"High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leyangw/tsm","path":"loggle/Loggle_SparTSM_sine.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/loggle/Loggle_SparTSM_sine.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d993dde250539976","code_sha256_prefix":"d993dde250539976","mcp_get_code":{"code_sha256":"d993dde250539976"}},{"arxiv_id":"2410.06833","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-metastability-in-the-self-attention","title":"Dynamic metastability in the self-attention model","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugokoubbi/2024-transformers-dotm","path":"staircase.py","file_url":"https://github.com/hugokoubbi/2024-transformers-dotm/blob/HEAD/staircase.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hugokoubbi/2024-transformers-dotm when it was checked","code_sha256":"cca4fbc0607f1254","code_sha256_prefix":"cca4fbc0607f1254","mcp_get_code":{"code_sha256":"cca4fbc0607f1254"}},{"arxiv_id":"2405.05192","arxiv_id_is_arxiv":true,"paper":"/paper/full-error-analysis-of-the-random-deep","title":"Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psc25/mlpjumps","path":"counterparty_expVG_mlp.py","file_url":"https://github.com/psc25/mlpjumps/blob/HEAD/counterparty_expVG_mlp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, psc25/mlpjumps when it was checked","code_sha256":"57996fb088240971","code_sha256_prefix":"57996fb088240971","mcp_get_code":{"code_sha256":"57996fb088240971"}},{"arxiv_id":"2405.05192","arxiv_id_is_arxiv":true,"paper":"/paper/full-error-analysis-of-the-random-deep","title":"Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psc25/mlpjumps","path":"default_bs_mlp.py","file_url":"https://github.com/psc25/mlpjumps/blob/HEAD/default_bs_mlp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, psc25/mlpjumps when it was checked","code_sha256":"9206612d3995aa1c","code_sha256_prefix":"9206612d3995aa1c","mcp_get_code":{"code_sha256":"9206612d3995aa1c"}},{"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":"Gaussian_Integration.py","file_url":"https://github.com/stephenli24/inn_eqvi_enn/blob/HEAD/Gaussian_Integration.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"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":"0f0973bef7e558ef","code_sha256_prefix":"0f0973bef7e558ef","mcp_get_code":{"code_sha256":"0f0973bef7e558ef"}},{"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":"utils.py","file_url":"https://github.com/stephenli24/inn_eqvi_enn/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"e97510d9597ca6c0","code_sha256_prefix":"e97510d9597ca6c0","mcp_get_code":{"code_sha256":"e97510d9597ca6c0"}},{"arxiv_id":"2401.17523","arxiv_id_is_arxiv":true,"paper":"/paper/game-theoretic-unlearnable-example-generator","title":"Game-Theoretic Unlearnable Example Generator","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hong-xian/gue","path":"gue.py","file_url":"https://github.com/hong-xian/gue/blob/HEAD/gue.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, hong-xian/gue when it was checked","code_sha256":"f38767d36eae77a4","code_sha256_prefix":"f38767d36eae77a4","mcp_get_code":{"code_sha256":"f38767d36eae77a4"}},{"arxiv_id":"2308.03306","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoji-fu/dignn","path":"graphclassification/src/functions.py","file_url":"https://github.com/guoji-fu/dignn/blob/HEAD/graphclassification/src/functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c20d2ddb8b92d0c","code_sha256_prefix":"0c20d2ddb8b92d0c","mcp_get_code":{"code_sha256":"0c20d2ddb8b92d0c"}},{"arxiv_id":"2308.03306","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoji-fu/dignn","path":"nodeclassification/baselines.py","file_url":"https://github.com/guoji-fu/dignn/blob/HEAD/nodeclassification/baselines.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"66811722ba344c40","code_sha256_prefix":"66811722ba344c40","mcp_get_code":{"code_sha256":"66811722ba344c40"}},{"arxiv_id":"2307.07410","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-regularization-in-ai-meets","title":"Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johanwind/which_l1_minimizer","path":"figure3.py","file_url":"https://github.com/johanwind/which_l1_minimizer/blob/HEAD/figure3.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, johanwind/which_l1_minimizer when it was checked","code_sha256":"3b284356f931d31d","code_sha256_prefix":"3b284356f931d31d","mcp_get_code":{"code_sha256":"3b284356f931d31d"}},{"arxiv_id":"2306.03819","arxiv_id_is_arxiv":true,"paper":"/paper/leace-perfect-linear-concept-erasure-in","title":"LEACE: Perfect linear concept erasure in closed form","date":"2023-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleutherai/concept-erasure","path":"experiments/fleace.py","file_url":"https://github.com/eleutherai/concept-erasure/blob/HEAD/experiments/fleace.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"203f94a4b5a85512","code_sha256_prefix":"203f94a4b5a85512","mcp_get_code":{"code_sha256":"203f94a4b5a85512"}},{"arxiv_id":"2302.05185","arxiv_id_is_arxiv":true,"paper":"/paper/on-penalty-based-bilevel-gradient-descent","title":"On Penalty-based Bilevel Gradient Descent Method","date":"2023-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanshen95/penalized-bilevel-gradient-descent","path":"V-PBGD/toy/toy.py","file_url":"https://github.com/hanshen95/penalized-bilevel-gradient-descent/blob/HEAD/V-PBGD/toy/toy.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hanshen95/penalized-bilevel-gradient-descent when it was checked","code_sha256":"aaae9088694d9425","code_sha256_prefix":"aaae9088694d9425","mcp_get_code":{"code_sha256":"aaae9088694d9425"}},{"arxiv_id":"2301.03580","arxiv_id_is_arxiv":true,"paper":"/paper/designing-bert-for-convolutional-networks","title":"Designing BERT for Convolutional Networks: Sparse and Hierarchical Masked Modeling","date":"2023-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Factral/UnMix-NeRF","path":"unmixnerf/utils/spec_to_rgb.py","file_url":"https://github.com/Factral/UnMix-NeRF/blob/HEAD/unmixnerf/utils/spec_to_rgb.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"558f6d7e47654006","code_sha256_prefix":"558f6d7e47654006","mcp_get_code":{"code_sha256":"558f6d7e47654006"}},{"arxiv_id":"2211.11592","arxiv_id_is_arxiv":true,"paper":"/paper/guided-depth-super-resolution-by-deep","title":"Guided Depth Super-Resolution by Deep Anisotropic Diffusion","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prs-eth/diffusion-super-resolution","path":"model/simple_diffusion.py","file_url":"https://github.com/prs-eth/diffusion-super-resolution/blob/HEAD/model/simple_diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"55afd035478386fe","code_sha256_prefix":"55afd035478386fe","mcp_get_code":{"code_sha256":"55afd035478386fe"}},{"arxiv_id":"2209.13104","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-network-approach-for-stochastic","title":"A Neural Network Approach for Stochastic Optimal Control","date":null,"month_inferred_from_arxiv_id":"2022-09","title_source":"archive","repo":"emorymlip/fbsnns","path":"HamiltonJacobiBellman100D.py","file_url":"https://github.com/emorymlip/fbsnns/blob/HEAD/HamiltonJacobiBellman100D.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d25c6435028dd30c","code_sha256_prefix":"d25c6435028dd30c","mcp_get_code":{"code_sha256":"d25c6435028dd30c"}},{"arxiv_id":"2202.10720","arxiv_id_is_arxiv":true,"paper":"/paper/eignn-efficient-infinite-depth-graph-neural-1","title":"EIGNN: Efficient Infinite-Depth Graph Neural Networks","date":"2022-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liu-jc/eignn","path":"models_chains.py","file_url":"https://github.com/liu-jc/eignn/blob/HEAD/models_chains.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"367057a642c441a6","code_sha256_prefix":"367057a642c441a6","mcp_get_code":{"code_sha256":"367057a642c441a6"}},{"arxiv_id":"2104.13897","arxiv_id_is_arxiv":true,"paper":"/paper/inpainting-transformer-for-anomaly-detection","title":"Inpainting Transformer for Anomaly Detection","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhy12/inpainting-transformer","path":"model.py","file_url":"https://github.com/jhy12/inpainting-transformer/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhy12/inpainting-transformer when it was checked","code_sha256":"fd379ae04177d538","code_sha256_prefix":"fd379ae04177d538","mcp_get_code":{"code_sha256":"fd379ae04177d538"}},{"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":"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":"fda8bd2922b285ac","code_sha256_prefix":"fda8bd2922b285ac","mcp_get_code":{"code_sha256":"fda8bd2922b285ac"}},{"arxiv_id":"1711.05101","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-weight-decay-regularization","title":"Decoupled Weight Decay Regularization","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"txping/AEGD","path":"kmeans.py","file_url":"https://github.com/txping/AEGD/blob/HEAD/kmeans.py","status":"ran","verification_level":1,"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":"f20b24ac49219c59","code_sha256_prefix":"f20b24ac49219c59","mcp_get_code":{"code_sha256":"f20b24ac49219c59"}},{"arxiv_id":"1708.07469","arxiv_id_is_arxiv":true,"paper":"/paper/dgm-a-deep-learning-algorithm-for-solving","title":"DGM: A deep learning algorithm for solving partial differential equations","date":"2017-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Plemeur/DGM","path":"burger.py","file_url":"https://github.com/Plemeur/DGM/blob/HEAD/burger.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Plemeur/DGM when it was checked","code_sha256":"217aabe5ff223b11","code_sha256_prefix":"217aabe5ff223b11","mcp_get_code":{"code_sha256":"217aabe5ff223b11"}}],"record_sha256":"0cc2061f398eb767abc104951c27145e44c078be70cd3973a7d11fa83883c77b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}