{"as_of":"2026-08-06T03:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f8a1cc5060ad605c2cbd19833d5b6eace7847a4f4c6739e06f3acaabb629648","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T01:55:53.584473Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/2602.13351/citation-record","integrity":"/paper/2602.13351/integrity","json":"/paper/2602.13351/citation-record.json","paper":"/paper/2602.13351"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Aho, Ravi Sethi, and Jeffrey D","venue":null,"work_id":"2d79b1ff-f086-4b2e-8dd6-b1773fea7e8d","year":1986},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:85204a2c82d354c27d9202877613642e9e2782399a7e16ad358eee47cc0db7d3","observation_id":"36ef7040-6c7d-40ad-b0bf-1b11ea782bab","resolution":{"observed_at":"2026-05-16T01:57:06.160090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Explainable artificial intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI.Inf","venue":null,"work_id":"da93d93b-7165-42a5-bd11-6104e76c2577","year":2020},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:d7e67940efb65429e6d3c06accaf28c4e0a87deb0d13ab2ff822dccca17cb2d9","observation_id":"6c256e29-d64f-4d3c-98a5-6b50e27f242a","resolution":{"observed_at":"2026-05-16T01:57:06.191752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Carroll and Darrell D","venue":null,"work_id":"509e4cd4-d5f8-425d-9965-f394ee05547b","year":1989},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:228dcbd2f2f0e8235f468b8dc29580a52fff27fb25f39609e250c4c6a8ec54e7","observation_id":"ef519efa-7ef6-4c4e-b02d-457c6d435f6f","resolution":{"observed_at":"2026-05-16T01:57:06.171462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Mata: A fast and simple finite automata library","venue":null,"work_id":"fd2d54a7-d2f0-45a2-b971-0ad4590a7297","year":2024},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:17be38c0694b0d75d5b444054fa2651ea9ee58d91749491453d05cb2ac4f2818","observation_id":"261dad2f-5250-402d-afc0-c417b6b7bbb4","resolution":{"observed_at":"2026-05-16T01:57:06.194614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Danesh, Anurag Koul, Alan Fern, and Saeed Khorram","venue":null,"work_id":"b7089e65-e821-46e1-93af-d77cc8d4e143","year":2021},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:3c194c5e6fe238968d67cdcf52e706ffa553c00fe98668b8c406b062920522eb","observation_id":"79c80031-cf3f-4d50-b257-82d1d7c36f96","resolution":{"observed_at":"2026-05-16T01:57:06.232592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Logic for explainable AI","venue":null,"work_id":"baebbf5d-ca58-4df2-93b0-81fe2fab4a9e","year":2023},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:446fe020125aaebfb34da70d0c533b7bd3cfedba6f2367498625df70cd80327b","observation_id":"a4a7b240-ef2f-4a66-8348-ec36e2b38906","resolution":{"observed_at":"2026-05-16T01:57:06.218551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"On the (complete) reasons behind decisions.J","venue":null,"work_id":"401ba537-3bf5-48b3-8934-5caf68711fa6","year":2023},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:6d9835526fcebe20c94e3ed1e442cad9e87740c1c8b62b26e005b383bf19a247","observation_id":"6c55634c-bc79-4adf-a9a3-ea63e6c39cce","resolution":{"observed_at":"2026-05-16T01:57:06.208617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"What are dna sequence motifs?Nature Biotechnology, 24(4):423–425","venue":null,"work_id":"06ccae09-db8c-42d6-8a8a-32d76736f92e","year":2006},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:2c8079612dcbb566b9ce9dcf73b71f36252326299fa27930a4b40f4d279016d2","observation_id":"e816c35d-37a5-41de-87ce-1853f6f8166e","resolution":{"observed_at":"2026-05-16T01:57:06.168510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7ceb2c61-efad-4bfc-b718-c3ddefd6cf40","year":2017},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:169df415af0275119c0a0cd344ad35a13850c3c745ffa059a6d8ae629e6906cc","observation_id":"948fd41d-2533-4df3-bdb9-ae651cefea43","resolution":{"observed_at":"2026-05-16T01:57:06.197258Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Solving optimization problems with DLL","venue":null,"work_id":"96150da0-6b91-471f-ae0d-69b2f2df4a7d","year":2006},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:8f1afec5a87b2e409ca9115505814fc9f67bfe61327ceffc464ba377ccada31e","observation_id":"7f191d0c-6de9-4ffa-970d-632a215d3918","resolution":{"observed_at":"2026-05-16T01:57:06.185268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Gurobi optimizer reference manual","venue":null,"work_id":"117b1619-087e-4286-9191-a3ce67845ab3","year":2024},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:8389a279119b95a86b7cc459dfc0e2cd045453088ae0d173b218e34b48709e6d","observation_id":"142a2427-c5fa-42b0-bf24-3787ebcf13c9","resolution":{"observed_at":"2026-05-16T01:57:06.176959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Deepsynth: Automata synthesis for automatic task segmentation in deep reinforcement learning","venue":null,"work_id":"acb76548-505d-436d-95b1-4dd813c7e7ca","year":2021},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:2e3c4940c0aa4f61ff68111cefcba3092e525d309de219c094572ce49405f956","observation_id":"ee714f31-b084-420e-9a21-58dbf9d3b09a","resolution":{"observed_at":"2026-05-16T01:57:06.157294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0125.804030","doi":"10.1145/800125.804030","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"III Hunt","venue":null,"work_id":"ef2444c9-5190-42d9-b855-5b389936bd9e","year":1973},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:62dbca16f1ea06a8345995acd15df83f3517f2caae790fb8578bae24da3c03be","observation_id":"8aa6a362-09e6-466a-86c0-a276fb58a219","resolution":{"observed_at":"2026-05-16T01:57:06.058005Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-94144-8_26","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PySAT: A Python toolkit for prototyping with SAT oracles","venue":"Lecture notes in computer science","work_id":"69cf9f0a-485f-4d11-90da-81bc9d40e68c","year":2018},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:8ce9ed2f2c7a1075270df3eb9226da3d1193475fdf402d2d11e84a33a9f1a06c","observation_id":"7e07e19d-c9aa-4305-98ff-e34e396c0956","resolution":{"observed_at":"2026-05-16T01:57:06.065177Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"RC2: an efficient maxsat solver.J","venue":null,"work_id":"ffe3adcd-4676-407c-8a74-dca925321146","year":2019},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:bf5559bf4a09b7b9985cdf6bed158bf29723a986a14006115c64d202bafb7bdc","observation_id":"d858e9c8-fb96-4774-abee-e003e5265f12","resolution":{"observed_at":"2026-05-16T01:57:06.154115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"From contrastive to abductive explanations and back again","venue":null,"work_id":"123e8388-ec03-40f1-89e7-b1c153bca6d7","year":2020},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:dafb246140916bcba50b7f55b0069b58e2c3357a4c639bb058d3fbd4502e9922","observation_id":"c06fabc5-615a-45f0-934e-ceebb2747e5e","resolution":{"observed_at":"2026-05-16T01:57:06.230188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.sat.2024.16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards universally accessible SAT technology","venue":"Monash University Research Portal (Monash University)","work_id":"72772f8a-bac9-4b0a-aabf-95a14f4c2503","year":2024},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:e6e38ce51fa0edd2cbed2c9bcf086bdf8fd2f478eb75cbd30ce93db41c8887be","observation_id":"8cc5d1bf-024c-458e-a7b1-6d5e51dc5033","resolution":{"observed_at":"2026-05-16T01:57:06.050349Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Liffiton and Ammar Malik","venue":null,"work_id":"9bdc629d-9921-4837-9260-e6f230f61cc4","year":2013},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:032517d76a7d49c1e88d403a977e7f25e829372dd90e3eec98c9a7cb3aa8731a","observation_id":"7f8c43af-e77a-4548-8642-aa44dd4f7ca3","resolution":{"observed_at":"2026-05-16T01:57:06.174271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Liffiton, Alessandro Previti, Ammar Malik, and João Marques-Silva","venue":null,"work_id":"dcff496a-8f6a-4ac8-9910-9cc9d896dbc2","year":2016},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:e8ccb31a7cabadd7b484d073cb61f67ccbe13a5d832c6f43f87de6e021f40917","observation_id":"d5a0cb9f-78c8-4f94-9a79-6b6f9495fc67","resolution":{"observed_at":"2026-05-16T01:57:06.179631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Delivering trustworthy AI through formal XAI","venue":null,"work_id":"21a098ed-5f0f-4720-9a7b-0f1d70b0aca0","year":2022},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:8f5113e2bfbfcfa910f1bc4638fc4b82f34841ff3d28c8c3595e62d5b8377d1d","observation_id":"84ee454d-30c1-4123-a7f1-c1cd259edc73","resolution":{"observed_at":"2026-05-16T01:57:06.162766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.112821","doi":"10.3389/frai.2023.1128212","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"No silver bullet: interpretable ML models must be ex- plained.Frontiers Artif","venue":"Frontiers in Artificial Intelligence","work_id":"7790bd81-77f7-423f-a5e6-4cd6a09a1d9a","year":2023},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:68e383d80a191339a5ee377de678300b2907d85c9a7a531a35348d4cd0551d75","observation_id":"eef8be67-80a9-4d20-ae2c-a92cc4dcb19a","resolution":{"observed_at":"2026-05-16T01:57:06.044784Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-10T20:19:25.757581+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T20:19:25.757581+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-09T16:56:21.987753Z","title":"Explainable reinforcement learning: A survey and comparative review.ACM Comput","venue":null,"work_id":"5fd24bbc-0ae6-4e6a-ab9e-09c8b4e52719","year":2024},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:11b57a6a962c704ee3384b133ea3f9abc50adb4d9b500610174044f82ececc7e","observation_id":"c67f924f-9fb7-4e2a-959c-68c477f241f4","resolution":{"observed_at":"2026-05-16T01:57:06.237947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Explanation in artificial intelligence: Insights from the social sciences.Artif","venue":null,"work_id":"e6c0c888-d695-4114-b8be-0be36f693b01","year":2019},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:d088189db457343570cc862e4d622a5c7d3e3d4b8d7fc88c80e5987abbc6bbe0","observation_id":"fae04ba1-53d8-438d-8cd7-5d71cc34d3d6","resolution":{"observed_at":"2026-05-16T01:57:06.165570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Finite automata","venue":null,"work_id":"79db148e-4e84-4ade-9994-2689415b3fa4","year":1990},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:41299497a4b8aa01913f04ebf79a7f442c22b98553cfb13e55c48f9a3d9f65c2","observation_id":"4fb89f78-2726-4431-9f81-4b14b3fb9903","resolution":{"observed_at":"2026-05-16T01:57:06.211066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Partial MUS enumeration","venue":null,"work_id":"761a8db7-1616-45b8-b365-b04a105fcc0e","year":2013},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:ffb75973d6926d27b7e6659513561ef5b642df4d33cfc54d900f4191c0e49fbe","observation_id":"5902d482-98f8-4476-aee2-de9ad2db3e67","resolution":{"observed_at":"2026-05-16T01:57:06.182275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Rabin and Dana S","venue":null,"work_id":"98fc9b8d-aeaa-45fb-8b0e-d7150a8ba1cc","year":1959},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:fe4f882f11d833118099109a0cd2bdc73db3fa5cece22a6a1642ffd779414eb1","observation_id":"8768e90b-e635-4497-b707-7a1d4f492800","resolution":{"observed_at":"2026-05-16T01:57:06.221115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Improved benchmarks for computa- tional motif discovery.BMC Bioinform., 8","venue":null,"work_id":"fabc51c9-614e-4358-9ddd-7859107c8624","year":2007},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:229d56202bfefc4601655841fc7f84c2621a2eb435bc89a0305d905a4ac0283d","observation_id":"ff84ae72-92ac-44aa-806f-b57d6642c53d","resolution":{"observed_at":"2026-05-16T01:57:06.223514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"PWS Publishing Company","venue":null,"work_id":"ae314527-d96f-4c96-9afd-8d6273b4f794","year":1997},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:e932dbc82815413b93ffa5801750cf7389b87b44ce26c12d4eb58ea741db5822","observation_id":"a4d70479-3cc6-49f6-8de0-49bd4ef89906","resolution":{"observed_at":"2026-05-16T01:57:06.203106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"63fe421e-deb1-4871-aabf-d6cb5c2da2c4","year":1974},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:fe998e75eb8fa1817e2601737e43b33ccc2ec3fe84827a50a91fe589feb04e53","observation_id":"e5e0d5fe-6ef2-4984-8cd6-12fc24eb4472","resolution":{"observed_at":"2026-05-16T01:57:06.216069Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"A survey on regular expression matching for deep packet inspection: Applications, algorithms, and hardware platforms.IEEE Commun","venue":null,"work_id":"6c63f55c-8a0c-4cb0-b852-784e8b0fbe92","year":2016},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:f9f9eaab6b652d3bed03c5634172a702e9deeef17cf2b5bd00ff4a902e26ef59","observation_id":"a2848b01-3d1d-4b29-92c1-01bbbed75eb8","resolution":{"observed_at":"2026-05-16T01:57:06.235193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Improving nfa-based signature matching using ordered binary decision diagrams","venue":null,"work_id":"03690965-8916-47d1-9a7b-b2917f6b4b07","year":2010},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:bd0edd36a2c84a76180892adb62a767eb80dad3f9fb9cb96568297cb4be53878","observation_id":"ce64fb16-2cff-4d4e-b73e-b56a837fc028","resolution":{"observed_at":"2026-05-16T01:57:06.200258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2775337f-8bda-475e-af96-710b9e9ecc2f","year":2024},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:0031e379b652079002759d7a58434aac59e6672dfa4a268c17dd4be0f35f3af0","observation_id":"09c61289-5930-42eb-bc8d-790ce4295673","resolution":{"observed_at":"2026-05-16T01:57:06.225578Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03380","last_updated":"2023-08-28T05:47:12Z","snapshot_observed_at":"2026-07-06T15:51:20.400240Z","submitted_at":"2023-07-07T04:20:36Z","title":"On Formal Feature Attribution and Its Approximation","version":3},"cited_work":{"arxiv_id":"2307.03380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.03380","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"accept” s.t. κ is the DFA applied to w. Similarly CXpu l (S, w) is a CXp iff S is a CXp of the classification problem κ(w) =“accept","venue":null,"work_id":"ffb46fbb-787e-4038-88c2-fe5477900ade","year":2023},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"cited_paper":"/paper/2307.03380","citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:391a35a1a90bb5a459f850242d8bf685f24ee9c245fcf57f744c032b3ba57c2b","observation_id":"a12999dc-800f-4b8a-9160-beae2ab28fc6","resolution":{"observed_at":"2026-05-16T01:57:06.075831Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"63258481-ccfb-4101-aa75-4a766bbebba7","year":null},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:73e89177c85e133817d8d493aa56a813c6bd4863eb7b015f82160cf4be7775b6","observation_id":"50bedab4-15c9-4e24-9a76-381b84cd9460","resolution":{"observed_at":"2026-05-16T01:57:06.188436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c4a2af55-148e-40f1-9476-232286620a74","year":null},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:5369d565a8c0a2363bcca2609d6a999b419c3bca297799b4b1d20d3ac1a2ab3b","observation_id":"0e46a89b-789d-4fc0-884a-42fc09eb540a","resolution":{"observed_at":"2026-05-16T01:57:06.213631Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c8de0ade-6759-4b3a-b0a4-e8e122fc5647","year":2000},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:b3f7075b47b402480ac2e6a20954271c95e6e56cf05400038b0e9f02d7411647","observation_id":"1d43fb3a-03c7-43a5-a7a6-b6b5ec615489","resolution":{"observed_at":"2026-05-16T01:57:06.227707Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"d}for l∈ {5,10,15,20} , m∈ {1,3,5,10} , 16 Table 3: Average number of explanations computed if reaching the timeout","venue":null,"work_id":"1d862970-c70d-4a9e-8faa-cec709e5b1e1","year":null},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:9442e19d0dc603ec83e52b85600566326839c6008169fce815fb37022dcc0a32","observation_id":"7ceab967-c37b-4a02-a32d-0a1a57a4f0cb","resolution":{"observed_at":"2026-05-16T01:57:06.206110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":5,"verified_fuzzy":26},"total_outbound_references":37},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2602.13351."}