Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T13:47:02.307505Z
Paper Citation Record · LEDGER
As of 8 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2505.21212.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T13:47:02.307505Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
25 of 25 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 35ac86b0-9e58-45c0-ace5-a7038ff4c222 · outbound
Interpretable DNFs Axiomatic foundations of explainability
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b78f1127-6fe8-4576-b054-cc54982e5b70 · outbound
Interpretable DNFs Computational Com- plexity: A Modern Approach
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4e99cf07-0e5d-4607-9ac3-4636bcc6bbc6 · outbound
Interpretable DNFs On the computational intelligibility of boolean classifiers
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b5449668-9eb2-43d5-9134-1300831d0726 · outbound
Interpretable DNFs Model interpretability through the lens of computational complexity
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 055a9037-4f4a-4a2a-b2f3-df5a95aaa52a · outbound
Interpretable DNFs Hypergraphs: Combinatorics of finite sets
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 9e43fa0a-1b8d-4c0d-830b-d285cd267e94 · outbound
Interpretable DNFs The query complexity of certification
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f3c93bf1-b5ae-48e4-8ab0-be6a2b1153e8 · outbound
Interpretable DNFs Unresolved cited work
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 7ae82036-3e70-4222-a4d3-9d54bb49ffe0 · outbound
Interpretable DNFs Cooper, and Jo ˜ao Marques-Silva
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0d726d23-a354-41d0-9f32-68175b9fb15d · outbound
Interpretable DNFs Diameter versus cer- tificate complexity of boolean functions
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 24868833-475f-4878-9797-8851f89037a3 · outbound
Interpretable DNFs Cooper and Leila Amgoud
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 65b8a0fc-4367-41f3-8d21-0455778a0d5c · outbound
Interpretable DNFs Cooper and Jo ˜ao Marques-Silva
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation fbe59ee5-cc6e-426d-b32f-a1503eb2f770 · outbound
Interpretable DNFs Blossom: an anytime algorithm for computing optimal decision trees
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation aa059a46-d873-4b11-a152-c7637539455f · outbound
Interpretable DNFs Bounds on depth of decision trees derived from decision rule systems with discrete attributes
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 2f1090b7-3e73-4c97-b18e-fca17d8dbf00 · outbound
Interpretable DNFs Cooper, Nicholas Asher, and Jo˜ao Marques-Silva
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f8954a5a-723c-46ed-a09e-71aabd914571 · outbound
Interpretable DNFs Stuckey, and Jo˜ao Marques-Silva
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation db8e40ee-3f6c-44c9-afd5-ec531e0d0528 · outbound
Interpretable DNFs SAT-based rigorous explanations for decision lists
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b9f9fae3-c26f-4624-8486-ba006c242e5d · outbound
Interpretable DNFs Abduction-based explanations for machine learn- ing models
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b1bf601c-ff0a-4f60-96b3-0fc8196d39dd · outbound
Interpretable DNFs On tackling explanation redundancy in decision trees.J
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 935fa850-e4a8-41d5-b44e-3f5405e50587 · outbound
Interpretable DNFs On explaining ran- dom forests with SAT
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ae99f95c-513c-42e2-a6a9-d551ded75d12 · outbound
Interpretable DNFs Logic-Based Explainability: Past, Present & Future
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 61f7597b-e059-45ff-9a85-6e1aefbaef63 · outbound
Interpretable DNFs Cooper, Alexey Ignatiev, and Nina Narodytska
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6fe743f9-bcb8-46f7-9207-823c25fdc8ec · outbound
Interpretable DNFs Cooper, Alexey Ignatiev, and Nina Narodytska
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 947bdc00-13a2-4a01-95b1-a44acb844a9b · outbound
Interpretable DNFs Interpretable Machine Learning -- A Brief History, State-of-the-Art and Challenges
Reference 23
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9c120093-f729-4459-a8a3-e36cc7dbbf6a · outbound
Interpretable DNFs Stop explaining black box machine learning models for high stakes decisions and use inter- pretable models instead
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b1d6bb04-6775-4d29-9bb7-092930097328 · outbound
Interpretable DNFs A sym- bolic approach to explaining bayesian network classi- fiers
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
No inbound Pith citation observations are available.