{"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/compute-gradient","entry":"compute_gradient","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":10,"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":8,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"unverified":5},"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":"2401.11627","paper":"/paper/tight-verification-of-probabilistic","title":"Tight Verification of Probabilistic Robustness in Bayesian Neural Networks","date":"2024-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","path":"verifier/ProbabilisticReachability.py","file_url":"https://github.com/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs/blob/HEAD/verifier/ProbabilisticReachability.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aeeb7adef366d7ae","mcp_get_code":{"code_sha256":"aeeb7adef366d7ae"}},{"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":"0b1f3fb0f715e6b0","mcp_get_code":{"code_sha256":"0b1f3fb0f715e6b0"}},{"arxiv_id":"2205.02825","paper":"/paper/dual-octree-graph-networks-for-learning","title":"Dual Octree Graph Networks for Learning Adaptive Volumetric Shape Representations","date":"2022-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/DualOctreeGNN","path":"losses/loss.py","file_url":"https://github.com/microsoft/DualOctreeGNN/blob/HEAD/losses/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8bab4cb370eaee15","mcp_get_code":{"code_sha256":"8bab4cb370eaee15"}},{"arxiv_id":"2111.15557","paper":"/paper/low-light-image-enhancement-via-breaking-down","title":"Low-light Image Enhancement via Breaking Down the Darkness","date":"2021-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingcv/bread","path":"train_IAN.py","file_url":"https://github.com/mingcv/bread/blob/HEAD/train_IAN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"91bda7c651d2e3f7","mcp_get_code":{"code_sha256":"91bda7c651d2e3f7"}},{"arxiv_id":"2110.10546","paper":"/paper/trash-or-treasure-an-interactive-dual-stream","title":"Trash or Treasure? An Interactive Dual-Stream Strategy for Single Image Reflection Separation","date":"2021-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingcv/ytmt-strategy","path":"models/losses.py","file_url":"https://github.com/mingcv/ytmt-strategy/blob/HEAD/models/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"91bda7c651d2e3f7","mcp_get_code":{"code_sha256":"91bda7c651d2e3f7"}},{"arxiv_id":"2105.13889","paper":"/paper/equilibrium-and-non-equilibrium-regimes-in","title":"Equilibrium and non-Equilibrium regimes in the learning of Restricted Boltzmann Machines","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AurelienDecelle/TorchRBM","path":"rbm/binary/grad.py","file_url":"https://github.com/AurelienDecelle/TorchRBM/blob/HEAD/rbm/binary/grad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c0b3558a3e52f2f","mcp_get_code":{"code_sha256":"7c0b3558a3e52f2f"}},{"arxiv_id":"2006.04725","paper":"/paper/biomechanics-informed-neural-networks-for","title":"Biomechanics-informed Neural Networks for Myocardial Motion Tracking in MRI","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cq615/Biomechanics-informed-motion-tracking","path":"util.py","file_url":"https://github.com/cq615/Biomechanics-informed-motion-tracking/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1befef6a70f3c781","mcp_get_code":{"code_sha256":"1befef6a70f3c781"}},{"arxiv_id":"1906.08473","paper":"/paper/data-cleansing-for-models-trained-with-sgd","title":"Data Cleansing for Models Trained with SGD","date":"2019-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sato9hara/sgd-influence","path":"experiment/Sec71/infl.py","file_url":"https://github.com/sato9hara/sgd-influence/blob/HEAD/experiment/Sec71/infl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fa341f421a2f0ceb","mcp_get_code":{"code_sha256":"fa341f421a2f0ceb"}},{"arxiv_id":"1904.00637","paper":"/paper/single-image-reflection-removal-exploiting","title":"Single Image Reflection Removal Exploiting Misaligned Training Data and Network Enhancements","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vandermode/ERRNet","path":"models/losses.py","file_url":"https://github.com/Vandermode/ERRNet/blob/HEAD/models/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"91bda7c651d2e3f7","mcp_get_code":{"code_sha256":"91bda7c651d2e3f7"}},{"arxiv_id":"1703.01365","paper":"/paper/axiomatic-attribution-for-deep-networks","title":"Axiomatic Attribution for Deep Networks","date":"2017-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jankrepl/mildlyoverfitted","path":"mini_tutorials/gradient_wrt_input/explain.py","file_url":"https://github.com/jankrepl/mildlyoverfitted/blob/HEAD/mini_tutorials/gradient_wrt_input/explain.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0ed09db5a4a023e1","mcp_get_code":{"code_sha256":"0ed09db5a4a023e1"}}]}