{"as_of":"2026-08-18T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:10bd63bd8f0c88a0113e220f95288a609ab5cb41d7dad9bfdbf3aba8c4142c74","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:48:59.949648Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2505.09640/citation-record","integrity":"/paper/2505.09640/integrity","json":"/paper/2505.09640/citation-record.json","paper":"/paper/2505.09640"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:48:59.699615Z","title":"Machine bias","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.699615Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:14abde7926ab08fcaf49334376cba879cb06dc79046c98d31c105b60661bba54","observation_id":"98b12b60-3e9a-4a41-91bc-c9600a283d2a","resolution":{"observed_at":"2026-08-15T23:48:59.699615Z","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-15T23:49:00.890270Z","title":"On the complexity of SHAP-score-based explanations: Tractability via knowledge compilation and non-approximability results","venue":null,"work_id":"153f26d0-bb37-4f68-a170-0893f8007c25","year":2023},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.705490Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:cfe56672902be7fb894e628b120afef1d32e3a7c9d4929f9296e8317d7736327","observation_id":"77c068b7-ea1a-4c80-832f-171fab90f747","resolution":{"observed_at":"2026-08-15T23:49:00.895595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.05266","last_updated":"2021-09-04T07:06:26Z","snapshot_observed_at":"2026-08-16T18:03:49.716457Z","submitted_at":"2021-08-11T15:08:11Z","title":"On the Explanatory Power of Decision Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.05266","snapshot_observed_at":"2026-08-15T23:48:59.710681Z","title":"On the explanatory power of decision trees","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.710681Z"},"links":{"cited_paper":"/paper/2108.05266","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:5a88ec614a03c785a010b3418cd425ee90c234e1b99057951144802e4d98c952","observation_id":"14cb3f6a-8c94-4cff-8917-36719408fad2","resolution":{"observed_at":"2026-08-15T23:48:59.710681Z","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-15T23:49:00.872741Z","title":"On tractable XAI queries based on compiled represen- tations","venue":null,"work_id":"d17df94c-0072-4eab-8188-c8c80ad64556","year":2020},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.716197Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:43e0f39719ca9bcf600d9921649809556e32ddf45c29d16a57512956854a4024","observation_id":"377d2f02-5353-4dea-8fe1-577d17a106f0","resolution":{"observed_at":"2026-08-15T23:49:00.878902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.855645Z","title":"Computing abductive explana- tions for boosted trees","venue":null,"work_id":"a3f98794-7761-41cb-b321-9854a6f234fb","year":2023},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.721052Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:4290dd5d1131cce241342cad2dc56d21f88c42e0bac3e5a37ab886da8f3b5998","observation_id":"49a75644-8030-419c-94df-5435147d3b64","resolution":{"observed_at":"2026-08-15T23:49:00.861494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.839593Z","title":"Model interpretability through the lens of computational complexity","venue":null,"work_id":"ae341961-f1ca-4af8-be7c-e2626a3488b4","year":2020},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.726141Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:651bb7329fa278514418b9da722929edd0d72f28079ce3155b7f385076ff4666","observation_id":"a7104091-52a2-4977-823f-7ff1f32053e1","resolution":{"observed_at":"2026-08-15T23:49:00.844582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.823394Z","title":"Compiling neural network classifiers into boolean circuits for efficient SHAP-score computation","venue":null,"work_id":"71f87b71-5083-4285-a62d-39635cfa4aa2","year":2023},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.731993Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:fff4b37a4e8cc1a3acdb610c854ed08ab84eaa67968dc0b73123767f661fe7c5","observation_id":"fa649bb3-54aa-40a9-aff9-a934c6c241be","resolution":{"observed_at":"2026-08-15T23:49:00.828549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.804576Z","title":"Causality-based explanation of classification outcomes","venue":null,"work_id":"0cd45629-c20f-48fd-8085-4371195dbdba","year":2020},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.736885Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:34397879ec71a32116f05d35da82cfe7eaab7fbf763f71bd6705a58269b8d454","observation_id":"ae5f5cc8-7302-4b74-88dd-a421397f4315","resolution":{"observed_at":"2026-08-15T23:49:00.811299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.787416Z","title":"Consistent subsets of inconsistent systems: structure and behaviour","venue":null,"work_id":"1abf8947-a4e8-49aa-9991-a34a4a2f3b14","year":2003},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.741666Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:2525ac73e7be9d252bfafd00106398ed8abafc2219bf599874e4107a680cb85c","observation_id":"9af2d418-ceaf-47fb-8b3d-aac576c680d1","resolution":{"observed_at":"2026-08-15T23:49:00.792582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.769626Z","title":"The second machine age: Work, progress, and prosperity in a time of brilliant technologies","venue":null,"work_id":"3043a247-dc9c-4912-9a35-ea96f0102399","year":2014},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.746877Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:622da0630be8623173fc8af09b1e227c9f0d35618702fc19d791f9d7904e94c8","observation_id":"b19545e5-5e74-4583-a7f8-aecc0f057a88","resolution":{"observed_at":"2026-08-15T23:49:00.774830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.752326Z","title":"What can machine learning do? Workforce implications","venue":null,"work_id":"f0f9545a-75df-4fff-a79e-3932610d921f","year":2017},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.751765Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:38a54efa39a0c5148f9e7880594e572423ecf5308a6c2118660b00c1a0e80224","observation_id":"1b03020f-f4aa-4eed-86bd-a9530b89760d","resolution":{"observed_at":"2026-08-15T23:49:00.757886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.734152Z","title":"Tractable explaining of multivariate decision trees","venue":null,"work_id":"6b967f3e-7be0-40b5-9849-a96cee8c2766","year":2023},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.757400Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:e36325928668a3a5cb10d47f069e2f9ec89b2215ebd2574f9b0996c2bd51009f","observation_id":"96bb9a5d-85ba-47e9-806d-5d623fda75f5","resolution":{"observed_at":"2026-08-15T23:49:00.739530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.714023Z","title":"New advances in compiling CNF to decomposable negation normal form","venue":null,"work_id":"f42614a8-fb9c-4849-91c8-2bf94450f9d4","year":2004},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.762304Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:9df1ed62619fb2131449c5e58f66a1b1631201a6dcb566e3f14e86aa26f2802f","observation_id":"75eba278-62f2-41ca-aa3c-520595e99773","resolution":{"observed_at":"2026-08-15T23:49:00.720974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.695108Z","title":"On the computation of necessary and sufficient explanations","venue":null,"work_id":"f39063e8-a99a-423a-bc98-bcb12af71cf2","year":2022},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.768181Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:e0e6854328fc1435cfc8ed32653fb873c8dface260388688186c7b185d7cc497","observation_id":"0a4d89df-ae7d-4594-bdfb-96336b2c8d0e","resolution":{"observed_at":"2026-08-15T23:49:00.701168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.678304Z","title":"A knowledge compilation map","venue":null,"work_id":"736e9569-7cd6-4add-b008-fc15f80380f3","year":2002},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.773097Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:a5ba6afe29fec725d7987bb5f88482c2d014ba2a5ec70051a2a61ac6656a1aa0","observation_id":"243e4296-f678-4acd-9534-70ebd2ef36ae","resolution":{"observed_at":"2026-08-15T23:49:00.683765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13721","last_updated":"2020-11-27T13:11:32Z","snapshot_observed_at":"2026-08-16T19:02:51.721737Z","submitted_at":"2020-11-27T13:11:32Z","title":"Lower Bounds for Approximate Knowledge Compilation","version":1},"cited_work":{"arxiv_id":"2011.13721","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.13721","snapshot_observed_at":"2026-08-15T23:49:00.135560Z","title":"Lower Bounds for Approximate Knowledge Compilation","venue":"cs.AI","work_id":"f5e6692f-f7f0-4fb1-8a7f-86abf4008cd8","year":2020},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.777843Z"},"links":{"cited_paper":"/paper/2011.13721","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:9af0b3ade15529e9dd14b768bdf52c2bd798fc35fa060f106cd3a0cd6e673ab2","observation_id":"0475cd14-e1b9-4d9b-b55b-eb280d1dc320","resolution":{"observed_at":"2026-08-15T23:49:00.141221Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.659942Z","title":"Coordinated plan on Artificial Intelligence","venue":null,"work_id":"3ad1614e-4c89-429b-8a24-a1c827f54d98","year":2018},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.783311Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:679a3f771952d13cacc03fca4ab4d107c7bd00e31acf68983b4169cf168298c6","observation_id":"11da3c99-0fd0-4a54-b79c-789faa437b0b","resolution":{"observed_at":"2026-08-15T23:49:00.665689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.637527Z","title":"Shapley values for feature selection: The good, the bad, and the axioms","venue":null,"work_id":"a90fa469-d593-470b-a3f8-a4f607e82f6b","year":2021},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.788157Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:ad231292395d039b319df959306251857945d0fbf9a13a1a9ca1e6e00fbadaf3","observation_id":"982c3c59-e316-4007-9280-35566ba302ac","resolution":{"observed_at":"2026-08-15T23:49:00.645014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.617464Z","title":"The minimal hitting set generation problem: algorithms and computation","venue":null,"work_id":"a3d84504-b861-4c76-a205-640bc09a7861","year":2017},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.792942Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:8abd1eac81323937800abd2c11dd3935f4d1566378a9aa6351135b4221a34ff3","observation_id":"0bdc9e39-e091-405e-9064-3d3e1ee4fba5","resolution":{"observed_at":"2026-08-15T23:49:00.623557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15800","last_updated":"2025-07-03T22:45:39Z","snapshot_observed_at":"2026-08-16T14:23:49.773540Z","submitted_at":"2024-01-28T23:14:51Z","title":"Statistical Significance of Feature Importance Rankings","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15800","snapshot_observed_at":"2026-08-15T23:48:59.797757Z","title":"Goldwasser and G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.797757Z"},"links":{"cited_paper":"/paper/2401.15800","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:77dc4c6da2e31294f2700a32ee1ed784054252e6c5870dfccbeb06aa0316b872","observation_id":"6912c7cf-b5fd-4a60-8ab5-22a5bb257bf1","resolution":{"observed_at":"2026-08-15T23:48:59.797757Z","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-15T23:49:00.599494Z","title":"right to explanation","venue":null,"work_id":"27cf53ae-f9d2-4963-8539-2c7884037a4e","year":2017},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.802907Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:c97362884c10230da8b39f531eebc0e81764ce969df89b73d72abe70a1bcce6a","observation_id":"57a17748-f7b0-4ccc-b2e7-4bbc145b245b","resolution":{"observed_at":"2026-08-15T23:49:00.605174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.578040Z","title":"DARPA’s Explainable Artificial Intelligence (XAI) Program","venue":null,"work_id":"2ac40187-115b-4092-8a77-a73de4f179da","year":2019},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.807678Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:970a0084d04f487e6dc94122b48e433e89af4d9099eda5cae9b4937f2e3dfa76","observation_id":"7175dc55-4e7c-471b-af00-6bad7ce01d37","resolution":{"observed_at":"2026-08-15T23:49:00.585727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.557640Z","title":"Causes and explanations: A structural-model approach","venue":null,"work_id":"17ee7c50-87a7-42b4-947a-b297a84ab806","year":2005},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.812573Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:869023ba6d494ef99e2dde4612cb2c79a79c6a05b593877e1af8741ec446caa2","observation_id":"1a991bfb-d85c-43d2-8766-5de4ae067e27","resolution":{"observed_at":"2026-08-15T23:49:00.564202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.540642Z","title":"Feature necessity & relevancy in ML classifier explanations","venue":null,"work_id":"3f1b520f-32af-4c22-9f00-7801456da7c2","year":2023},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.818000Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:00dd6ed63e82f643b3f7add2068452a13a42588c3c394c7bfeb90b3360d3075a","observation_id":"36dad976-2987-4870-bfda-72afeef0f940","resolution":{"observed_at":"2026-08-15T23:49:00.546215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.519652Z","title":"Tractable explanations for d-DNNF classifiers","venue":null,"work_id":"9d55ecd2-1015-4080-8948-c5ca586523e3","year":2022},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.822778Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:bc063245b16283736d9f996736386ea8c752f1f6efc53909dcacce468497df31","observation_id":"13e35029-feab-43bd-8d4d-3d260804b48f","resolution":{"observed_at":"2026-08-15T23:49:00.525173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.01654","last_updated":"2021-07-08T09:58:58Z","snapshot_observed_at":"2026-08-16T18:12:27.865530Z","submitted_at":"2021-07-04T14:45:32Z","title":"Efficient Explanations for Knowledge Compilation Languages","version":2},"cited_work":{"arxiv_id":"2107.01654","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.01654","snapshot_observed_at":"2026-08-15T23:49:00.092588Z","title":"Efficient Explanations for Knowledge Compilation Languages","venue":"cs.AI","work_id":"06fddef5-1786-44c4-86e8-4b26736b5133","year":2021},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.827685Z"},"links":{"cited_paper":"/paper/2107.01654","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:1126001c82f9c1209ca53fefc89010d123eab2c33252195312973a149d9e5d2b","observation_id":"e3c16091-50eb-4a60-9b2e-4addff213c01","resolution":{"observed_at":"2026-08-15T23:49:00.098656Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01350","last_updated":"2021-06-03T08:15:16Z","snapshot_observed_at":"2026-08-16T18:20:11.364535Z","submitted_at":"2021-06-02T17:55:41Z","title":"On Efficiently Explaining Graph-Based Classifiers","version":2},"cited_work":{"arxiv_id":"2106.01350","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.01350","snapshot_observed_at":"2026-08-15T23:49:00.064642Z","title":"On Efficiently Explaining Graph-Based Classifiers","venue":"cs.AI","work_id":"636eda78-6bc4-413b-b25e-8962701a7810","year":2021},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.832639Z"},"links":{"cited_paper":"/paper/2106.01350","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:5f7bfa24ca75b673508fb4d43d1e971596ad8a640cbc22a72edb2d0cb68a5dec","observation_id":"f2982344-5420-4261-bf41-6a52ad73330b","resolution":{"observed_at":"2026-08-15T23:49:00.072301Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.08160","last_updated":"2023-02-16T09:19:14Z","snapshot_observed_at":"2026-08-16T15:54:57.236116Z","submitted_at":"2023-02-16T09:19:14Z","title":"The Inadequacy of Shapley Values for Explainability","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.08160","snapshot_observed_at":"2026-08-15T23:48:59.838346Z","title":"The inadequacy of Shapley values for explainability","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.838346Z"},"links":{"cited_paper":"/paper/2302.08160","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:97659263e1e747a8e0da9253344f8c928296d9caa12ab53eaca6583dd660ee8f","observation_id":"b705929e-566b-405a-a37f-42ad4da0c354","resolution":{"observed_at":"2026-08-15T23:48:59.838346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11034","last_updated":"2020-10-21T14:33:53Z","snapshot_observed_at":"2026-08-17T15:14:03.035923Z","submitted_at":"2020-10-21T14:33:53Z","title":"On Explaining Decision Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11034","snapshot_observed_at":"2026-08-15T23:48:59.843497Z","title":"On explaining decision trees","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.843497Z"},"links":{"cited_paper":"/paper/2010.11034","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:dd0854ea250b9b58738eb431af18d20a019cab9c0ac22c16bed8abf5c5671f77","observation_id":"079b868c-533f-4ec0-b682-8bd5ccf1d870","resolution":{"observed_at":"2026-08-15T23:48:59.843497Z","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-15T23:49:00.501270Z","title":"Algorithms for computing minimal unsatisfiable subsets of constraints","venue":null,"work_id":"29fce809-b26f-4268-a1fa-5fd40a85aea8","year":2008},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.848648Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:8a67c6fe4db94bd2204efe4bc14fa54aeec25aacea8ce75b47f6629d8bc75d66","observation_id":"4171128a-ed67-41d9-941f-a8055505a145","resolution":{"observed_at":"2026-08-15T23:49:00.506536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.483659Z","title":"Artificial intelligence: a survey on evolution, models, applications and future trends","venue":null,"work_id":"4e5f6da9-f636-4788-a508-bf824ba54fa2","year":2019},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.853602Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:a2ab61390b473f90578fc62f5ea5a12ad1500c57e0615e93f98ed4590dc9cd02","observation_id":"1b3da903-ccb7-4210-b5d7-2b0828c0e870","resolution":{"observed_at":"2026-08-15T23:49:00.489139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-15T23:48:59.858613Z","title":"A unified approach to interpreting model predictions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.858613Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:ebd1025d64689256cd5a42203028502714904c0b7358688bb33009ee4f2ba6e0","observation_id":"c0c0aa34-90d8-4d7a-82a7-9c0f77b6ea80","resolution":{"observed_at":"2026-08-15T23:48:59.858613Z","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-15T23:49:00.450625Z","title":"EU guidelines on ethics in artificial intelligence: Context and implementation","venue":null,"work_id":"c4986fdc-3ab9-4d04-80ca-ed2ade9788f6","year":2019},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.863631Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:1b4b14676bb7b7038e2da89ea3ac5a48c66b259e6b8a2f4509afbdeaa3157253","observation_id":"996c3c3e-da7d-4aba-8916-a47cd5f76b0c","resolution":{"observed_at":"2026-08-15T23:49:00.456671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.431454Z","title":"Logic-based explainability in machine learning","venue":null,"work_id":"06a6ce50-59b9-4a32-b30a-1f7798c48d2b","year":2022},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.868578Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:d42f3f59ca2f6e9202e22c8c1056973e8e9694929bab6f0252b38c4af14c2aba","observation_id":"54d65441-270f-4394-a640-0d1742da0382","resolution":{"observed_at":"2026-08-15T23:49:00.437305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.412232Z","title":"Compile! In Proceedings of the AAAI Conference on Artificial Intelligence, volume 29, 2015","venue":null,"work_id":"4dcfe961-7c88-42ec-9dc9-ec6ec9eebebf","year":2015},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.873836Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:324c178234f605146fb550093eec9b17cd3df287955f61754612b2c929ec9548","observation_id":"fce3cea5-0713-4689-b0cc-b88b0fc8d96a","resolution":{"observed_at":"2026-08-15T23:49:00.418078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12295","last_updated":"2025-02-17T20:08:03Z","snapshot_observed_at":"2026-08-16T12:57:33.859902Z","submitted_at":"2025-02-17T20:08:03Z","title":"On the Computational Tractability of the (Many) Shapley Values","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12295","snapshot_observed_at":"2026-08-15T23:48:59.878901Z","title":"On the computational tractability of the (many) Shapley values","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.878901Z"},"links":{"cited_paper":"/paper/2502.12295","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:d51ffd8863cd79b53a46fd1f39320ab69e99514c1e5bc0300e38e8bfcd811f2a","observation_id":"10180b9f-475f-42ac-b108-ba3a47a97675","resolution":{"observed_at":"2026-08-15T23:48:59.878901Z","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-15T23:49:00.391797Z","title":"Price and performance changes of computer technology with time","venue":null,"work_id":"3152dd21-e172-45ef-8b84-7f505f7b60bc","year":2023},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.883796Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:3ed859db63904f39c2422fb780c31c73b0bc98762e8053d3461aa395c0eaf4a7","observation_id":"efeb4759-7635-4b5c-9afd-742fb472e1c2","resolution":{"observed_at":"2026-08-15T23:49:00.398140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.371744Z","title":"Verifying properties of binarized deep neural networks","venue":null,"work_id":"096cceb5-6bf8-46f0-b3e9-5ff3ad1c1244","year":2018},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.888967Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:f564f9ffafb053db216cb1c34308879f0d08317ef3f0e1b74c8f67393c658cbc","observation_id":"8df41f52-de7f-4574-87c2-c309cfb5dc54","resolution":{"observed_at":"2026-08-15T23:49:00.378415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.352020Z","title":"What artificial intelligence can and can’t do right now","venue":null,"work_id":"6bea99b1-a761-4280-9e77-2ee583b8371d","year":2016},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.893826Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:fa9ad7ffe3b530d3f1048b8740ba1115c001bdf52ae5e22d67914b565db70087","observation_id":"5964f358-2be8-445f-ba54-106f5390addf","resolution":{"observed_at":"2026-08-15T23:49:00.356993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.334272Z","title":"Linear-time counting algorithms for independent sets in chordal graphs","venue":null,"work_id":"29cf8e9e-e7f6-47a5-97d9-75c2b66ac707","year":2005},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.898762Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:a22796b5b83413a918cf35d489a4babe5a01c5c220579eecb752a4c1f768e104","observation_id":"96ca34a3-d1c4-45c1-bb51-6ca9fe87fcab","resolution":{"observed_at":"2026-08-15T23:49:00.340275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.312603Z","title":"A theory of diagnosis from first principles","venue":null,"work_id":"c3be5b3d-2d22-4958-b9e9-c477d5c7557b","year":1987},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.903818Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:b3fbd432245f64a97a6ce2262120a648884b172d073e5c9b94a9f4f0bfa48032","observation_id":"76d4c932-d3b5-47f9-b9ba-4d829b2cb3d9","resolution":{"observed_at":"2026-08-15T23:49:00.319886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.295476Z","title":"Why should I trust you?","venue":null,"work_id":"6ad29ce3-2cb1-4de1-8715-6ff8f9aa2cfc","year":2016},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.908601Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:9c63e4bf2f37fa53d97298ffb8112b69cee29e8f01565ef7e1203f207694bc26","observation_id":"9b38df42-79bb-4bf0-96c2-3a4114df4cff","resolution":{"observed_at":"2026-08-15T23:49:00.300426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.02242","last_updated":"2018-05-06T16:33:52Z","snapshot_observed_at":"2026-08-18T14:51:22.821711Z","submitted_at":"2018-05-06T16:33:52Z","title":"Reachability Analysis of Deep Neural Networks with Provable Guarantees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.02242","snapshot_observed_at":"2026-08-15T23:48:59.913197Z","title":"Reachability analysis of deep neural networks with provable guarantees","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.913197Z"},"links":{"cited_paper":"/paper/1805.02242","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:d766e59429864a75175b13e50aee9a621ca46e4e506ea2d99dc49a9533b265db","observation_id":"01a3994d-67ba-4256-b293-ded690e43b27","resolution":{"observed_at":"2026-08-15T23:48:59.913197Z","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-15T23:49:00.277347Z","title":"Tracing the evolution of AI in the past decade and forecasting the emerging trends","venue":null,"work_id":"59424ab6-34db-41ef-9e4d-56ed254b2090","year":2022},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.918941Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:4317f22667cd7f50d1845128431b5168dbf65427b497a7338abb9df3fc51f15e","observation_id":"80a7a0e8-6e02-4684-9186-1eca1ecbc47b","resolution":{"observed_at":"2026-08-15T23:49:00.283267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-15T23:48:59.923724Z","title":"A value for n-person games","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.923724Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:4e11a778cfb779532976a9d6cecdf3ca94d2adf0ad9810068a0ca8c0a99fb180","observation_id":"73485cf2-ec76-4978-87ed-734044209e39","resolution":{"observed_at":"2026-08-15T23:48:59.923724Z","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-15T23:49:00.246893Z","title":"Amount of data created, consumed, and stored 2010-2023, with forecasts to 2028","venue":null,"work_id":"14599f26-10f5-4e26-bf35-7eb84461101e","year":2010},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.928385Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:73f6aaa06f6863fe37deb29216b12de734c63c1f295bffe88b07c04926d46033","observation_id":"b79746ce-a72d-479e-a430-dc03392c7c49","resolution":{"observed_at":"2026-08-15T23:49:00.252311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.228620Z","title":"A survey on explainable artificial intelligence (XAI): Toward medical XAI","venue":null,"work_id":"ac3097fb-8f4a-4638-b07c-8f7d7138ba74","year":2020},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.933186Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:8560494d5959edd41cd3340641f921e26243099d96a1e756d89208a6cd7b5750","observation_id":"5dc2c84e-7025-4966-aa87-61008c3fbe81","resolution":{"observed_at":"2026-08-15T23:49:00.233980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.210280Z","title":"On the tractability of SHAP explanations","venue":null,"work_id":"ef8ed7cf-2193-4f8a-a69a-1723170af86e","year":2022},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.939243Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:49d63735ce9d4917cb951c1126e7b23d5c04246fdfe668bcb978f718ef6ead8e","observation_id":"12419bb9-5d8f-43d6-9a32-e2feb4f6e6d4","resolution":{"observed_at":"2026-08-15T23:49:00.216009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.191903Z","title":"Research on the prediction of bike sharing system’s demand based on linear regression model","venue":null,"work_id":"63d7bf32-b7f6-4bc5-9056-ee65878657ac","year":2024},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.944675Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:8380e9272498b844fa5c9b3a34eadf6310127ba41cc4b0922a40fceab2be44fa","observation_id":"841e4545-9960-413e-a2d0-f6d9467aaf80","resolution":{"observed_at":"2026-08-15T23:49:00.198116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:49:00.173132Z","title":"A multivariate regression analysis of factors influencing california housing prices","venue":null,"work_id":"da072bfd-40c2-4150-96fd-f5c403a81212","year":2023},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.949648Z"},"links":{"citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:c6fc24fc05edf3b4eafe61f43aded040933939d9b409fcae3fd3547d5c4dd27e","observation_id":"9e5f4e4c-4979-4be5-8bad-ac2c4085eac7","resolution":{"observed_at":"2026-08-15T23:49:00.179464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":3,"verified_fuzzy":38},"total_outbound_references":50},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2505.09640."}