{"as_of":"2026-08-08T04:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:51f78ab6e2bfa6b06127d65b209abb0c8f3626b5a88ef3c06a7b7f29d43273db","coverage":[{"denominator":76,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":76,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T20:29:44.431074Z","state":"measured"},{"denominator":76,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":76,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.10490/citation-record","integrity":"/paper/2508.10490/integrity","json":"/paper/2508.10490/citation-record.json","paper":"/paper/2508.10490"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.03292","last_updated":"2020-11-06T13:40:14Z","snapshot_observed_at":"2026-07-06T07:06:35.439966Z","submitted_at":"2018-10-08T07:27:11Z","title":"Sanity Checks for Saliency Maps","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.03292","snapshot_observed_at":"2026-08-05T20:29:37.376360Z","title":"Sanity Checks for Saliency Maps, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.376360Z"},"links":{"cited_paper":"/paper/1810.03292","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:2fafedc7b512fc67d6c5ea031b675de0ed0c64601a2ef9e22519a48f81ecc967","observation_id":"5bab8da9-869e-4495-8316-57226c7a6c90","resolution":{"observed_at":"2026-08-05T20:29:37.376360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:53.854376Z","title":null,"venue":null,"work_id":"5fc32d61-486e-4aa1-98c2-9ddf6a08a458","year":2013},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.427048Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:96e25b9037808f78e6640b323a622c2a40601ffedc60379a8d2f91eeef043779","observation_id":"4346e2a0-ac79-4dbd-86b5-bf17f2b315aa","resolution":{"observed_at":"2026-08-05T20:29:53.979235Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:53.627075Z","title":"On Pixel-Wise Explanations for Non-Linear Classi- fier Decisions by Layer-Wise Relevance Propagation","venue":null,"work_id":"18d5a38d-5787-4d1a-976a-e2fc79753001","year":2015},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.517949Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:e861ef5b594a95eff7f7f04602c6cc742b2b14965100585bdb8f313fa8d09692","observation_id":"dae6320f-1399-458a-a861-da6a29ca3c41","resolution":{"observed_at":"2026-08-05T20:29:53.735005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.08591","last_updated":"2018-06-06T10:08:21Z","snapshot_observed_at":"2026-07-06T05:31:40.572534Z","submitted_at":"2017-02-28T01:06:13Z","title":"The Shattered Gradients Problem: If resnets are the answer, then what is the question?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.08591","snapshot_observed_at":"2026-08-05T20:29:37.576210Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.576210Z"},"links":{"cited_paper":"/paper/1702.08591","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:ea3a8e9f0c9452d9910a8a0e24d65b157ea50ed8c341ab469eb23afa67a41c14","observation_id":"5a19f484-2fce-4fc4-be29-552fc408b9bc","resolution":{"observed_at":"2026-08-05T20:29:37.576210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05271","last_updated":"2024-11-17T22:18:40Z","snapshot_observed_at":"2026-07-06T17:27:07.519191Z","submitted_at":"2024-02-07T21:31:53Z","title":"Feature learning as alignment: a structural property of gradient descent in non-linear neural networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05271","snapshot_observed_at":"2026-08-05T20:29:37.635294Z","title":"Feature learning as alignment: a structural prop- erty of gradient descent in non-linear neural networks, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.635294Z"},"links":{"cited_paper":"/paper/2402.05271","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:ffbef749e75773bb737fba63a54fb099c058b126ab6c07bdee83265df71dc7ff","observation_id":"e52ca1e5-c03b-4f84-b573-d5c1b4b75ee1","resolution":{"observed_at":"2026-08-05T20:29:37.635294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:53.392023Z","title":null,"venue":null,"work_id":"4f02c576-74c1-4ebf-bf8b-7b96f516517a","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.708753Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:593c2fd9aaf701f3c756831e039cd67e2f28f968564c5826dbd95e19f6105445","observation_id":"c3d282a6-74a6-415c-b5a7-36860981cc0b","resolution":{"observed_at":"2026-08-05T20:29:53.510755Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.14397","last_updated":"2021-08-26T15:49:40Z","snapshot_observed_at":"2026-08-07T06:14:21.866222Z","submitted_at":"2020-09-30T02:37:43Z","title":"Deep Equals Shallow for ReLU Networks in Kernel Regimes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.14397","snapshot_observed_at":"2026-08-05T20:29:37.894302Z","title":"Deep Equals Shal- low for ReLU Networks in Kernel Regimes, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.894302Z"},"links":{"cited_paper":"/paper/2009.14397","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:a492464ea9ffbf6a21c542d452315cc3bb32ff4b21e27127fe1afbc8ca7116ab","observation_id":"d6d4b894-b638-4de7-91b4-8ba4b20c4f05","resolution":{"observed_at":"2026-08-05T20:29:37.894302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12173","last_updated":"2019-10-31T14:38:51Z","snapshot_observed_at":"2026-08-05T03:57:38.412174Z","submitted_at":"2019-05-29T01:49:32Z","title":"On the Inductive Bias of Neural Tangent Kernels","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12173","snapshot_observed_at":"2026-08-05T20:29:37.983316Z","title":"On the Inductive Bias of Neural Tangent Kernels, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.983316Z"},"links":{"cited_paper":"/paper/1905.12173","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:8e4a362b30fb2503fbcf19a2ab0d9d186daa336a31a92139a3b7d019d63cc100","observation_id":"d9f58487-239f-4d63-a39d-cebd3070b911","resolution":{"observed_at":"2026-08-05T20:29:37.983316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.00825","last_updated":"2016-04-04T11:52:07Z","snapshot_observed_at":"2026-08-01T00:36:40.003240Z","submitted_at":"2016-04-04T11:52:07Z","title":"Layer-wise Relevance Propagation for Neural Networks with Local Renormalization Layers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.00825","snapshot_observed_at":"2026-08-05T20:29:38.047757Z","title":"Layer-wise Rel- evance Propagation for Neural Networks with Local Renor- malization Layers, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.047757Z"},"links":{"cited_paper":"/paper/1604.00825","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:2b353b532465c5e4690b484639d26eae3809ff1b79d9ff39b1626ca836ffa25e","observation_id":"afcc1dbc-9ebc-4517-8109-88c089034291","resolution":{"observed_at":"2026-08-05T20:29:38.047757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.10185","last_updated":"2022-05-30T15:45:41Z","snapshot_observed_at":"2026-08-06T10:58:48.285294Z","submitted_at":"2021-06-18T15:22:33Z","title":"NoiseGrad: Enhancing Explanations by Introducing Stochasticity to Model Weights","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.10185","snapshot_observed_at":"2026-08-05T20:29:38.110133Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.110133Z"},"links":{"cited_paper":"/paper/2106.10185","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:71c96f3972cb3bab02933664c762a761d46741bf387153bcf7ce35f010895589","observation_id":"04ed6bbf-3585-4e0d-adc7-4bc0677bde0f","resolution":{"observed_at":"2026-08-05T20:29:38.110133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:53.214039Z","title":"B-cos Net- works: Alignment is All We Need for Interpretability, 2022","venue":null,"work_id":"2506579c-d975-4ccb-aa0f-7a57f8c2fb1f","year":2022},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.215203Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:1c500d273b47b6393cdfa05105abc7264f0fd8aabed6ed16a69fe5c96c5d2002","observation_id":"99e28795-d7d3-4dee-b891-4bd200251fb9","resolution":{"observed_at":"2026-08-05T20:29:53.299840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17834","last_updated":"2024-07-25T07:45:28Z","snapshot_observed_at":"2026-07-06T18:51:41.167282Z","submitted_at":"2024-07-25T07:45:28Z","title":"Towards the Spectral bias Alleviation by Normalizations in Coordinate Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17834","snapshot_observed_at":"2026-08-05T20:29:38.340044Z","title":"Towards the Spectral bias Alleviation by Normaliza- tions in Coordinate Networks, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.340044Z"},"links":{"cited_paper":"/paper/2407.17834","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:ce109b76328a40404ee87752ed9e432f41a7b7e7dddc8bbefa46b7bff656146b","observation_id":"55be846a-9843-443e-aa79-921f5c9ae41e","resolution":{"observed_at":"2026-08-05T20:29:38.340044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.02065","last_updated":"2019-12-05T13:41:46Z","snapshot_observed_at":"2026-08-03T23:13:38.505215Z","submitted_at":"2019-10-04T17:44:36Z","title":"Can I Trust the Explainer? Verifying Post-hoc Explanatory Methods","version":3},"cited_work":{"arxiv_id":"1910.02065","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.02065","snapshot_observed_at":"2026-08-05T20:29:47.984975Z","title":"Can I Trust the Explainer? Verifying Post-hoc Explanatory Methods","venue":"cs.CL","work_id":"21c6bfb4-4085-4ea0-a0b1-7795951dae73","year":2019},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.428468Z"},"links":{"cited_paper":"/paper/1910.02065","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:f432283fd2d99ebd24fca44e2d6759329d952b2181681d0cb3bbcf92d58742eb","observation_id":"db6eca28-222f-4c4f-b5b2-3fd0db1dc6d7","resolution":{"observed_at":"2026-08-05T20:29:48.100817Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.16234","last_updated":"2020-06-29T17:54:39Z","snapshot_observed_at":"2026-07-06T09:33:44.070039Z","submitted_at":"2020-06-29T17:54:39Z","title":"True to the Model or True to the Data?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.16234","snapshot_observed_at":"2026-08-05T20:29:38.517838Z","title":"Janizek, Scott Lundberg, and Su- In Lee","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.517838Z"},"links":{"cited_paper":"/paper/2006.16234","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:e9f93a0c1ca76d342f296b1f512b4412fc61d37b3d020c2a26e42c6f77688b47","observation_id":"3a7f3015-c22f-4994-b02f-29b51d02f7bf","resolution":{"observed_at":"2026-08-05T20:29:38.517838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.01164","last_updated":"2018-10-20T19:34:49Z","snapshot_observed_at":"2026-07-06T05:49:45.626127Z","submitted_at":"2017-07-04T22:00:58Z","title":"Kernel Feature Selection via Conditional Covariance Minimization","version":2},"cited_work":{"arxiv_id":"1707.01164","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.01164","snapshot_observed_at":"2026-08-05T20:29:47.799414Z","title":"Kernel Feature Selection via Conditional Covariance Minimization","venue":"stat.ML","work_id":"1f84b7f1-77a8-45ee-9a49-2ceea989426b","year":2017},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.572761Z"},"links":{"cited_paper":"/paper/1707.01164","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:dbf69a6923558a4a92a1723f8df676e3b2722e979b1682f82595104fe30c0938","observation_id":"b6702d5b-dbe3-4d52-9f90-c9829280f239","resolution":{"observed_at":"2026-08-05T20:29:47.870773Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:53.016214Z","title":"Explaining by Removing: A Unified Framework for Model Explanation,","venue":null,"work_id":"abf8cbcb-08f8-4c4d-91b8-feee5b76f910","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.648204Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:a312e473172ed96e37ce75d32c0d7b42f20fb22335fd340ddf2b0a3464386c30","observation_id":"c92a5bef-4156-4a4b-94ee-34779a5b8289","resolution":{"observed_at":"2026-08-05T20:29:53.121270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.05897","last_updated":"2017-05-19T18:39:00Z","snapshot_observed_at":"2026-07-06T04:46:37.756402Z","submitted_at":"2016-02-18T18:14:19Z","title":"Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivity","version":2},"cited_work":{"arxiv_id":"1602.05897","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.05897","snapshot_observed_at":"2026-08-05T20:29:47.268077Z","title":"Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivity","venue":"cs.LG","work_id":"f7059077-e882-4336-85ed-ffdca7eb597a","year":2016},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.807259Z"},"links":{"cited_paper":"/paper/1602.05897","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:3e8be0730d49fcaa7db75beb0f0d2904e5540323779ffb0d96b17c13c22ac394","observation_id":"35406629-b48b-477f-b0d2-cd69d6ba918c","resolution":{"observed_at":"2026-08-05T20:29:47.387508Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:52.814717Z","title":"ImageNet: A large-scale hierarchical im- age database","venue":null,"work_id":"9558a32c-9f76-440b-864d-86c6c717ce69","year":2009},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.886839Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:31c0f0fa34f1da11309d9742f1a5fe3121bce8a8d298f116ecbe41986440e95e","observation_id":"ce5511af-743f-4da7-9fc1-9d3f7f00fac2","resolution":{"observed_at":"2026-08-05T20:29:52.904264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:52.584740Z","title":"On the lipschitz constant of deep networks and double de- scent","venue":null,"work_id":"e0e2821c-7cd7-45ee-af1f-72a7d4544ff9","year":2023},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.970440Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:ae59fbb3c30486a05916379c593c0d9d43ed9eb8d8bc0b3d99a13335abee4b27","observation_id":"429ca050-eee2-4cfd-8b29-4a7ef6090eba","resolution":{"observed_at":"2026-08-05T20:29:52.726590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:52.419901Z","title":"On the Similarity between the Laplace and Neural Tangent Kernels, 2020","venue":null,"work_id":"c22b6a3c-93c5-4328-87ca-7da4700d66cf","year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.031169Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:345980e2fbce4b93863d6324890b20208c460fbda6e1ef2f346d05b9337b86c7","observation_id":"688d1402-0977-4065-8651-e2c3df7cd311","resolution":{"observed_at":"2026-08-05T20:29:52.497064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.07169","last_updated":"2018-09-01T08:27:25Z","snapshot_observed_at":"2026-08-04T18:14:31.019953Z","submitted_at":"2018-04-19T13:51:45Z","title":"Large-scale Nonlinear Variable Selection via Kernel Random Features","version":2},"cited_work":{"arxiv_id":"1804.07169","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.07169","snapshot_observed_at":"2026-08-05T20:29:47.077513Z","title":"Large-scale Nonlinear Variable Selection via Kernel Random Features","venue":"cs.LG","work_id":"e86a7330-0dcd-45f5-be70-a4a4ee129d5e","year":2018},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.090304Z"},"links":{"cited_paper":"/paper/1804.07169","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:b76e3a4b2d241cd0a3caafbe5b70d0e16200edb1e6b9962855a96c7316d92f8f","observation_id":"39ecbfd3-9e09-4ad4-b2cd-8b4db70cad67","resolution":{"observed_at":"2026-08-05T20:29:47.140916Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:52.275268Z","title":"Spectral analysis based on signal depen- dent transformation","venue":null,"work_id":"d21d8ecd-f8f4-414a-9fc7-b4e10812ff03","year":2005},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.175807Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:7ced9147d3411eebf94c3009ce4d417a2943bad89364822724748d7a2b97b329","observation_id":"37f6b34a-37df-40e4-bfdf-2b4c06ebe15c","resolution":{"observed_at":"2026-08-05T20:29:52.333511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.01254","last_updated":"2022-12-29T23:44:36Z","snapshot_observed_at":"2026-07-06T13:16:57.787876Z","submitted_at":"2022-06-02T19:09:30Z","title":"Which Explanation Should I Choose? A Function Approximation Perspective to Characterizing Post Hoc Explanations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.01254","snapshot_observed_at":"2026-08-05T20:29:39.258640Z","title":"Which Explanation Should I Choose? A Function Approximation Perspective to Characterizing Post Hoc Explanations, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.258640Z"},"links":{"cited_paper":"/paper/2206.01254","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:c028a613131addf13342159f4d94bb08cdfdbb40c7bb4ab70dc1514c602a2e99","observation_id":"c32fca73-d250-4c17-8d10-06377d2149dc","resolution":{"observed_at":"2026-08-05T20:29:39.258640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.10822","last_updated":"2019-06-26T02:54:26Z","snapshot_observed_at":"2026-07-06T08:02:51.583780Z","submitted_at":"2019-06-26T02:54:26Z","title":"Gradient Noise Convolution (GNC): Smoothing Loss Function for Distributed Large-Batch SGD","version":1},"cited_work":{"arxiv_id":"1906.10822","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.10822","snapshot_observed_at":"2026-08-05T20:29:46.904690Z","title":"Gradient Noise Convolution (GNC): Smoothing Loss Function for Distributed Large-Batch SGD","venue":"cs.LG","work_id":"33b16074-32b9-4fc7-83fc-783646cf98db","year":2019},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.363428Z"},"links":{"cited_paper":"/paper/1906.10822","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:3c0fad2e0d6445a78469d19a66fc2e21be392ebe1b46dea58f4594a38787da97","observation_id":"65a1b2bd-8a53-44b2-90b6-d26aba2ce068","resolution":{"observed_at":"2026-08-05T20:29:46.969064Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1512.03385","last_updated":"2015-12-10T19:51:55Z","snapshot_observed_at":"2026-07-06T04:39:28.429064Z","submitted_at":"2015-12-10T19:51:55Z","title":"Deep Residual Learning for Image Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.03385","snapshot_observed_at":"2026-08-05T20:29:39.441304Z","title":"Deep Residual Learning for Image Recognition, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.441304Z"},"links":{"cited_paper":"/paper/1512.03385","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:8fd937bfa1f23dc6eff0e1022d6fa0e6183d98866c4782f4469584301eee179e","observation_id":"f6f3d60d-fdc1-42e3-a33e-408b77c6d400","resolution":{"observed_at":"2026-08-05T20:29:39.441304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.10758","last_updated":"2019-11-05T02:25:30Z","snapshot_observed_at":"2026-07-06T06:47:15.941628Z","submitted_at":"2018-06-28T03:46:57Z","title":"A Benchmark for Interpretability Methods in Deep Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.10758","snapshot_observed_at":"2026-08-05T20:29:39.545287Z","title":"A Benchmark for Interpretability Methods in Deep Neural Networks, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.545287Z"},"links":{"cited_paper":"/paper/1806.10758","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:07882189163e341ec0208ad6ad78942c734bf1dbe37188efaf88cf820eb1a9b4","observation_id":"14306636-8bac-4328-b088-31ff7f53f951","resolution":{"observed_at":"2026-08-05T20:29:39.545287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:52.050060Z","title":null,"venue":null,"work_id":"a2b51a3b-669b-4742-80a5-adbf336b356e","year":2019},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.630217Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:8fa7a4e1139c80a58e5d4b879e2794c9eeb753d26902c53ee92707f7e5a98f78","observation_id":"30f97779-7461-4441-8121-b2ec88a293a0","resolution":{"observed_at":"2026-08-05T20:29:52.186764Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.07572","last_updated":"2020-02-10T08:39:09Z","snapshot_observed_at":"2026-07-30T19:50:14.167277Z","submitted_at":"2018-06-20T06:35:46Z","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.07572","snapshot_observed_at":"2026-08-05T20:29:39.738274Z","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.738274Z"},"links":{"cited_paper":"/paper/1806.07572","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:849e411e678d692b12cc10cf7058d931d2752324e42dd1aaf30aa03581ab07a4","observation_id":"d2825434-fe74-4342-8f99-9a8cc4cfd15d","resolution":{"observed_at":"2026-08-05T20:29:39.738274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02557","last_updated":"2024-04-12T15:48:47Z","snapshot_observed_at":"2026-08-03T00:41:20.399858Z","submitted_at":"2023-10-04T03:30:32Z","title":"Generalization in diffusion models arises from geometry-adaptive harmonic representations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02557","snapshot_observed_at":"2026-08-05T20:29:39.825195Z","title":"Simoncelli, and St´ephane Mallat","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.825195Z"},"links":{"cited_paper":"/paper/2310.02557","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:8d83ef58cb58a3880c80a8a7a0443ee5c30e124acfa9f3c141f946d1980a562e","observation_id":"e6be8a45-42da-44d2-bc13-3912ba0f45eb","resolution":{"observed_at":"2026-08-05T20:29:39.825195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:51.789719Z","title":"Sriperumbudur","venue":null,"work_id":"7c056ee9-dc07-4ddf-b823-4df4fa6e1aba","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.880477Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:3a934d97d4665d66d56c3086d34a95d70c1c52e739da5763327dc19cfe51196c","observation_id":"aa3edf9e-979d-4c66-a655-d03e022f755a","resolution":{"observed_at":"2026-08-05T20:29:51.929446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09788","last_updated":"2021-06-17T20:00:55Z","snapshot_observed_at":"2026-07-06T11:20:29.182280Z","submitted_at":"2021-06-17T20:00:55Z","title":"Guided Integrated Gradients: An Adaptive Path Method for Removing Noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09788","snapshot_observed_at":"2026-08-05T20:29:40.026451Z","title":"Guided In- tegrated Gradients: An Adaptive Path Method for Removing Noise, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.026451Z"},"links":{"cited_paper":"/paper/2106.09788","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:8faa5fa2dce7d1f175a03bad2b64f4734e927820291b1edd6c63554b88b68fe5","observation_id":"35f99dc5-65a6-4acf-bf68-34cc9e8a1396","resolution":{"observed_at":"2026-08-05T20:29:40.026451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:51.515058Z","title":"Why are Saliency Maps Noisy? Cause of and Solution to Noisy Saliency Maps,","venue":null,"work_id":"e3dda371-975d-479f-8c4d-11245471d49a","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.111673Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:dd8c585fae5caee8ef432f719977b4cd7b4cfffd6e4783fbf488b775bddf2651","observation_id":"75b1a36b-7737-49f5-a353-42a45572d004","resolution":{"observed_at":"2026-08-05T20:29:51.620943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:51.296161Z","title":"Sch ¨utt, Sven D ¨ahne, Dumitru Er- han, and Been Kim","venue":null,"work_id":"a9f1b144-f733-4b4d-bf1e-8efd8ee529c2","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.251341Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:cca76248db94acd20fc0e65c051e39543f9de30a20fc262adc51818ac0f473dd","observation_id":"d990f494-09e3-4c33-85a1-94e4886d46f0","resolution":{"observed_at":"2026-08-05T20:29:51.391403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:51.093968Z","title":"Captum: A unified and generic model interpretability library for PyTorch, 2020","venue":null,"work_id":"acbc50c5-7105-4cec-83fd-39881653ccc6","year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.412534Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:824637e162ba8c9832b42daede0d8cc57e1ccb2dff9e366c204763271f73fbbf","observation_id":"760e14d0-1fc5-44d4-9e21-be0d420f4b1e","resolution":{"observed_at":"2026-08-05T20:29:51.205042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:50.862568Z","title":"Cartoon Explanations of Image Classifiers,","venue":null,"work_id":"3af0414b-00cd-4986-b467-5a7958690ea4","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.479852Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:67c85df277af6fa19b277c1909bd66ba1094900340a30eba7e05aeb2a8a72510","observation_id":"91a00948-de28-433b-90ef-9904bee8913e","resolution":{"observed_at":"2026-08-05T20:29:50.983801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:50.621444Z","title":"Explaining Image Clas- sifiers with Multiscale Directional Image Representation,","venue":null,"work_id":"38f541f2-cbbd-427d-88c3-dc9bceddd4fd","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.646711Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:aa56b446a49460a2e175bd4405f8de1690261d1d23cfce224318b4d60497e2e5","observation_id":"106d5919-a8d2-42c0-a694-eca1bf4ed3bd","resolution":{"observed_at":"2026-08-05T20:29:50.721363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.13369","last_updated":"2023-12-28T21:13:20Z","snapshot_observed_at":"2026-07-06T12:01:47.870599Z","submitted_at":"2021-10-26T02:53:14Z","title":"Partial Order in Chaos: Consensus on Feature Attributions in the Rashomon Set","version":3},"cited_work":{"arxiv_id":"2110.13369","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.13369","snapshot_observed_at":"2026-08-05T20:29:46.053777Z","title":"Partial Order in Chaos: Consensus on Feature Attributions in the Rashomon Set","venue":"cs.LG","work_id":"deaa9962-739a-4c5c-be65-185851902169","year":2021},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.790934Z"},"links":{"cited_paper":"/paper/2110.13369","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:332b206c9df6073a1ad2084a47d0b9ace1f3a5fdcb96f765717848217bf42773","observation_id":"181cb2ff-0620-4f6b-ac11-6522bef2b87a","resolution":{"observed_at":"2026-08-05T20:29:46.110025Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:50.409488Z","title":"Gershman, and Finale Doshi-Velez","venue":null,"work_id":"12c0f310-ea8d-4c96-bf79-6a331a8f55d6","year":2019},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.904786Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:3c80ed9b1bdb06ff6776830c533016077b9417c330d12794622b23ba53228ebb","observation_id":"5258e08b-0c16-4e1f-bd19-71ba33f6e9b6","resolution":{"observed_at":"2026-08-05T20:29:50.528709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:50.192347Z","title":"Lundberg and Su-In Lee","venue":null,"work_id":"cebebbe2-4520-4157-91dc-dd6e608ea4a7","year":2017},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.996679Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:96044c6250c0eba7bd29d3b9e93dcf8c0485f17bc0c867f1401ee60180d13d95","observation_id":"5a6b39d5-4519-4acf-99c9-a3b5feddb88f","resolution":{"observed_at":"2026-08-05T20:29:50.303885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08550","last_updated":"2024-06-14T07:03:08Z","snapshot_observed_at":"2026-07-31T06:27:12.796062Z","submitted_at":"2023-12-13T22:42:55Z","title":"Harmonics of Learning: Universal Fourier Features Emerge in Invariant Networks","version":3},"cited_work":{"arxiv_id":"2312.08550","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.08550","snapshot_observed_at":"2026-08-05T20:29:45.925798Z","title":"Harmonics of Learning: Universal Fourier Features Emerge in Invariant Networks","venue":"cs.LG","work_id":"11c6570e-d643-40d2-8653-f4de9001bc8f","year":2023},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.076018Z"},"links":{"cited_paper":"/paper/2312.08550","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:51804d25e620d2a43b462c2dedecf8f5be61cbc961381ef0643a1a58a0a11398","observation_id":"dbfb3562-a0bb-4a8b-9204-2ed172e3e6a1","resolution":{"observed_at":"2026-08-05T20:29:45.981005Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.03485","last_updated":"2022-10-20T11:18:55Z","snapshot_observed_at":"2026-07-06T11:55:24.902179Z","submitted_at":"2021-10-07T14:12:28Z","title":"Cartoon Explanations of Image Classifiers","version":5},"cited_work":{"arxiv_id":"2110.03485","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.03485","snapshot_observed_at":"2026-08-05T20:29:46.454912Z","title":"Cartoon Explanations of Image Classifiers","venue":"cs.AI","work_id":"7857ef3f-e254-47b1-acdf-e78a1005dea5","year":2021},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.568350Z"},"links":{"cited_paper":"/paper/2110.03485","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:a60504a078462f9cdc36af91a0a5ad78d962e023a0ffe47a56ab40c56baba774","observation_id":"db382a93-6223-442b-a518-72345f2e27d5","resolution":{"observed_at":"2026-08-05T20:29:46.548202Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.07844","last_updated":"2023-02-28T19:27:25Z","snapshot_observed_at":"2026-08-01T20:17:03.065889Z","submitted_at":"2022-11-15T02:01:41Z","title":"Characterizing the Spectrum of the NTK via a Power Series Expansion","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.07844","snapshot_observed_at":"2026-08-05T20:29:41.248446Z","title":"Characterizing the Spectrum of the NTK via a Power Series Expansion, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.248446Z"},"links":{"cited_paper":"/paper/2211.07844","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:555547ca08b43041448bf46d930b325b1567c754a2a8fc09d0bfc3dfea95d800","observation_id":"d797bb54-0ad1-4f07-a61d-5ed84e851046","resolution":{"observed_at":"2026-08-05T20:29:41.248446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.08760","last_updated":"2018-06-18T18:01:43Z","snapshot_observed_at":"2026-07-06T06:25:07.039294Z","submitted_at":"2018-02-23T23:11:07Z","title":"Sensitivity and Generalization in Neural Networks: an Empirical Study","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.08760","snapshot_observed_at":"2026-08-05T20:29:41.314824Z","title":"Abolafia, Jeffrey Pennington, and Jascha Sohl-Dickstein","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.314824Z"},"links":{"cited_paper":"/paper/1802.08760","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:9898815a1621d0bfeda3feaf83a3694f37999400aa58690b753a729c7ed95fcb","observation_id":"93bce62a-400b-4203-8c82-d9e18b5bfb1d","resolution":{"observed_at":"2026-08-05T20:29:41.314824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:41.376383Z","title":"Mathematical theory of deep learning, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.376383Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:2c1df07c31e308b160c173023cf595725b96f420c0bf0ade86a95c1f15e51afd","observation_id":"f79aacb9-7d75-4c34-85f0-3df2cbdaaafd","resolution":{"observed_at":"2026-08-05T20:29:41.376383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:49.768521Z","title":"Hamprecht, Yoshua Bengio, and Aaron Courville","venue":null,"work_id":"43a60777-b79b-4caf-b835-b169ed57766c","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.390521Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:90a9d9578614faf004bfb294364a3d0862395ce47a35750b0df9e98b7b47ddfe","observation_id":"837861db-905d-4026-bb3a-442fc5e34808","resolution":{"observed_at":"2026-08-05T20:29:49.870031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03108","last_updated":"2024-07-03T13:47:41Z","snapshot_observed_at":"2026-07-06T18:40:57.362549Z","submitted_at":"2024-07-03T13:47:41Z","title":"How Reliable and Stable are Explanations of XAI Methods?","version":1},"cited_work":{"arxiv_id":"2407.03108","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.03108","snapshot_observed_at":"2026-08-05T20:29:45.660438Z","title":"How Reliable and Stable are Explanations of XAI Methods?","venue":"cs.LG","work_id":"4885cfbe-93c0-4fca-beb7-3250405a63c3","year":2024},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.481201Z"},"links":{"cited_paper":"/paper/2407.03108","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:daafaf000faff5cc7cef32f9c5973e8b38fa204a223761eb1a008773bd21f8fb","observation_id":"fcf85745-3540-4219-847b-389038561bd9","resolution":{"observed_at":"2026-08-05T20:29:45.748506Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.07969","last_updated":"2021-07-07T07:37:59Z","snapshot_observed_at":"2026-08-07T23:35:33.248804Z","submitted_at":"2020-12-14T22:07:32Z","title":"A case for new neural network smoothness constraints","version":3},"cited_work":{"arxiv_id":"2012.07969","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.07969","snapshot_observed_at":"2026-08-05T20:29:45.469666Z","title":"A case for new neural network smoothness constraints","venue":"stat.ML","work_id":"7236641d-4b14-4884-b3c6-dcab38e609fa","year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.699278Z"},"links":{"cited_paper":"/paper/2012.07969","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:fdef02252bf382d1a5165d59ffd2287a0bd6fc26639841ec21b8baf2caddf23b","observation_id":"a9fa9868-2356-4074-8eab-ff26a78571c1","resolution":{"observed_at":"2026-08-05T20:29:45.524082Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:49.936119Z","title":"On Spectral Properties of Gradient-Based Explanation Meth- ods","venue":null,"work_id":"a12e5147-62a5-429c-b500-ecc2f0e98065","year":2024},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.166378Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:9d5c145a60bbfea5382f559d626370ce9c552db598112df0a097223a8a2be1e9","observation_id":"536082b6-8dde-43fb-ba4a-06dc3c8fbf19","resolution":{"observed_at":"2026-08-05T20:29:50.050620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:49.286797Z","title":"Best of both worlds: local and global explanations with human-understandable concepts,","venue":null,"work_id":"85dbc61c-806b-486a-8266-5bffe1802f6f","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.028285Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:51413889719cdde385b84b1bbd8ebd9c7edce93242f000745e360bbd76bbfa0e","observation_id":"6df260bf-d058-409c-a0d6-83fba61275d1","resolution":{"observed_at":"2026-08-05T20:29:49.380757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1610.02391","last_updated":"2019-12-03T02:13:03Z","snapshot_observed_at":"2026-07-06T05:13:49.420787Z","submitted_at":"2016-10-07T19:54:24Z","title":"Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.02391","snapshot_observed_at":"2026-08-05T20:29:42.312874Z","title":"Selvaraju, Michael Cogswell, Abhishek Das, Ramakrishna Vedantam, Devi Parikh, and Dhruv Ba- tra","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.312874Z"},"links":{"cited_paper":"/paper/1610.02391","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:6a772d9c9892f7202c1ebc71bac9d10e92374779e6f136c1ef9e7d8ed1ca1485","observation_id":"cb42f479-8fa0-4962-b020-d54f79e32857","resolution":{"observed_at":"2026-08-05T20:29:42.312874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.01713","last_updated":"2017-04-11T15:58:48Z","snapshot_observed_at":"2026-07-06T04:55:16.805883Z","submitted_at":"2016-05-05T19:52:32Z","title":"Not Just a Black Box: Learning Important Features Through Propagating Activation Differences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.01713","snapshot_observed_at":"2026-08-05T20:29:42.468070Z","title":"Not Just a Black Box: Learning Important Features Through Propagating Activation Differences, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.468070Z"},"links":{"cited_paper":"/paper/1605.01713","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:20d33b87676f60bcfcb412bce161278f36048d64c4b8d3cfebde8218d84fac2b","observation_id":"b08a5f10-bfc0-453c-aa9f-16e1c268b26b","resolution":{"observed_at":"2026-08-05T20:29:42.468070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03186","last_updated":"2022-08-13T21:04:34Z","snapshot_observed_at":"2026-07-31T02:15:03.267903Z","submitted_at":"2021-06-06T17:25:33Z","title":"Reverse Engineering the Neural Tangent Kernel","version":4},"cited_work":{"arxiv_id":"2106.03186","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03186","snapshot_observed_at":"2026-08-05T20:29:45.117925Z","title":"Reverse Engineering the Neural Tangent Kernel","venue":"cs.LG","work_id":"656a942b-0086-4fe1-90b2-2948c7932043","year":2021},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.617799Z"},"links":{"cited_paper":"/paper/2106.03186","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:eeb96c25c312696f5f290089c514cd530669b1eddbef43791ec45d0b361c52cf","observation_id":"516dc75f-6c80-4266-9c8c-932f7bc2e04b","resolution":{"observed_at":"2026-08-05T20:29:45.221292Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.08734","last_updated":"2019-05-31T13:45:08Z","snapshot_observed_at":"2026-08-02T06:24:21.199176Z","submitted_at":"2018-06-22T15:39:05Z","title":"On the Spectral Bias of Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.08734","snapshot_observed_at":"2026-08-05T20:29:41.395553Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.395553Z"},"links":{"cited_paper":"/paper/1806.08734","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:0595feb868a85f2d57d669e04cff74c54fe68a1a9ac49d84c92fef59ad8d3084","observation_id":"1d4f458f-4179-477a-82a0-5678c2b209c0","resolution":{"observed_at":"2026-08-05T20:29:41.395553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03825","last_updated":"2017-06-12T19:53:30Z","snapshot_observed_at":"2026-07-06T05:46:32.599765Z","submitted_at":"2017-06-12T19:53:30Z","title":"SmoothGrad: removing noise by adding noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03825","snapshot_observed_at":"2026-08-05T20:29:42.673658Z","title":"SmoothGrad: removing noise by adding noise, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.673658Z"},"links":{"cited_paper":"/paper/1706.03825","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:8a9092bbc04b61ea49ad7855987d07b847610193b089297a688c4e872a9f239b","observation_id":"7a533434-4f9d-40c7-9608-7d9ebadb7838","resolution":{"observed_at":"2026-08-05T20:29:42.673658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6806","last_updated":"2015-04-13T07:58:17Z","snapshot_observed_at":"2026-07-06T04:04:22.105016Z","submitted_at":"2014-12-21T16:16:37Z","title":"Striving for Simplicity: The All Convolutional Net","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6806","snapshot_observed_at":"2026-08-05T20:29:42.759382Z","title":"Striving for Simplicity: The All Convolutional Net, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.759382Z"},"links":{"cited_paper":"/paper/1412.6806","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:f1196b6caf48cc277b3a48ef8375f4e91b44b72ea61882edc1de8269359cb980","observation_id":"c35d56f7-76fa-4ef0-9d0f-56f5a63babc0","resolution":{"observed_at":"2026-08-05T20:29:42.759382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:49.507043Z","title":"Stop explaining black box machine learn- ing models for high stakes decisions and use interpretable models instead","venue":null,"work_id":"48c3d099-a9da-4b12-b17f-6bb907fc59df","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:41.855899Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:710b1bbad2a30d39c747ebddeff5a9bc87cb394db004d888c463445be500de27","observation_id":"7316aa0c-ed97-4ed5-ba9c-5f6e81322868","resolution":{"observed_at":"2026-08-05T20:29:49.600528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:48.853667Z","title":"One pixel attack for fooling deep neural networks","venue":null,"work_id":"e3e012d1-b3a2-4ea8-9215-ef39374bc164","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:43.037914Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:98f42b9225c660389e1d6555061e721c958716bcec1e6aa3abe0bfc64dd5e922","observation_id":"61dc7dfe-a92a-4af2-9d50-5940f3887172","resolution":{"observed_at":"2026-08-05T20:29:48.983514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08641","last_updated":"2022-01-31T18:20:18Z","snapshot_observed_at":"2026-07-06T11:19:49.354722Z","submitted_at":"2021-06-16T09:05:25Z","title":"Best of both worlds: local and global explanations with human-understandable concepts","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.08641","snapshot_observed_at":"2026-08-05T20:29:42.182612Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.182612Z"},"links":{"cited_paper":"/paper/2106.08641","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:1b24a2f590890331828a573f767c6ff7d4aa7726ba43fcf1d85aeee7716cb439","observation_id":"391a63be-beb0-4e6c-8bfa-32a1f390e620","resolution":{"observed_at":"2026-08-05T20:29:42.182612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.04098","last_updated":"2019-04-18T03:45:23Z","snapshot_observed_at":"2026-07-06T07:00:35.540190Z","submitted_at":"2018-09-11T18:23:09Z","title":"On the Structural Sensitivity of Deep Convolutional Networks to the Directions of Fourier Basis Functions","version":2},"cited_work":{"arxiv_id":"1809.04098","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.04098","snapshot_observed_at":"2026-08-05T20:29:44.877985Z","title":"On the Structural Sensitivity of Deep Convolutional Networks to the Directions of Fourier Basis Functions","venue":"cs.CV","work_id":"397aace9-ca15-4db9-9650-a229e13cd485","year":2018},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:43.415619Z"},"links":{"cited_paper":"/paper/1809.04098","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:572d0c24c4b4177f6d9a47860d1ccf49bafba7b5c1d1e57926c6d0eac66ce4ec","observation_id":"c5cf8f76-0f96-4ba2-b464-940367a870d0","resolution":{"observed_at":"2026-08-05T20:29:44.960024Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.05592","last_updated":"2024-12-07T09:14:46Z","snapshot_observed_at":"2026-07-06T20:03:11.541819Z","submitted_at":"2024-12-07T09:14:46Z","title":"From Flexibility to Manipulation: The Slippery Slope of XAI Evaluation","version":1},"cited_work":{"arxiv_id":"2412.05592","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.05592","snapshot_observed_at":"2026-08-05T20:29:44.627195Z","title":"From Flexibility to Manipulation: The Slippery Slope of XAI Evaluation","venue":"cs.AI","work_id":"6c45b052-0d47-4e84-a7ec-3d2a3c638922","year":2024},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:43.567516Z"},"links":{"cited_paper":"/paper/2412.05592","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:a31fcbdcc0040c5b4fd110f659c4a38cfcb816e7cad1cf13b8d3300265ddc3da","observation_id":"270b4b2d-3442-40fa-be31-3b859ce7ed03","resolution":{"observed_at":"2026-08-05T20:29:44.747303Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.08973","last_updated":"2020-10-18T12:20:27Z","snapshot_observed_at":"2026-08-05T16:40:18.466935Z","submitted_at":"2020-10-18T12:20:27Z","title":"Feature Importance Ranking for Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.08973","snapshot_observed_at":"2026-08-05T20:29:43.740707Z","title":"Feature Importance Ranking for Deep Learning, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:43.740707Z"},"links":{"cited_paper":"/paper/2010.08973","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:164a0229bb00f20f318a80116c85ea8365fd4b59670fba33824bf4651c0e3d34","observation_id":"6a3bb499-7152-4894-a6ba-102dbac2973b","resolution":{"observed_at":"2026-08-05T20:29:43.740707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6034","last_updated":"2014-04-19T11:54:52Z","snapshot_observed_at":"2026-07-06T03:31:30.452356Z","submitted_at":"2013-12-20T16:45:54Z","title":"Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Maps","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6034","snapshot_observed_at":"2026-08-05T20:29:42.650101Z","title":"Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Maps, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.650101Z"},"links":{"cited_paper":"/paper/1312.6034","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:6d28278010c87c074296e22ea9b74ae06f119c3bbf4f85a091d8f6eeae2a1e5a","observation_id":"033bca4f-5f95-449e-a1e3-b8e19c782369","resolution":{"observed_at":"2026-08-05T20:29:42.650101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.03677","last_updated":"2020-11-20T00:10:51Z","snapshot_observed_at":"2026-07-06T09:26:29.068023Z","submitted_at":"2020-06-05T20:49:49Z","title":"Visual Transformers: Token-based Image Representation and Processing for Computer Vision","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.03677","snapshot_observed_at":"2026-08-05T20:29:43.996459Z","title":"Visual Transform- ers: Token-based Image Representation and Processing for Computer Vision, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:43.996459Z"},"links":{"cited_paper":"/paper/2006.03677","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:ab3fab33086fec96a46cb29c07246609f031c7052ec02e841199e738c1eb4122","observation_id":"babc0f36-4720-4574-bf17-7d6a1ba7dd3b","resolution":{"observed_at":"2026-08-05T20:29:43.996459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.09701","last_updated":"2019-11-04T20:50:25Z","snapshot_observed_at":"2026-07-06T08:09:31.884004Z","submitted_at":"2019-07-23T05:50:14Z","title":"Benchmarking Attribution Methods with Relative Feature Importance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.09701","snapshot_observed_at":"2026-08-05T20:29:44.117723Z","title":"Benchmarking Attri- bution Methods with Relative Feature Importance, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:44.117723Z"},"links":{"cited_paper":"/paper/1907.09701","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:a967d6943bf62097418d5709f33e88e050ce92a49127e270c72683733074d09e","observation_id":"caf5a8df-da08-4320-9856-a5b3f33bc1b9","resolution":{"observed_at":"2026-08-05T20:29:44.117723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:49.087383Z","title":null,"venue":null,"work_id":"b27cdd93-6ff0-48f7-8681-3f607f13e335","year":2005},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:42.908294Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:22343d7376f0cdf3577d289f756bcff5f19cf07c5a32fd792acaf6a203a83559","observation_id":"1ea80987-831b-4264-9392-2eaa22cc4f35","resolution":{"observed_at":"2026-08-05T20:29:49.197240Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.08864","last_updated":"2019-10-17T07:46:53Z","snapshot_observed_at":"2026-08-03T20:06:38.460006Z","submitted_at":"2017-10-24T16:02:19Z","title":"One pixel attack for fooling deep neural networks","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.08864","snapshot_observed_at":"2026-08-05T20:29:43.143790Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:43.143790Z"},"links":{"cited_paper":"/paper/1710.08864","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:4f009420e6ceaea93ba7ca90862ebe3cde693da15649b661f8d657f2dd1a8296","observation_id":"97867edc-21c4-4b30-8291-87b78b19eb11","resolution":{"observed_at":"2026-08-05T20:29:43.143790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.01365","last_updated":"2017-06-13T01:52:38Z","snapshot_observed_at":"2026-07-06T05:32:18.507883Z","submitted_at":"2017-03-04T00:18:49Z","title":"Axiomatic Attribution for Deep Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.01365","snapshot_observed_at":"2026-08-05T20:29:43.293394Z","title":"Axiomatic Attribution for Deep Networks, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:43.293394Z"},"links":{"cited_paper":"/paper/1703.01365","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:a459712d4d7be4b3dcdb7f04ebf11aaed4b673fa2961ae1f486730c5c92f0e40","observation_id":"657f1b8f-634d-4abc-b18e-314600080148","resolution":{"observed_at":"2026-08-05T20:29:43.293394Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01506","last_updated":"2021-06-02T23:24:06Z","snapshot_observed_at":"2026-07-06T11:15:23.626911Z","submitted_at":"2021-06-02T23:24:06Z","title":"Transformers are Deep Infinite-Dimensional Non-Mercer Binary Kernel Machines","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01506","snapshot_observed_at":"2026-08-05T20:29:43.854933Z","title":"Wright and Joseph E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:43.854933Z"},"links":{"cited_paper":"/paper/2106.01506","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:99c0f8a13c4162777010915055292b9e1211a7a15c8184bb026c271b9ea28458","observation_id":"ca6aee46-3f77-40e0-820e-38ee175e91af","resolution":{"observed_at":"2026-08-05T20:29:43.854933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:48.614900Z","title":"In this degenerate case, no root is present","venue":null,"work_id":"888f07a6-c204-4daf-9516-ec06dbb390e6","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:44.297021Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:76ce3702ff162b9d7cb87dfa740af6462341a3498033708001849fa05bdae645","observation_id":"b5d5fac9-542d-49e8-a8c2-d141e1f1638c","resolution":{"observed_at":"2026-08-05T20:29:48.688555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:29:48.383289Z","title":"In a neighborhood of such a point, by a first-order Taylor expansion, ∆(τ ) ≈ α(τ − τ ∗), for some α ̸= 0 and τ close to τ ∗","venue":null,"work_id":"4763effe-1439-47d2-84f6-cb95300fee7a","year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:44.431074Z"},"links":{"citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:87a71522c73e393e0e38dcef028f0c32cf1345b3a48abd359aa5f04a7daacdfa","observation_id":"66076b36-2620-4692-8952-92140cecc643","resolution":{"observed_at":"2026-08-05T20:29:48.486996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00867","last_updated":"2017-11-02T18:01:30Z","snapshot_observed_at":"2026-08-05T01:45:08.580865Z","submitted_at":"2017-11-02T18:01:30Z","title":"The (Un)reliability of saliency methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00867","snapshot_observed_at":"2026-08-05T20:29:40.333627Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.333627Z"},"links":{"cited_paper":"/paper/1711.00867","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:d882e13406b21ae847c650f0fde07d47e70c4dbbf1e2b2ff74fd9608543f80db","observation_id":"cbe652b4-87af-4b64-917a-cb88b1dc70fb","resolution":{"observed_at":"2026-08-05T20:29:40.333627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.02582","last_updated":"2018-07-06T22:44:10Z","snapshot_observed_at":"2026-08-02T10:42:30.626497Z","submitted_at":"2018-07-06T22:44:10Z","title":"Gaussian Processes and Kernel Methods: A Review on Connections and Equivalences","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.02582","snapshot_observed_at":"2026-08-05T20:29:39.942896Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:39.942896Z"},"links":{"cited_paper":"/paper/1807.02582","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:ca744a2021846886c5417e7d8edaacc2d578e13ad22f33bbd7f05c5eacf11755","observation_id":"e96691c8-8d4f-4769-8a99-2658a9919a73","resolution":{"observed_at":"2026-08-05T20:29:39.942896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.04893","last_updated":"2019-09-14T15:55:32Z","snapshot_observed_at":"2026-07-06T07:32:52.175353Z","submitted_at":"2019-02-13T13:25:39Z","title":"Why are Saliency Maps Noisy? Cause of and Solution to Noisy Saliency Maps","version":3},"cited_work":{"arxiv_id":"1902.04893","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.04893","snapshot_observed_at":"2026-08-05T20:29:46.690396Z","title":"Why are Saliency Maps Noisy? Cause of and Solution to Noisy Saliency Maps","venue":"cs.LG","work_id":"d926e358-d7b2-4e35-993c-a74f8506f5d8","year":2019},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.196636Z"},"links":{"cited_paper":"/paper/1902.04893","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:da700f91fc996786cd082e5e32b65082ed122cae85b706bca9183379235b561d","observation_id":"361ac942-f14d-4978-a900-e5f0a2486b5c","resolution":{"observed_at":"2026-08-05T20:29:46.751970Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00631","last_updated":"2020-05-01T21:56:36Z","snapshot_observed_at":"2026-08-04T15:43:12.791261Z","submitted_at":"2020-05-01T21:56:36Z","title":"Evaluating and Aggregating Feature-based Model Explanations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00631","snapshot_observed_at":"2026-08-05T20:29:37.827338Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:37.827338Z"},"links":{"cited_paper":"/paper/2005.00631","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:9707fe1991b7aa8128d25690996da39c5e91b1900038d9d41db46905b6efa552","observation_id":"be264f38-478a-4b9f-b0ee-5db4c7b054d3","resolution":{"observed_at":"2026-08-05T20:29:37.827338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.14878","last_updated":"2022-05-13T03:43:44Z","snapshot_observed_at":"2026-07-06T10:19:05.986548Z","submitted_at":"2020-11-21T00:47:48Z","title":"Explaining by Removing: A Unified Framework for Model Explanation","version":2},"cited_work":{"arxiv_id":"2011.14878","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.14878","snapshot_observed_at":"2026-08-05T20:29:47.516533Z","title":"Explaining by Removing: A Unified Framework for Model Explanation","venue":"cs.LG","work_id":"0230451b-ca29-40a2-b635-1b933188f50a","year":2020},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:38.724937Z"},"links":{"cited_paper":"/paper/2011.14878","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:d9224e8f23f0f5abc326ca479e9a1f937bde244bfbcf6cff673cd6d82e016a09","observation_id":"4a28870b-8ea5-4146-a57b-3d55e4880cc8","resolution":{"observed_at":"2026-08-05T20:29:47.671477Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12857","last_updated":"2023-04-28T12:58:15Z","snapshot_observed_at":"2026-07-06T14:22:08.657203Z","submitted_at":"2022-11-22T09:24:45Z","title":"Explaining Image Classifiers with Multiscale Directional Image Representation","version":3},"cited_work":{"arxiv_id":"2211.12857","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.12857","snapshot_observed_at":"2026-08-05T20:29:46.232819Z","title":"Explaining Image Classifiers with Multiscale Directional Image Representation","venue":"cs.CV","work_id":"47d7de22-b449-4d3c-babe-41bb0cc74d6c","year":2022},"citing_paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:40.713574Z"},"links":{"cited_paper":"/paper/2211.12857","citing_paper":"/paper/2508.10490"},"observation_digest":"sha256:19fab1d9a81ed97b073304f0305a43633ca6666372a67487bbeec534d43af64c","observation_id":"e95df0b0-23f3-4773-a5cd-9998af3532a8","resolution":{"observed_at":"2026-08-05T20:29:46.345544Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.10490","last_updated":"2025-08-14T09:49:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T18:25:37.859850Z","submitted_at":"2025-08-14T09:49:07Z","title":"On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations"},"reference_resolution":{"displayed":76,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":38,"verified_exact":14,"verified_fuzzy":22},"total_outbound_references":76},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 76 of 76 outbound references and 0 inbound Pith citation observations for arXiv:2508.10490."}