{"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/compute-gradients","entry":"compute_gradients","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":9,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":4,"unverified":3},"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":"2606.20443","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20443","title":"Topological Data Analysis for High-Dimensional Dynamic Process Monitoring","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"zavalab/ML","path":"Asthma/src/saliency.py","file_url":"https://github.com/zavalab/ML/blob/HEAD/Asthma/src/saliency.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, zavalab/ML when it was checked","code_sha256":"94132dc246945836","code_sha256_prefix":"94132dc246945836","mcp_get_code":{"code_sha256":"94132dc246945836"}},{"arxiv_id":"2601.19042","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-19042","title":"NC-REG: Neural Cortical Maps for Rigid Registration","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"NVlabs/tiny-cuda-nn","path":"benchmarks/image/bench_tensorflow.py","file_url":"https://github.com/NVlabs/tiny-cuda-nn/blob/HEAD/benchmarks/image/bench_tensorflow.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, NVlabs/tiny-cuda-nn (NOASSERTION)","code_sha256":"8c33dd40242464ec","code_sha256_prefix":"8c33dd40242464ec","mcp_get_code":{"code_sha256":"8c33dd40242464ec"}},{"arxiv_id":"2410.12409","arxiv_id_is_arxiv":true,"paper":"/paper/revealing-the-barriers-of-language-agents-in","title":"Revealing the Barriers of Language Agents in Planning","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsaest/Agent-Planning-Analysis","path":"code/captum/captum/_utils/gradient.py","file_url":"https://github.com/hsaest/Agent-Planning-Analysis/blob/HEAD/code/captum/captum/_utils/gradient.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, hsaest/Agent-Planning-Analysis when it was checked","code_sha256":"3102f2fd6c8bff3d","code_sha256_prefix":"3102f2fd6c8bff3d","mcp_get_code":{"code_sha256":"3102f2fd6c8bff3d"}},{"arxiv_id":"2410.08107","arxiv_id_is_arxiv":true,"paper":"/paper/inceventgs-pose-free-gaussian-splatting-from","title":"IncEventGS: Pose-Free Gaussian Splatting from a Single Event Camera","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wu-cvgl/inceventgs","path":"tikhonov_regularizor.py","file_url":"https://github.com/wu-cvgl/inceventgs/blob/HEAD/tikhonov_regularizor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, wu-cvgl/inceventgs when it was checked","code_sha256":"e9df74b8b772c7cb","code_sha256_prefix":"e9df74b8b772c7cb","mcp_get_code":{"code_sha256":"e9df74b8b772c7cb"}},{"arxiv_id":"2305.19765","arxiv_id_is_arxiv":true,"paper":"/paper/a-bayesian-approach-to-analysing-training-1","title":"A Bayesian Approach To Analysing Training Data Attribution In Deep Learning","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elisanguyen/bayesian-tda","path":"nn_influence_utils.py","file_url":"https://github.com/elisanguyen/bayesian-tda/blob/HEAD/nn_influence_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":"6178188047b6f48c","code_sha256_prefix":"6178188047b6f48c","mcp_get_code":{"code_sha256":"6178188047b6f48c"}},{"arxiv_id":"2305.19765","arxiv_id_is_arxiv":true,"paper":"/paper/a-bayesian-approach-to-analysing-training-1","title":"A Bayesian Approach To Analysing Training Data Attribution In Deep Learning","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elisanguyen/bayesian-tda","path":"nn_influence_utils_vit.py","file_url":"https://github.com/elisanguyen/bayesian-tda/blob/HEAD/nn_influence_utils_vit.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":"f425d7b1bc9d8812","code_sha256_prefix":"f425d7b1bc9d8812","mcp_get_code":{"code_sha256":"f425d7b1bc9d8812"}},{"arxiv_id":"2304.11327","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-feature-learning-1","title":"Understanding and Improving Feature Learning for Out-of-Distribution Generalization","date":"2023-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/captum","path":"captum/_utils/gradient.py","file_url":"https://github.com/pytorch/captum/blob/HEAD/captum/_utils/gradient.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from hsaest/Agent-Planning-Analysis, and GitHub detected no licence in that repository when it was checked","code_sha256":"3102f2fd6c8bff3d","code_sha256_prefix":"3102f2fd6c8bff3d","mcp_get_code":{"code_sha256":"3102f2fd6c8bff3d"}},{"arxiv_id":"2111.02813","arxiv_id_is_arxiv":true,"paper":"/paper/wavefake-a-data-set-to-facilitate-audio","title":"WaveFake: A Data Set to Facilitate Audio Deepfake Detection","date":"2021-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rub-syssec/wavefake","path":"dfadetect/attribution.py","file_url":"https://github.com/rub-syssec/wavefake/blob/HEAD/dfadetect/attribution.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":"055ad46b81aadbc9","code_sha256_prefix":"055ad46b81aadbc9","mcp_get_code":{"code_sha256":"055ad46b81aadbc9"}},{"arxiv_id":"2010.12697","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-saturation-effects-in","title":"Investigating Saturation Effects in Integrated Gradients","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vivekmig/captum-1","path":"captum/_utils/gradient.py","file_url":"https://github.com/vivekmig/captum-1/blob/HEAD/captum/_utils/gradient.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":"acf80a93a1ed2373","code_sha256_prefix":"acf80a93a1ed2373","mcp_get_code":{"code_sha256":"acf80a93a1ed2373"}},{"arxiv_id":"1703.01365","arxiv_id_is_arxiv":true,"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":"andresbecker/master_thesis","path":"workspace/libs/NN_interpretability.py","file_url":"https://github.com/andresbecker/master_thesis/blob/HEAD/workspace/libs/NN_interpretability.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"911004b0e426d584","code_sha256_prefix":"911004b0e426d584","mcp_get_code":{"code_sha256":"911004b0e426d584"}}],"record_sha256":"28e2d854292e29e369cf0a02f22da72e449615e0b30512427b1bc2dd140afece","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}