{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.08566","arxiv_id":"2607.08566","integrity":{"available":true,"endpoint":"/pith/2607.08566/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":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-07-27T23:08:52.810708Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-20T16:12:28.937332Z","findings_count":8},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-18T00:21:01.275062Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-07-17T02:54:44.946771Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-15T09:04:36.439671Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"completed","ran_at":"2026-07-12T09:57:22.636547Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"completed","ran_at":"2026-07-10T17:53:27.772354Z","findings_count":0}],"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.4230/lipics.icalp.2018.62.url:https://doi.org/10.4230/LIPIcs.ICALP.2018.62) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.4230/lipics.icalp.2018.62.url:https://doi.org/10.4230/LIPIcs.ICALP.2018.62","detected_arxiv_id":null,"ref_index":14,"audited_at":"2026-07-10T05:22:11.969215Z"},{"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.1137/0206024.url:http://epubs.siam.org/doi/10.1137/0206024) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/0206024","detected_arxiv_id":null,"ref_index":20,"audited_at":"2026-07-10T05:22:11.969215Z"},{"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.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.21) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.21","detected_arxiv_id":null,"ref_index":1,"audited_at":"2026-07-10T05:22:11.969215Z"},{"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/j.ic.2020.104616.url:https://www.sciencedirect.com/science/article/pii/S0890540120301048) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/j.ic.2020.104616.url:https://www.sciencedirect.com/science/article/pii/S0890540120301048","detected_arxiv_id":null,"ref_index":18,"audited_at":"2026-07-10T05:22:11.969215Z"},{"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(88) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/0022-0000(88","detected_arxiv_id":null,"ref_index":22,"audited_at":"2026-07-10T05:22:11.969215Z"},{"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/j.tcs.2005.09.023.url:https://linkinghub.elsevier.com/retrieve/pii/S0304397505005438.13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier.com/retrieve/pii/S0304397505005438.13","detected_arxiv_id":null,"ref_index":24,"audited_at":"2026-07-10T05:22:11.969215Z"},{"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.1109/focs46700.2020.00095.url:https://doi.org/10.1109/FOCS46700.2020.00095) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1109/focs46700.2020.00095.url:https://doi.org/10.1109/FOCS46700.2020.00095","detected_arxiv_id":null,"ref_index":7,"audited_at":"2026-07-10T05:22:11.969215Z"},{"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.4230/LIPIcs.CPM.2016.8.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.4230/LIPIcs.CPM.2016.8.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8","detected_arxiv_id":null,"ref_index":19,"audited_at":"2026-07-10T05:22:11.969215Z"}],"snapshot_sha256":"3232eddf8bcdef16268bab32b0a51ea3b3090d00db94665e360b7c0e343ac432"},"events":[{"event_id":11844,"event_type":"pith.integrity.v1","payload_sha256":"a7f3ce687d0c5f78e71d1baca28c862a8d2473be412df35917946fb692f64591","signature_b64":"ldQO+uGl15jn1wdilIEIcSWCQJw8+mM11l2cIkYcDNjMkBT38sW2y5AkzLVVr9PKa+6d85OlEvdqYmS/wINaAg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-10T05:23:51.202006+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier.com/retrieve/pii/S0304397505005438.13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Ryan Williams. “A New Algorithm for Optimal 2-Constraint Satisfaction and Its Im- plications.” In:Theoretical Computer Science348.2–3 (Dec. 2005), pp. 357–365.issn: 03043975.doi:10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier. com","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":24,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Ryan Williams. “A New Algorithm for Optimal 2-Constraint Satisfaction and Its Im- plications.” In:Theoretical Computer Science348.2–3 (Dec. 2005), pp. 357–365.issn: 03043975.doi:10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier. com","reconstructed_doi":"10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier.com/retrieve/pii/S0304397505005438.13"},"severity":"advisory","ref_index":24,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier.com/retrieve/pii/S0304397505005438.13","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0f0f7583bdd7e6a52cddff78ed88a794c93bcab6ee22f7447e3ec7211b51bb73","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":11843,"event_type":"pith.integrity.v1","payload_sha256":"4ceeb7177dce7426a69613436147e889e8202988b5ffdb602c7906b8f0eed980","signature_b64":"+YVYOaLKR678a+Drgr62CDwoxif45bDETaLO14lrN/XoLc1jMNCKNaO0MzlojGF2SYeWdJnAhBC1KuK5Zp/SCQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-10T05:23:51.200820+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0022-0000(88) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"GadM.LandauandUziVishkin.“FastStringMatchingwithkDifferences.” In:J. Comput. Syst. Sci.37.1 (1988), pp. 63–78.doi:10.1016/0022- 0000(88)90045- 1.url:https: //doi.org/10.1016/0022-0000(88)90045-1","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":22,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"GadM.LandauandUziVishkin.“FastStringMatchingwithkDifferences.” In:J. Comput. Syst. Sci.37.1 (1988), pp. 63–78.doi:10.1016/0022- 0000(88)90045- 1.url:https: //doi.org/10.1016/0022-0000(88)90045-1","reconstructed_doi":"10.1016/0022-0000(88"},"severity":"advisory","ref_index":22,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0022-0000(88","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"f41dc4bf52afadbfe155baad98658adddf651d7c455642bc3d32aaa5e34d9c0e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":11842,"event_type":"pith.integrity.v1","payload_sha256":"7897d901409f229c791d5d293250d9bc77b00f16c32a4225aab7112db66b5989","signature_b64":"pCyfjYdUbg8xidSwy2abNDMxeU7he2i/SWtLWMfxJG+rzmWGnnbzTBMSn4S+zES6SpoQKUx33nIZorpk0WRnAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-10T05:23:51.199716+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/0206024) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Donald E. Knuth, James H. Morris Jr., and Vaughan R. Pratt. “Fast Pattern Matching in Strings.” In:SIAM Journal on Computing6.2 (June 1977), pp. 323–350.issn: 0097- 5397, 1095-7111.doi:10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/ ","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":20,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Donald E. Knuth, James H. Morris Jr., and Vaughan R. Pratt. “Fast Pattern Matching in Strings.” In:SIAM Journal on Computing6.2 (June 1977), pp. 323–350.issn: 0097- 5397, 1095-7111.doi:10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/ ","reconstructed_doi":"10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/0206024"},"severity":"advisory","ref_index":20,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/0206024","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"84342b3a6281abdd199050f1d37367b4619b8411d9ce3e2929dd6d95e4971c09","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":11841,"event_type":"pith.integrity.v1","payload_sha256":"b09658927a585f3cceea211053bb39c205a927e81af019a69c589be2b45b0839","signature_b64":"h9xjXsIa5dqJs/w/ueYYDx1433m6jn/U/09jTBIVEM74y/GhYrKG7pKPfP1Pef0oBtPepyaMIPmBvM0rY3BADQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-10T05:23:51.198487+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPIcs.CPM.2016.8.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Costas S. Iliopoulos and Jakub Radoszewski. “Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.” In:27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). Ed. by Roberto Grossi an","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Costas S. Iliopoulos and Jakub Radoszewski. “Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.” In:27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). Ed. by Roberto Grossi an","reconstructed_doi":"10.4230/LIPIcs.CPM.2016.8.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8"},"severity":"advisory","ref_index":19,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPIcs.CPM.2016.8.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"55e4a6bc2601a3496a31761cd353d1babde64e123914baeb77ce556d37bcf8d4","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":11840,"event_type":"pith.integrity.v1","payload_sha256":"881bfb4999ee69b53dc3c681729241e70c4afd36f5280c99239fb700e668916d","signature_b64":"v4UYg5Sqw3qqHi3sunO5ubfHl/z4Mp6ReGWCH2iEFEXZafmcSTHpTgSmpFEBmh0R/j6mEnMwv6Py3GV53nXODg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-10T05:23:51.197262+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.ic.2020.104616.url:https://www.sciencedirect.com/science/article/pii/S0890540120301048) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Costas S. Iliopoulos, Ritu Kundu, and Solon P. Pissis. “Efficient pattern matching in elastic-degenerate strings.” In:Information and Computation279 (2021). Selected Papers of the 11th International Conference on Language and Automata Theor","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Costas S. Iliopoulos, Ritu Kundu, and Solon P. Pissis. “Efficient pattern matching in elastic-degenerate strings.” In:Information and Computation279 (2021). Selected Papers of the 11th International Conference on Language and Automata Theor","reconstructed_doi":"10.1016/j.ic.2020.104616.url:https://www.sciencedirect.com/science/article/pii/S0890540120301048"},"severity":"advisory","ref_index":18,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.ic.2020.104616.url:https://www.sciencedirect.com/science/article/pii/S0890540120301048","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3fc7993ea4a7af64e0ce3a0909bd3fc4cb1392c5ef60f9a3ff928e3803442a6e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":11839,"event_type":"pith.integrity.v1","payload_sha256":"cebd1e938dbfcca0c200d27ab2acc79e7b2d7d80117c0c03ba49650f446b1aa9","signature_b64":"YiWPnvJLki0yQVJGGeznpB8ONsKwhxTYr2r8JwEQ8q099rW8oHBUccPWIHAaL+BA5OPLVo2Z39v6YwiPPgc/Dw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-10T05:23:51.196032+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/lipics.icalp.2018.62.url:https://doi.org/10.4230/LIPIcs.ICALP.2018.62) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Paweł Gawrychowski and Przemysław Uznański. “Towards Unified Approximate Pattern Matching for Hamming andL1 Distance.” In:45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Repu","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Paweł Gawrychowski and Przemysław Uznański. “Towards Unified Approximate Pattern Matching for Hamming andL1 Distance.” In:45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Repu","reconstructed_doi":"10.4230/lipics.icalp.2018.62.url:https://doi.org/10.4230/LIPIcs.ICALP.2018.62"},"severity":"advisory","ref_index":14,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/lipics.icalp.2018.62.url:https://doi.org/10.4230/LIPIcs.ICALP.2018.62","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"65d37e9464697851a7b7a3bd9d98ed6b3c334630896ca5da81729c6dce5c09db","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":11838,"event_type":"pith.integrity.v1","payload_sha256":"fd343751abd889f89579f31e8c298fa8a5d10337061e3d8a3c9af0e320cc5dc5","signature_b64":"Q3nOpn5iJukdI8MsdOV6IvsQsRlood1mB3PYq2CBWC1raXoCd8ipeIaGQHSr+rtvMf/FUwV2SCOfu1glYXAiCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-10T05:23:51.194887+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/focs46700.2020.00095.url:https://doi.org/10.1109/FOCS46700.2020.00095) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Panagiotis Charalampopoulos, Tomasz Kociumaka, and Philip Wellnitz. “Faster Approxi- mate Pattern Matching: A Unified Approach.” In:61st IEEE Annual Symposium on Foun- dations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19,","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":7,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Panagiotis Charalampopoulos, Tomasz Kociumaka, and Philip Wellnitz. “Faster Approxi- mate Pattern Matching: A Unified Approach.” In:61st IEEE Annual Symposium on Foun- dations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19,","reconstructed_doi":"10.1109/focs46700.2020.00095.url:https://doi.org/10.1109/FOCS46700.2020.00095"},"severity":"advisory","ref_index":7,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/focs46700.2020.00095.url:https://doi.org/10.1109/FOCS46700.2020.00095","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"b0b2f8b6cb3e055b64f4c43d74f5c24792c296ca8135e234d8cd0f8d8d942f9d","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":11837,"event_type":"pith.integrity.v1","payload_sha256":"d19b92f7917aa986a50895a833900aa4fdd2432f4536cf3fff08891fbaa5c315","signature_b64":"I2TX9onzEF/9hT8cbOeGmjyV7EJ2WK71wINt/7A0M6rkgaPyAZ4wFC8jDUlhTJpimJy2BGDVGersQfoc3U6xAw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-10T05:23:51.193686+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.21) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Mai Alzamel et al. “Degenerate String Comparison and Applications.” In:LIPIcs, Volume 113, WABI 2018113 (2018). Ed. by Laxmi Parida and Esko Ukkonen, 21:1–21:14.issn: 1868-8969.doi:10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/ ","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Mai Alzamel et al. “Degenerate String Comparison and Applications.” In:LIPIcs, Volume 113, WABI 2018113 (2018). Ed. by Laxmi Parida and Esko Ukkonen, 21:1–21:14.issn: 1868-8969.doi:10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/ ","reconstructed_doi":"10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.21"},"severity":"advisory","ref_index":1,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.21","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"da93528890aa71835724bd90668bcdb1fefb6fdbe42c82c467ec23f9f3ac54e9","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.08566/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}