{"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/explainer","entry":"Explainer","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":6,"n_papers_ran_instrument_only":0,"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":5,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":3,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"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":"2508.07117","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-07117","title":"From Nodes to Narratives: Explaining Graph Neural Networks with LLMs and Graph Context","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"pbaghershahi/GSPELL","path":"TAGE/tagexplainer.py","file_url":"https://github.com/pbaghershahi/GSPELL/blob/HEAD/TAGE/tagexplainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c9d899319827f4ce","code_sha256_prefix":"c9d899319827f4ce","mcp_get_code":{"code_sha256":"c9d899319827f4ce"}},{"arxiv_id":"2310.19321","arxiv_id_is_arxiv":true,"paper":"/paper/d4explainer-in-distribution-gnn-explanations","title":"D4Explainer: In-Distribution GNN Explanations via Discrete Denoising Diffusion","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-and-geometric-learning/d4explainer","path":"explainers/diff_explainer.py","file_url":"https://github.com/graph-and-geometric-learning/d4explainer/blob/HEAD/explainers/diff_explainer.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":"4e59a98458bb3be0","code_sha256_prefix":"4e59a98458bb3be0","mcp_get_code":{"code_sha256":"4e59a98458bb3be0"}},{"arxiv_id":"2302.10289","arxiv_id_is_arxiv":true,"paper":"/paper/route-interpret-repeat-blurring-the-line","title":"Tackling Shortcut Learning in Deep Neural Networks: An Iterative Approach with Interpretable Models","date":"2023-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"batmanlab/ICML-2023-Route-interpret-repeat","path":"src/codebase/Explainer/models/Gated_Logic_Net.py","file_url":"https://github.com/batmanlab/ICML-2023-Route-interpret-repeat/blob/HEAD/src/codebase/Explainer/models/Gated_Logic_Net.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":"1811ff5c9672a4f8","code_sha256_prefix":"1811ff5c9672a4f8","mcp_get_code":{"code_sha256":"1811ff5c9672a4f8"}},{"arxiv_id":"2207.10285","arxiv_id_is_arxiv":true,"paper":"/paper/grounding-visual-representations-with-texts","title":"Grounding Visual Representations with Texts for Domain Generalization","date":"2022-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mswzeus/GVRT","path":"src/algorithms.py","file_url":"https://github.com/mswzeus/GVRT/blob/HEAD/src/algorithms.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, mswzeus/GVRT when it was checked","code_sha256":"86b1bebccd3af0d9","code_sha256_prefix":"86b1bebccd3af0d9","mcp_get_code":{"code_sha256":"86b1bebccd3af0d9"}},{"arxiv_id":"2106.06528","arxiv_id_is_arxiv":true,"paper":"/paper/local-explanation-of-dialogue-response","title":"Local Explanation of Dialogue Response Generation","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Pascalson/LERG","path":"lerg/RG_explainers.py","file_url":"https://github.com/Pascalson/LERG/blob/HEAD/lerg/RG_explainers.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":"68455dbef5068171","code_sha256_prefix":"68455dbef5068171","mcp_get_code":{"code_sha256":"68455dbef5068171"}},{"arxiv_id":"2104.12437","arxiv_id_is_arxiv":true,"paper":"/paper/towards-rigorous-interpretations-a","title":"Towards Rigorous Interpretations: a Formalisation of Feature Attribution","date":"2021-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deezer/functional_attribution","path":"methods.py","file_url":"https://github.com/deezer/functional_attribution/blob/HEAD/methods.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, deezer/functional_attribution when it was checked","code_sha256":"f694313af6e1b67f","code_sha256_prefix":"f694313af6e1b67f","mcp_get_code":{"code_sha256":"f694313af6e1b67f"}},{"arxiv_id":"2011.04573","arxiv_id_is_arxiv":true,"paper":"/paper/parameterized-explainer-for-graph-neural","title":"Parameterized Explainer for Graph Neural Network","date":"2020-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flyingdoog/PGExplainer","path":"codes/forgraph/Explainer.py","file_url":"https://github.com/flyingdoog/PGExplainer/blob/HEAD/codes/forgraph/Explainer.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, flyingdoog/PGExplainer when it was checked","code_sha256":"8a01a842b30f5c44","code_sha256_prefix":"8a01a842b30f5c44","mcp_get_code":{"code_sha256":"8a01a842b30f5c44"}},{"arxiv_id":"1704.02685","arxiv_id_is_arxiv":true,"paper":"/paper/learning-important-features-through","title":"Learning Important Features Through Propagating Activation Differences","date":"2017-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaoshanglqy/shap-shapley","path":"shap/explainers/deep/deep_tf.py","file_url":"https://github.com/shaoshanglqy/shap-shapley/blob/HEAD/shap/explainers/deep/deep_tf.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":"6cddc3a37d231206","code_sha256_prefix":"6cddc3a37d231206","mcp_get_code":{"code_sha256":"6cddc3a37d231206"}},{"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":"suinleelab/path_explain","path":"path_explain/explainers/path_explainer_tf.py","file_url":"https://github.com/suinleelab/path_explain/blob/HEAD/path_explain/explainers/path_explainer_tf.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":"543fdd3d86e7ad28","code_sha256_prefix":"543fdd3d86e7ad28","mcp_get_code":{"code_sha256":"543fdd3d86e7ad28"}}],"record_sha256":"6938633da45193dcf3d312c9386470ef1c5ff59bd05c0ec31a2ace47eb1d413f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}