{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.26364","arxiv_id":"2604.26364","integrity":{"available":true,"endpoint":"/pith/2604.26364/integrity.json","summary":{"critical":0,"advisory":8,"informational":0,"by_detector":{"doi_compliance":{"total":8,"critical":0,"advisory":8,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-21T00:38:05.188463Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T20:13:15.428352Z","findings_count":8}],"findings":[{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978−3−642−04081−8) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978−3−642−04081−8","detected_arxiv_id":null,"ref_index":4,"audited_at":"2026-05-19T20:13:15.428352Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0019−9958(83) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/S0019−9958(83","detected_arxiv_id":null,"ref_index":26,"audited_at":"2026-05-19T20:13:15.428352Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0890−5401(03) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/S0890−5401(03","detected_arxiv_id":null,"ref_index":18,"audited_at":"2026-05-19T20:13:15.428352Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4204/epT) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.4204/epT","detected_arxiv_id":null,"ref_index":3,"audited_at":"2026-05-19T20:13:15.428352Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s00224−014−9595−z) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/s00224−014−9595−z","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-05-19T20:13:15.428352Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0022−0000(79) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/0022−0000(79","detected_arxiv_id":null,"ref_index":12,"audited_at":"2026-05-19T20:13:15.428352Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/3−540−12896−4) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/3−540−12896−4","detected_arxiv_id":null,"ref_index":25,"audited_at":"2026-05-19T20:13:15.428352Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0304−3975(81) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/0304−3975(81","detected_arxiv_id":null,"ref_index":21,"audited_at":"2026-05-19T20:13:15.428352Z"}],"snapshot_sha256":"4bd9ea864560107aa4b993af1fed1f1eace82ad999df3421e561ff202ad246de"},"events":[{"event_id":2862,"event_type":"pith.integrity.v1","payload_sha256":"7ca64339ac3491793f92f09957b75d5b3056029b45b87a298f81c6323c38dadc","signature_b64":"U4rNm4SEmrK56Otp49YNr8fwLSmYWZhYZrBNGuifMyTH16jBE51M+ZsyALPgmUwqpeMLW2cAYyDBCK3c5Wm5Bw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T20:17:21.244278+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0019−9958(83) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"path(doi: 10.1016/S0019−9958(83)80051−5). This work is licensed under the Creative Commons Attribution License. T o view a copy of this license, visithttps://creativecommons.org/licenses/by/4.0/or send a letter to Creative Commons, 171 Seco","arxiv_id":"2604.26364","detector":"doi_compliance","evidence":{"ref_index":26,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"path(doi: 10.1016/S0019−9958(83)80051−5). This work is licensed under the Creative Commons Attribution License. T o view a copy of this license, visithttps://creativecommons.org/licenses/by/4.0/or send a letter to Creative Commons, 171 Seco","reconstructed_doi":"10.1016/S0019−9958(83"},"severity":"advisory","ref_index":26,"audited_at":"2026-05-19T20:13:15.428352Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/S0019−9958(83","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c0129d4153b8ed6e2926136fc77817ae6ef082e3fb5022591f6fa0ead12cc332","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2861,"event_type":"pith.integrity.v1","payload_sha256":"f4acbf73ec502d56600a85bb1f969de50cece5c916c034470af14006494f42d1","signature_b64":"vSG7s4/0HhzGbkyeOieW5S/8JslSpEitb30Q4NMQV7zzex8ZSJBOB0UH0sE7NLMvpu5vWuR/gCPRhrazvooVAg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T20:17:21.242590+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/3−540−12896−4) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"[VW84] M.Y. Vardi and P. Wolper. Yet Another Process Logic. InLP’83, LNCS 164, pages 501–512. Springer, 1984.path(doi: 10.1007/3−540−12896−4 383). [Wil01] Thomas Wilke. Alternating tree automata, parity games, and modal µ-calculus.Bulletin ","arxiv_id":"2604.26364","detector":"doi_compliance","evidence":{"ref_index":25,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"[VW84] M.Y. Vardi and P. Wolper. Yet Another Process Logic. InLP’83, LNCS 164, pages 501–512. Springer, 1984.path(doi: 10.1007/3−540−12896−4 383). [Wil01] Thomas Wilke. Alternating tree automata, parity games, and modal µ-calculus.Bulletin ","reconstructed_doi":"10.1007/3−540−12896−4"},"severity":"advisory","ref_index":25,"audited_at":"2026-05-19T20:13:15.428352Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/3−540−12896−4","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"348901e14b93665f9d28d48292a749d0e813cac74ff98f1c61f702240e302921","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2860,"event_type":"pith.integrity.v1","payload_sha256":"1276678bf9929d9f15714a9b4a208ed48314886d5e98c40b982d82438056fa1f","signature_b64":"KjHagQRfgRMpHxDrNVkstPFcNWNosbR1yU8xCQx/oCo3JHpDLJoFQ8Ag1pB1C2RYZhe3Pj3EUDqVoxnzqyxsBA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T20:17:21.240154+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0304−3975(81) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"path(doi: 10.1016/0304−3975(81)90110−9). [Pot95] A. Potthoff. First-Order Logic on Finite Trees. InTAPSOFT’95, pages 123–139. Springer,","arxiv_id":"2604.26364","detector":"doi_compliance","evidence":{"ref_index":21,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"path(doi: 10.1016/0304−3975(81)90110−9). [Pot95] A. Potthoff. First-Order Logic on Finite Trees. InTAPSOFT’95, pages 123–139. Springer,","reconstructed_doi":"10.1016/0304−3975(81"},"severity":"advisory","ref_index":21,"audited_at":"2026-05-19T20:13:15.428352Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0304−3975(81","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2d209854567ebb5664bd22c3196a2df715d6c9679ae0c2bab99f1b941df9f452","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2859,"event_type":"pith.integrity.v1","payload_sha256":"5632a8704b680dcf7f174ea0c3a7f784b0e74704bf6b09996660eb6e3e3d3e8b","signature_b64":"DOzSRozVXPbovZ8XeHE2lcrHLjssNs5ShPGjV+pwF+JI6cWhD3z8rYmCx8PPd2QhBr+AKmaNt97PaaGTqryuAQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T20:17:21.238724+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0890−5401(03) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"[MR03] F. Moller and A.M. Rabinovich. Counting on CTL*: On the Expressive Power of Monadic Path Logic. 184(1):147–159, 2003.path(doi: 10.1016/S0890−5401(03)00104−4). 38 M. BENERECETTI, D. DELLA MONICA, A. MATTEO, F. MOGAVERO, AND G. PUPPIS ","arxiv_id":"2604.26364","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"[MR03] F. Moller and A.M. Rabinovich. Counting on CTL*: On the Expressive Power of Monadic Path Logic. 184(1):147–159, 2003.path(doi: 10.1016/S0890−5401(03)00104−4). 38 M. BENERECETTI, D. DELLA MONICA, A. MATTEO, F. MOGAVERO, AND G. PUPPIS ","reconstructed_doi":"10.1016/S0890−5401(03"},"severity":"advisory","ref_index":18,"audited_at":"2026-05-19T20:13:15.428352Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/S0890−5401(03","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"276adf0e0cfd92f142de449646ae34136d5e8d47f949af594c81c635b967f446","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2858,"event_type":"pith.integrity.v1","payload_sha256":"a9564fcc727e5fe375c004690554ae53101c3ffb86d82d85ca2e6d5b68f5e3f2","signature_b64":"07C7IqF3PBQAdHB5WNvw7XgjMlTgvriLOXWENQ09X0XsnZXA+mYYjhv6jdtubjpwdD3YnnZ9Gj+yvRAxUr0mBw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T20:17:21.237506+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0022−0000(79) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"[FL79] M.J. Fischer and R.E. Ladner. Propositional Dynamic Logic of Regular Programs.JCSS, 18(2):194–211, 1979.path(doi: 10.1016/0022−0000(79)90046−1). [Flu85] J. Flum. Characterizing Logics. InModel-Theoretic Logics, pages 77–120. Springer","arxiv_id":"2604.26364","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"[FL79] M.J. Fischer and R.E. Ladner. Propositional Dynamic Logic of Regular Programs.JCSS, 18(2):194–211, 1979.path(doi: 10.1016/0022−0000(79)90046−1). [Flu85] J. Flum. Characterizing Logics. InModel-Theoretic Logics, pages 77–120. Springer","reconstructed_doi":"10.1016/0022−0000(79"},"severity":"advisory","ref_index":12,"audited_at":"2026-05-19T20:13:15.428352Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0022−0000(79","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"133938116c1b880ed6498d4fb8d95183899df0532f700eb269e82ea07e14db8e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2857,"event_type":"pith.integrity.v1","payload_sha256":"fd9de5a0e50af045cdd67ae775eac477538ac89688e07b3b9e1ffaf1020fb000","signature_b64":"1+oQ/RR1dPN78droejC93ddM4XnPed9mxstSmB/65ZpbtUuiWNeKsQuuH2Kiyzw7rfVT8fr/Qt8IknZlS52nBw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T20:17:21.236261+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s00224−014−9595−z) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"path(doi: 10.1007/s00224−014−9595−z). [BLS22] Udi Boker, Karoliina Lehtinen, and Salomon Sickert. On the translation of automata to lin- ear temporal logic. InInternational Conference on Foundations of Software Science and Computation Struc","arxiv_id":"2604.26364","detector":"doi_compliance","evidence":{"ref_index":5,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"path(doi: 10.1007/s00224−014−9595−z). [BLS22] Udi Boker, Karoliina Lehtinen, and Salomon Sickert. On the translation of automata to lin- ear temporal logic. InInternational Conference on Foundations of Software Science and Computation Struc","reconstructed_doi":"10.1007/s00224−014−9595−z"},"severity":"advisory","ref_index":5,"audited_at":"2026-05-19T20:13:15.428352Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s00224−014−9595−z","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c23a01741734ff7fea439e96d89628532b3309c0a3dee4f1561bd1a7f3025a24","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2856,"event_type":"pith.integrity.v1","payload_sha256":"8fe053ae8d0168f9c22121994e0709cbf4349bd39b9bdcd07e0463e1d60e6886","signature_b64":"zGYT7Lgq4nvol4o1PMFpUgyNm365LP5Gnp8rHQHWc7m/5zH2lF+dalBriVepReSaoim0CbOqhD/D0cQWk74kBQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T20:17:21.234648+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978−3−642−04081−8) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"path(doi: 10.1007/978−3−642−04081−8 10). [BIS13] M. Boja´ nczyk, T. Idziaszek, and M. Skrzypczak. Regular Languages of Thin Trees. InSTACS’13, LIPIcs 20, pages 562–573. Leibniz-Zentrum fuer Informatik,","arxiv_id":"2604.26364","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"path(doi: 10.1007/978−3−642−04081−8 10). [BIS13] M. Boja´ nczyk, T. Idziaszek, and M. Skrzypczak. Regular Languages of Thin Trees. InSTACS’13, LIPIcs 20, pages 562–573. Leibniz-Zentrum fuer Informatik,","reconstructed_doi":"10.1007/978−3−642−04081−8"},"severity":"advisory","ref_index":4,"audited_at":"2026-05-19T20:13:15.428352Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978−3−642−04081−8","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3caf9a087184ec2a8ad1ad4d56b0ad92276d376d4328599a2439684f72d67429","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2855,"event_type":"pith.integrity.v1","payload_sha256":"8ce664d237cb71d4a49d2f7817211c56b04047c40d1ccc7a9e5adfd5964f751d","signature_b64":"zBti7FOzo3t1/poFliRKimvItjwKxpYQo6Ln0ChAGRh0XHpwW0dfTLNzEB6td+AxBTyh+8R4v1XYSLsUhxBLCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T20:17:21.233449+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4204/epT) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"path(doi: 10.4204/EP T CS.428.5). [BI09] M. Boja´ nczyk and T. Idziaszek. Algebra for Infinite Forests with an Application to the Temporal logic EF. InCONCUR’09, LNCS 5710, pages 131–145. Springer,","arxiv_id":"2604.26364","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"path(doi: 10.4204/EP T CS.428.5). [BI09] M. Boja´ nczyk and T. Idziaszek. Algebra for Infinite Forests with an Application to the Temporal logic EF. InCONCUR’09, LNCS 5710, pages 131–145. Springer,","reconstructed_doi":"10.4204/epT"},"severity":"advisory","ref_index":3,"audited_at":"2026-05-19T20:13:15.428352Z","event_type":"pith.integrity.v1","detected_doi":"10.4204/epT","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"bb69655ebc6e16fdff77bc01e0994d92cb06f39cb3410e97829971330cdb24c7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.26364/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}