{"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/jacobian","entry":"jacobian","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":21,"n_papers_ran":9,"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":21,"n_samples_ran":9,"n_samples_fingerprinted":1,"n_places":21,"n_places_pointer_only":7,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":7,"unverified":12},"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":"2604.08192","paper":"/paper/arxiv-2604-08192","title":"Inside-Out: Measuring Generalization in Vision Transformers Through Inner Workings","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"deep-real/GenCircuit","path":"model_zoo/coupling_jacobian.py","file_url":"https://github.com/deep-real/GenCircuit/blob/HEAD/model_zoo/coupling_jacobian.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9f7585ff134e843d","mcp_get_code":{"code_sha256":"9f7585ff134e843d"}},{"arxiv_id":"2410.11061","paper":"/paper/learning-to-optimize-for-mixed-integer-non","title":"Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pnnl/neuromancer","path":"src/neuromancer/gradients.py","file_url":"https://github.com/pnnl/neuromancer/blob/HEAD/src/neuromancer/gradients.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"a59076d06397e905","mcp_get_code":{"code_sha256":"a59076d06397e905"}},{"arxiv_id":"2403.19332","paper":"/paper/learning-a-formally-verified-control-barrier","title":"Learning a Formally Verified Control Barrier Function in Stochastic Environment","date":null,"month_inferred_from_arxiv_id":"2024-03","title_source":"archive","repo":"tayalmanan28/Stochastic-NCBF","path":"deep_differential_network/utils.py","file_url":"https://github.com/tayalmanan28/Stochastic-NCBF/blob/HEAD/deep_differential_network/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9b3e75f7e217f0ac","mcp_get_code":{"code_sha256":"9b3e75f7e217f0ac"}},{"arxiv_id":"2311.17283","paper":"/paper/lineax-unified-linear-solves-and-linear-least","title":"Lineax: unified linear solves and linear least-squares in JAX and Equinox","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"google/lineax","path":"lineax/_misc.py","file_url":"https://github.com/google/lineax/blob/HEAD/lineax/_misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c30590f204af2200","mcp_get_code":{"code_sha256":"c30590f204af2200"}},{"arxiv_id":"2309.16585","paper":"/paper/text-to-3d-using-gaussian-splatting","title":"Text-to-3D using Gaussian Splatting","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsgen3d/gsgen","path":"gs/renderer.py","file_url":"https://github.com/gsgen3d/gsgen/blob/HEAD/gs/renderer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"da4758eff656aed9","mcp_get_code":{"code_sha256":"da4758eff656aed9"}},{"arxiv_id":"2309.08596","paper":"/paper/robust-e-nerf-nerf-from-sparse-noisy-events","title":"Robust e-NeRF: NeRF from Sparse & Noisy Events under Non-Uniform Motion","date":"2023-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengflow/robust-e-nerf","path":"robust_e_nerf/utils/autograd.py","file_url":"https://github.com/wengflow/robust-e-nerf/blob/HEAD/robust_e_nerf/utils/autograd.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a1d70d36f5e8e59a","mcp_get_code":{"code_sha256":"a1d70d36f5e8e59a"}},{"arxiv_id":"2308.09419","paper":"/paper/attention-calibration-for-transformer-based","title":"Attention Calibration for Transformer-based Sequential Recommendation","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aim-se/ac-tsr","path":"recbole/model/layers.py","file_url":"https://github.com/aim-se/ac-tsr/blob/HEAD/recbole/model/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7bc8ebe3b03dc38e","mcp_get_code":{"code_sha256":"7bc8ebe3b03dc38e"}},{"arxiv_id":"2307.15496","paper":"/paper/from-continuous-time-formulations-to","title":"From continuous-time formulations to discretization schemes: tensor trains and robust regression for BSDEs and parabolic PDEs","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorenzrichter/PDE-backward-solver","path":"pytorch_future.py","file_url":"https://github.com/lorenzrichter/PDE-backward-solver/blob/HEAD/pytorch_future.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"19a7f81142830188","mcp_get_code":{"code_sha256":"19a7f81142830188"}},{"arxiv_id":"2306.08827","paper":"/paper/pinnacle-a-comprehensive-benchmark-of-physics","title":"PINNacle: A Comprehensive Benchmark of Physics-Informed Neural Networks for Solving PDEs","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"i207m/pinnacle","path":"deepxde/gradients.py","file_url":"https://github.com/i207m/pinnacle/blob/HEAD/deepxde/gradients.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"22a4e56acdba95d0","mcp_get_code":{"code_sha256":"22a4e56acdba95d0"}},{"arxiv_id":"2304.13426","paper":"/paper/flex-an-adaptive-exploration-algorithm-for","title":"FLEX: an Adaptive Exploration Algorithm for Nonlinear Systems","date":"2023-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mb-29/exploration","path":"policies.py","file_url":"https://github.com/mb-29/exploration/blob/HEAD/policies.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"21db7871139de360","mcp_get_code":{"code_sha256":"21db7871139de360"}},{"arxiv_id":"2108.03225","paper":"/paper/glass-geometric-latent-augmentation-for-shape","title":"GLASS: Geometric Latent Augmentation for Shape Spaces","date":"2021-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjeevmk/glass","path":"Src/Energies.py","file_url":"https://github.com/sanjeevmk/glass/blob/HEAD/Src/Energies.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5818ed260316d201","mcp_get_code":{"code_sha256":"5818ed260316d201"}},{"arxiv_id":"2106.08748","paper":"/paper/input-invex-neural-network","title":"Input Invex Neural Network","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsumansapkota/Input-Invex-Neural-Network","path":"nflib/res_flow.py","file_url":"https://github.com/tsumansapkota/Input-Invex-Neural-Network/blob/HEAD/nflib/res_flow.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":"7bfb70b8bf7c94bb","mcp_get_code":{"code_sha256":"7bfb70b8bf7c94bb"}},{"arxiv_id":"2104.14672","paper":"/paper/analytical-bounds-on-the-local-lipschitz-1","title":"Analytical bounds on the local Lipschitz constants of ReLU networks","date":"2021-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uwaa-ndcl/local_lipschitz","path":"other_methods/lipestimation/lipschitz_utils.py","file_url":"https://github.com/uwaa-ndcl/local_lipschitz/blob/HEAD/other_methods/lipestimation/lipschitz_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b9f49cd279dbfa1","mcp_get_code":{"code_sha256":"8b9f49cd279dbfa1"}},{"arxiv_id":"2104.03413","paper":"/paper/rethinking-the-backdoor-attacks-triggers-a","title":"Rethinking the Backdoor Attacks' Triggers: A Frequency Perspective","date":"2021-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YiZeng623/frequency-backdoor","path":"Sec5_Smooth_Trigger/target_universal.py","file_url":"https://github.com/YiZeng623/frequency-backdoor/blob/HEAD/Sec5_Smooth_Trigger/target_universal.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dfb6883fc6ed9988","mcp_get_code":{"code_sha256":"dfb6883fc6ed9988"}},{"arxiv_id":"1912.03263","paper":"/paper/your-classifier-is-secretly-an-energy-based-1","title":"Your Classifier is Secretly an Energy Based Model and You Should Treat it Like One","date":"2019-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tohmae/pytorch-jem","path":"jem.py","file_url":"https://github.com/tohmae/pytorch-jem/blob/HEAD/jem.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b689087804867dc7","mcp_get_code":{"code_sha256":"b689087804867dc7"}},{"arxiv_id":"1908.10507","paper":"/paper/forward-mode-differentiation-of-maxwells","title":"Forward-Mode Differentiation of Maxwell's Equations","date":null,"month_inferred_from_arxiv_id":"2019-08","title_source":"archive","repo":"twhughes/ceviche","path":"ceviche/jacobians.py","file_url":"https://github.com/twhughes/ceviche/blob/HEAD/ceviche/jacobians.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f1957dddb0eee8e5","mcp_get_code":{"code_sha256":"f1957dddb0eee8e5"}},{"arxiv_id":"1907.05600","paper":"/paper/generative-modeling-by-estimating-gradients","title":"Generative Modeling by Estimating Gradients of the Data Distribution","date":"2019-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbordyuh/score_matching","path":"model.py","file_url":"https://github.com/mbordyuh/score_matching/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1a2134b893169239","mcp_get_code":{"code_sha256":"1a2134b893169239"}},{"arxiv_id":"1905.10479","paper":"/paper/robust-learning-with-implicit-residual","title":"Robust learning with implicit residual networks","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vreshniak/ImplicitResNet","path":"implicitresnet/utils/calc.py","file_url":"https://github.com/vreshniak/ImplicitResNet/blob/HEAD/implicitresnet/utils/calc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7a6d6d6cca1218a1","mcp_get_code":{"code_sha256":"7a6d6d6cca1218a1"}},{"arxiv_id":"1905.07822","paper":"/paper/minimal-achievable-sufficient-statistic","title":"Minimal Achievable Sufficient Statistic Learning","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mwcvitkovic/MASS-Learning","path":"models/utils.py","file_url":"https://github.com/mwcvitkovic/MASS-Learning/blob/HEAD/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6fde888667ab7a35","mcp_get_code":{"code_sha256":"6fde888667ab7a35"}},{"arxiv_id":"1703.04730","paper":"/paper/understanding-black-box-predictions-via","title":"Understanding Black-box Predictions via Influence Functions","date":"2017-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sillwood/voicemos","path":"swag/posteriors/laplace.py","file_url":"https://github.com/sillwood/voicemos/blob/HEAD/swag/posteriors/laplace.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"365de65d02067f52","mcp_get_code":{"code_sha256":"365de65d02067f52"}},{"arxiv_id":"1602.02068","paper":"/paper/from-softmax-to-sparsemax-a-sparse-model-of","title":"From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification","date":"2016-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AndreasMadsen/course-02456-sparsemax","path":"tensorflow_python/sparsemax.py","file_url":"https://github.com/AndreasMadsen/course-02456-sparsemax/blob/HEAD/tensorflow_python/sparsemax.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6503187ed9b4502e","mcp_get_code":{"code_sha256":"6503187ed9b4502e"}}]}