{"as_of":"2026-08-11T05:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa618c4ec5710682df7d9f267546c278eb0fd47c4eeb4d0b5d815c41ae7e8abb","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T00:57:24.855665Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T22:39:41.308077Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T22:47:37.492770Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"cited_work":{"arxiv_id":"2606.18008","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.18008","snapshot_observed_at":"2026-07-10T22:47:37.492770Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","venue":"cs.CV","work_id":"e9500ddd-4fa5-4998-a673-0446fb261055","year":2026},"citing_paper":{"arxiv_id":"2607.06726","last_updated":"2026-07-07T18:47:45Z","snapshot_observed_at":"2026-08-07T01:47:26.141612Z","submitted_at":"2026-07-07T18:47:45Z","title":"A Good Initialization is All You Need for Faithful Visual Attribution","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-10T22:39:41.308077Z"},"links":{"cited_paper":"/paper/2606.18008","citing_paper":"/paper/2607.06726"},"observation_digest":"sha256:5b45815927d4b6a382379378ebde17792726919e7834a3367f199c1622f434ff","observation_id":"0755c3bf-66fa-4669-be5f-4e35320da131","resolution":{"observed_at":"2026-07-10T22:47:37.508763Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2606.18008/citation-record","integrity":"/paper/2606.18008/integrity","json":"/paper/2606.18008/citation-record.json","paper":"/paper/2606.18008"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"Attribution explanations for deep neural networks: A theoretical perspective,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:574d0afd57860986ed3f48a073de604f778087a9287d185e9c137fa1bf1d4c42","observation_id":"91b5d942-1398-45bf-8346-e50aa429ace8","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Explainable AI (XAI): Core ideas, techniques, and solutions,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:fdd218c8880a3595b0c6d94e19ae2e066c2e8ab3810791cd87fb9fecbfe17ac5","observation_id":"1864c2ab-4273-4e3b-b12d-09d6f8fa309c","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"A survey of feature attribution techniques in explainable ai: Taxonomy, analysis and comparison,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:2443024b96788f888c17c531d1ee2b8641e8e9ad1564b510b402bb76e6ea9f2c","observation_id":"48d0702a-897c-4244-8a15-dd1bee7bce45","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"A review and comparative study on probabilistic object detection in autonomous driv- ing,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:03b11585c86fe79ec48b2f1da254bc0661988f673d53babd21cd2a7608856372","observation_id":"3d69a13f-8d78-4356-bc2a-703552cf521d","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Going beyond xai: A systematic survey for explanation-guided learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:e090e702dcea7c671e52d2e6efc3258b9c2eb13c16aca9ea84371211e0fdc6ba","observation_id":"cdef9fd4-d2c2-4621-886b-22fcb388c22b","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.06264","last_updated":"2026-05-07T13:38:18Z","snapshot_observed_at":"2026-07-06T23:18:46.145104Z","submitted_at":"2026-05-07T13:38:18Z","title":"Can Attribution Predict Risk? From Multi-View Attribution to Planning Risk Signals in End-to-End Autonomous Driving","version":1},"cited_work":{"arxiv_id":"2605.06264","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.06264","snapshot_observed_at":"2026-07-03T20:58:58.590571Z","title":"Can Attribution Predict Risk? From Multi-View Attribution to Planning Risk Signals in End-to-End Autonomous Driving","venue":"cs.LG","work_id":"39aa6090-6ac3-465f-9f00-cc603cfdfba2","year":2026},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/2605.06264","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:208f1abc1ffa50c204303ed700f629f5a21e1d2454a90f56e3fba7d54ed05628","observation_id":"1e4b6ced-4685-40d3-94cb-7237e57b17a7","resolution":{"observed_at":"2026-07-03T20:58:58.591871Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.07008","last_updated":"2026-07-20T11:10:30Z","snapshot_observed_at":"2026-08-03T23:15:33.062867Z","submitted_at":"2026-01-30T10:29:27Z","title":"Where Not to Learn: Prior-Aligned Training with Subset-based Attribution Constraints for Reliable Decision-Making","version":4},"cited_work":{"arxiv_id":"2602.07008","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.07008","snapshot_observed_at":"2026-07-03T20:58:58.589460Z","title":"arXiv preprint arXiv:2602.07008 (2026) VLAA-GUI 17","venue":"cs.CV","work_id":"35851318-9855-4111-9ca6-57760f3e16bc","year":2026},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/2602.07008","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:f1b65ec4804ecd5fc88cf288330dab4c85e13971f81463fa21ac7702bd6f2e24","observation_id":"1d1de6b9-5b2e-4b78-9009-49f545649547","resolution":{"observed_at":"2026-07-03T20:58:58.590652Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"Safe: Sensitivity-aware features for out-of-distribution object detection,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:9eb57e1e4ec77f28bad35538819c37b10434d0abb1505c11b1ee89bb9c7dae2a","observation_id":"d77dc404-1d18-42e1-bac0-ad4f52e421cf","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.00841","last_updated":"2025-07-01T15:10:00Z","snapshot_observed_at":"2026-08-09T01:33:11.153119Z","submitted_at":"2025-07-01T15:10:00Z","title":"SafeMobile: Chain-level Jailbreak Detection and Automated Evaluation for Multimodal Mobile Agents","version":1},"cited_work":{"arxiv_id":"2507.00841","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.00841","snapshot_observed_at":"2026-07-03T20:58:58.591719Z","title":"arXiv preprint arXiv:2507.00841 , year=","venue":null,"work_id":"8eabd457-30b8-4c8e-a726-6a58e37a37d8","year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/2507.00841","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:56a09d6a4e4c79aa21c7488cf3de0c045d905101a464992eb640149f7995636a","observation_id":"4af0f3b1-729e-4ac4-9570-ca4251400d23","resolution":{"observed_at":"2026-07-03T20:58:58.593211Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"RISE: Randomized input sampling for explanation of black-box models,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:23b9f9fceb37ab013450de4f9b9fc410d0810f318f329533aa8477cb3abd1780","observation_id":"8c4a6a59-32ba-4059-a801-77013625ce9c","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Black-box explanation of object detectors via saliency maps,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:a2b04eb66d77a4308636184433be88ed346d16875a07a094946dc9bf6d74b238","observation_id":"21ca335d-86ce-415e-9e73-daf4d0df6105","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00470","last_updated":"2026-05-19T12:16:55Z","snapshot_observed_at":"2026-07-06T21:02:08.295333Z","submitted_at":"2025-04-01T06:58:15Z","title":"Less is More: Efficient Black-box Attribution via Minimal Interpretable Subset Selection","version":2},"cited_work":{"arxiv_id":"2504.00470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.00470","snapshot_observed_at":"2026-07-03T20:58:58.593151Z","title":"Less is More: Efficient Black-box Attribution via Minimal Interpretable Subset Selection","venue":"cs.LG","work_id":"9b3c00b3-578c-4b19-bde4-a9a4d8ceb9ce","year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/2504.00470","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:740ac92435c25d669e661ee26bb54823009096adb4f07ef76ea34765c8b59187","observation_id":"f7163051-c62d-4401-b3f9-adda9194b616","resolution":{"observed_at":"2026-07-03T20:58:58.594382Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"Spatial sensitive grad-cam: Visual explanations for object detection by incorporating spatial sensitivity,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:5ae48b74ead9d4cb8c0404ffa8f2bd423600c7850eddd4c10acf3628ce5fbcfe","observation_id":"c8956d0b-06a9-4f19-899b-4e2e14702e2c","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Spatial Sensitive Grad-CAM++: Improved visual expla- nation for object detectors via weighted combination of gradient map,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:22c4ed83ee9b6f5bc6f9dd69082a6b170d16b195f2de2ac90a5b5823e33c53f1","observation_id":"7c567813-e316-45c7-ba2c-6b3e5927d44a","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Less is more: Fewer interpretable region via submodular subset selection,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:ec27203e2532a9b6e2af05898cea1364a6737c81e38daf20ea12a72b34c33423","observation_id":"67959e17-e2b5-40e6-8848-b5c4a280bfbe","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Interpreting Object-level Foundation Models via Visual Pre- cision Search,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:af30c0f4ee7da1fa16dfc487deb1e56545fe62745f515ee0676772b756e18946","observation_id":"e9eb22f2-c216-487a-9f08-4d1eacd49f9d","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Explain any concept: Seg- ment anything meets concept-based explanation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:d1c61204b1848c10f5a7cb9d8479f4faa596e2a4d391aa57e07a9b3e179badad","observation_id":"06e42dab-7e30-4e34-8a71-7532c0ccb9bd","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Imagenet: A large-scale hierarchical image database,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:b3f4d100a9a4dbc6a10ae4d2483e0598be0a2ff1ad9f0a086eb68452a18f31a8","observation_id":"a36f921e-bde5-4b16-bd8a-1f873c196f3e","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Learning transferable visual models from natural language supervision,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:da73569b30955b4fa5ffa8a6a24e23a82cdeb65e41ad0e60b6e655941f70f818","observation_id":"3c0d4bcd-c950-4e05-9fb6-7ddd59b60902","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Deep residual learning for image recognition,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:2788e12bb5ccce0b7028c76a05a28c78f170493856bcd2b3f06f13c4b03bdacf","observation_id":"dc537dcf-48a8-4508-bae8-dda096237d66","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Microsoft COCO: Common objects in context,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:8ee73b90e1014b908e80a926cbc6593c06261a8f81dc7554eddc335ad9364ec6","observation_id":"78c34d5b-f879-484e-8cfc-6810831b20d8","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"LVIS: A dataset for large vocabulary instance segmentation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:89ccd2601b876bbe1301b4bd03c861cc75b3327a93f5378efb22598e9cb4760e","observation_id":"d6b3ada5-f192-4e11-88dd-f00985358d9a","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"ReferItGame: Referring to objects in photographs of natural scenes,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:492704388e72e315676bce084d77aef67f94995c2c4d3be4bff91438de68fb58","observation_id":"6509f1d9-1dde-4280-aad7-14ce7d404759","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Grounding DINO: Marrying dino with grounded pre- training for open-set object detection,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:9e3297e8e3e67d3b32b25a59005d14feb6859da6ac10dbc0266846f82fb42d9a","observation_id":"3f05fdf9-e623-4b50-b386-8f37a0019ed3","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Florence-2: Advancing a unified representation for a variety of vision tasks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:429682dab174234182f641cf10ca3201705f5c80572aa940cbdec91da53dfd28","observation_id":"016eb9fc-fb55-4f8b-acc4-422a04a9faaf","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13923","last_updated":"2025-02-19T18:00:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-19T18:00:14Z","title":"Qwen2.5-VL Technical Report","version":1},"cited_work":{"arxiv_id":"2502.13923","doi":"10.48550/arxiv.2502.13923","metadata_source":"pith","pith_arxiv_id":"2502.13923","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen2.5-VL Technical Report","venue":"cs.CV","work_id":"69dffacb-bfe8-442d-be86-48624c60426f","year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/2502.13923","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:b891a673c93569b177dd5ac6871482f527d7d748f43ac2b3578120260daa91d5","observation_id":"1c971cdd-28f7-40e6-894d-4d59dbbf8394","resolution":{"observed_at":"2026-07-03T20:58:58.596965Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-08T16:08:16.864468+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T16:08:16.864468+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"Phasewin search framework enable efficient object-level interpretation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:baa33fbbf11495de0b8ff647c23015f60a284702a71153e31f1646e9cd74893e","observation_id":"15134e40-2186-4ffe-945e-000f27afdd0a","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"On pixel-wise explanations for non-linear classifier decisions 16 by layer-wise relevance propagation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:e7c713967e7b2d8202e5282629802b57eebb2a20ae7748fe8f4fde910a8a8370","observation_id":"716e5419-e34a-4739-8889-f6e1c2627f69","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Gradient methods for submodular maximization,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:598cd2d42898bc59a031fe7749ad05f1f12e5adcf4b1dffaf7b705c1f94a7b23","observation_id":"3bda2485-111a-4812-ab58-e31e7410a637","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Grad-CAM: visual explanations from deep networks via gradient-based localization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:e0fbe46e27786489b209ac4f2fa2edd6e7e5574d3f3cd6cbe5eae025d35bb8d2","observation_id":"d758ca45-510c-4765-a0df-87ec8d3243f0","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Grad-CAM++: Generalized gradient-based visual explanations for deep convolutional networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:5d456862ffb6a4fb05691974eeb39b700e919fcd250337f8103a1196e485c884","observation_id":"8151a33e-737d-422e-b1b8-4477b1f835c7","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Score-cam: Score-weighted visual explanations for convolu- tional neural networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:e2630954e8c8732dd8081608ecab0c816fe2973766b30cd6c58efaca1e241221","observation_id":"5796dfb7-022f-4b22-85f0-0c57d5d6242a","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Vit-cx: Causal explanation of vision transformers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:810b48c5927934b833ec40595be7c7131d24c66ec5610de10a735336a2803cb2","observation_id":"38aefd0c-dde6-4cf5-ab81-b9f59559ff70","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Gradient- based visual explanation for transformer-based clip,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:142adbb4f538d2b6493c888489f32c10ad67aec22349672e8285b6a6b9549cba","observation_id":"9fc35834-0e27-43d0-a280-e92c99e96426","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Axiomatic attribution for deep networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:812e5f11dee8f028944d2c137110a200d254be63bcbd472aa97409634ae66c46","observation_id":"a2dcf392-df1e-46e4-975c-974951c3a5a5","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"iGOS++: integrated gradient optimized saliency by bilateral perturbations,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:a670433ec061f8cf1483a0d798c0f490390651bc2b40c61a23a8ad568fa21920","observation_id":"eb8c5aab-59f7-4165-a79c-1bbd91f8f3c3","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Making sense of dependence: Ef- ficient black-box explanations using dependence measure,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:075b5f4efa05a9092cd3f37ebaf90e39dc724255fed51f9bb27e41d7a24417ba","observation_id":"d19895b7-9e3e-4de7-9223-ed3cf7ae77cf","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"\"why should I trust you?","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:f19aa43d141b34a160b7f4ff39e8dcf1b6996055e8379081659a26e0d061645f","observation_id":"b81b9706-0cd4-4d51-8046-d40e193496bd","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"A value for n-person games,","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:b3aae2766025ebd44dc8b1f83f5c86b5b029a74c445f363a5affbe4789e3313b","observation_id":"38499717-d5b5-415f-80fa-50ccb6f69835","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"A unified approach to interpreting model predictions,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:4945b345fca546f777530f44061a6830be5899f679a5665b2c95566d47723360","observation_id":"d9b07d42-fdbe-4175-b2ea-bc73793abebb","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Harsanyinet: Computing accurate shapley values in a single forward propagation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:005de17002ca1970836175a2b4e305ef315165beb4406ecc21ca892b35bfdadf","observation_id":"07e1cd4e-196f-4329-952f-be63054090df","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Problems with shapley-value-based explanations as feature importance measures,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:526be73d161e894793f6c6328c8fb24452abdf402dda86b81d289ab54a343467","observation_id":"b7954b6f-8ac3-497d-bc08-fd6714bb34b8","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"One explanation is not enough: structured attention graphs for image classification,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:a9e28e6e4582556dbbf11472311fd0038d6963ad65580e03c0e26e31fc27222d","observation_id":"fc43117c-9548-41e2-835b-e62ce837710e","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.08011","last_updated":"2018-11-19T22:41:49Z","snapshot_observed_at":"2026-08-02T12:24:55.960943Z","submitted_at":"2018-11-19T22:41:49Z","title":"Explain to Fix: A Framework to Interpret and Correct DNN Object Detector Predictions","version":1},"cited_work":{"arxiv_id":"1811.08011","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.08011","snapshot_observed_at":"2026-07-10T22:47:37.532994Z","title":"Explain to Fix: A Framework to Interpret and Correct DNN Object Detector Predictions","venue":"cs.CV","work_id":"a3c2d2b6-7637-48eb-80fd-fe9c93573e0d","year":2018},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/1811.08011","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:645c06b6e39b2603f779481762208b63e777d417b19252351e385b00f9f74b8d","observation_id":"270f6331-b6ea-414a-9c68-89ffd7ded15d","resolution":{"observed_at":"2026-07-03T20:58:58.582462Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"Gradient-based instance-specific visual explanations for object specification and object discrimination,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:90b261045ebd97a934e167c0f44e9231443dd25c50c24421c7f709ff9a6ca5a4","observation_id":"065b0298-d4c7-4caa-9ee7-08526d1d65c0","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Diverse explanations for object detectors with nesterov-accelerated igos++","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:00ab58c85341307864462364745990b5166abc1a99ccc2857b1abbb9b6fcc456","observation_id":"b4914b8f-ebeb-45a0-8396-886eb4c78106","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Comparing the decision-making mechanisms by transformers and cnns via explanation methods,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:e61bb6c3a0fc7975409e9c715e9fff34fc6eafafafa9ffccfbe376694604fe88","observation_id":"4d809f6a-56e9-4898-b7fa-a338d664a09a","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Interpreting clip’s image representation via text-based decomposition,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:2cb9d6be6f5fe7faefcc1be1f68329fcc4b1be8b7a3bb5180a0142d2bebba910","observation_id":"0fae130f-530a-4e1c-a775-5029883d75f2","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00666","last_updated":"2026-05-17T02:47:00Z","snapshot_observed_at":"2026-08-03T00:13:02.527545Z","submitted_at":"2024-12-01T04:04:32Z","title":"Explaining Object Detectors via Collective Contribution of Pixels","version":4},"cited_work":{"arxiv_id":"2412.00666","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.00666","snapshot_observed_at":"2026-07-03T20:58:58.579987Z","title":"Explaining object detectors via collective contribution of pixels.arXiv preprint arXiv:2412.00666, 3","venue":"cs.CV","work_id":"fa231db3-7a89-496d-8368-226214d01e03","year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/2412.00666","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:ba128a687753846cb992ef1c1c724e22c771968069ca583e44ff18e94b766d5e","observation_id":"84f6aa8b-71d7-4e58-9af9-19a32c2107a4","resolution":{"observed_at":"2026-07-03T20:58:58.581138Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"Lvlm- intrepret: An interpretability tool for large vision-language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:99c6453ad74e51c9931a6969dcbfacfe9b8705d582f288f0b3e3e45374e61b16","observation_id":"ed6ac37d-1251-48c8-abb0-3b052c42edfc","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01224","last_updated":"2019-08-03T20:09:40Z","snapshot_observed_at":"2026-08-05T15:56:21.095271Z","submitted_at":"2019-08-03T20:09:40Z","title":"Smooth Grad-CAM++: An Enhanced Inference Level Visualization Technique for Deep Convolutional Neural Network Models","version":1},"cited_work":{"arxiv_id":"1908.01224","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.01224","snapshot_observed_at":"2026-07-03T20:58:58.594253Z","title":"Smooth grad- cam++: An enhanced inference level visualization technique for deep convolutional neural network models","venue":null,"work_id":"eabde499-fad8-4ea6-8ba6-b812ec9dc0c5","year":1908},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/1908.01224","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:60fccbc99e72791a34b9c2fb216dceb22b0fdff1d2436a3ffbe0b1d4b3ec6ff5","observation_id":"2d188a61-9112-4337-918c-766f02cc8a87","resolution":{"observed_at":"2026-07-03T20:58:58.595847Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"From redundancy to relevance: Enhancing explainability in multimodal large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:37d17a0cc95712b2459f5edbd55116113707cbac04cdbc572e7b380818e2331d","observation_id":"9cd27206-53ac-42e4-a681-3182844b259e","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13891","last_updated":"2025-03-18T04:34:43Z","snapshot_observed_at":"2026-08-07T16:55:58.912014Z","submitted_at":"2025-03-18T04:34:43Z","title":"Where do Large Vision-Language Models Look at when Answering Questions?","version":1},"cited_work":{"arxiv_id":"2503.13891","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13891","snapshot_observed_at":"2026-07-03T20:58:58.571629Z","title":"Where do large vision-language models look at when answering questions?","venue":null,"work_id":"0a290c74-e571-47af-a15c-fcb0e586314d","year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"cited_paper":"/paper/2503.13891","citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:203afab9ad2fc4110560e7fbb6868aaa5e91020e4004b820d07dac34eaa5dea7","observation_id":"172c0798-7cf1-47eb-a108-0a9df966d1f9","resolution":{"observed_at":"2026-07-03T20:58:58.573488Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T00:57:24.855665Z","title":"Token activation map to visually explain multimodal llms,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:5cc4098f53daea6b0d8dc2f0bf26a4acbb09974e91e39c0dc203ba9d63529a79","observation_id":"8719836c-d3c8-4746-b40a-b0ae4ebe087f","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Mllms know where to look: Training-free perception of small visual details with multimodal llms,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:fe5acbd9f54da4286cc1d1f6b18a9f81b9483ea6ca30ea7ca0a62f7d8e79ac65","observation_id":"2c15139a-9176-4bd8-98bb-438b43375976","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Where mllms attend and what they rely on: Explaining autoregressive token generation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:227dce8c8b49cfce9c2dde869c1c0001f0d059a73787d1f8c4f8defd41c3ee66","observation_id":"388bb9a8-7809-4d7e-8158-372101e159e2","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Accelerated greedy algorithms for maximizing submodular set functions,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:0bdfc44c9339aa6faf4b64a95cc73c2a61c4c3ac42f82b8e0804571836de4b99","observation_id":"114d99fb-8740-4bdb-b633-81be7825eb68","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Cost-effective outbreak detection in networks,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:649b1f1bf327a18f77a76d327a04bf87f43c97abe28d887c2b6e8461801ae9e6","observation_id":"f8c908ac-8465-4f6b-b890-ed6afa605236","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Lazier than lazy greedy,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:d69840772c4ad838ea5779655ebe4237812720a3c0dde155006d2d278fe6d0ba","observation_id":"4b7b6bf8-6d33-40fa-99b3-680561356832","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Fast multi-stage submodular maximiza- tion,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:390e2fbc04fd0fdc31476dcb7d2d4089b20e2ad556ada1cd45a57830a5e82c79","observation_id":"4c8cca18-e621-4a0a-86b4-48e74cdf6c1b","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"The fast algorithm for submod- ular maximization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:2921ac7f5e49783ff3a50524d41064bb467ec6d1c24384102841447724e833ac","observation_id":"4b6242ba-1115-408c-aaaf-f6b60af8a0ca","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Deep inside convolutional networks: Visualising image classification models and saliency maps,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:ba914e7e718729890a58af58976b922ad793023a74680e8272edb68da89dd510","observation_id":"04f7a29c-6979-4b9e-9613-cd1c66dc6fc3","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"SLIC superpixels compared to state-of-the-art superpixel methods,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:dde24fad07c457991c985bde06a618cb7a2d260fab41178997a3cbeb98b8a526","observation_id":"ab86de8f-5555-49d8-ab22-86112c095d27","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Look at the variance! efficient black-box explanations with sobol- based sensitivity analysis,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:581278d817b39d8bdc810054d0e330afdc5c6d5c3b21572a3a5da4e2f1145510","observation_id":"9f53df4b-8e0e-459b-a9a2-2ad885fc2248","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Top- down neural attention by excitation backprop,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:9e5f7ada287d028a46ff6edb354f737053dbf75009b557e4b8a271325bb1dbfe","observation_id":"7a54a4a5-d7dd-43ff-8627-d2a1090165b2","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","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-06-27T00:57:24.855665Z","title":"Therefore λ2G(S) +b 2 ≥F(S)≥c F(T)−η≥c λ1G(T) +b 1 −η","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:24.855665Z"},"links":{"citing_paper":"/paper/2606.18008"},"observation_digest":"sha256:320c1cc4d0a5bf5170fd78b064980280f5896454ed142f3b6a5cd37dd54bc8b8","observation_id":"2d47ef48-1de9-4d63-b314-f1a30531b3e8","resolution":{"observed_at":"2026-06-27T00:57:24.855665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.18008","last_updated":"2026-06-16T14:53:30Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-07T06:46:48.120223Z","submitted_at":"2026-06-16T14:53:30Z","title":"PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":57,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":66},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 1 inbound Pith citation observation for arXiv:2606.18008."}