{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.09170","arxiv_id":"2607.09170","integrity":{"available":true,"endpoint":"/pith/2607.09170/integrity.json","summary":{"critical":4,"advisory":7,"informational":0,"by_detector":{"doi_compliance":{"total":11,"critical":4,"advisory":7,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-07-29T19:21:49.850382Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-22T19:24:32.897095Z","findings_count":11},{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-07-20T03:53:14.579495Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-16T16:45:08.910927Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"completed","ran_at":"2026-07-13T13:56:57.568445Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-13T09:19:51.123706Z","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.1145/3382734.3405745.url:https://doi.org/10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1145/3382734.3405745.url:https://doi.org/10","detected_arxiv_id":null,"ref_index":30,"audited_at":"2026-07-13T05:03:48.330044Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detected_doi":"10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216","detected_arxiv_id":null,"ref_index":63,"audited_at":"2026-07-13T05:03:48.330044Z"},{"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/1.9781611977554.ch97.url:https://epubs.siam.org/doi/abs/10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1137/1.9781611977554.ch97.url:https://epubs.siam.org/doi/abs/10","detected_arxiv_id":null,"ref_index":48,"audited_at":"2026-07-13T05:03:48.330044Z"},{"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/1.9781611975482.50.url:https://doi.org/10.1137/1.9781611975482) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1137/1.9781611975482.50.url:https://doi.org/10.1137/1.9781611975482","detected_arxiv_id":null,"ref_index":45,"audited_at":"2026-07-13T05:03:48.330044Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/0196-6774(86' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detected_doi":"10.1016/0196-6774(86","detected_arxiv_id":null,"ref_index":2,"audited_at":"2026-07-13T05:03:48.330044Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1145/3461458.url:https://doi.org/10.1145/3461458' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detected_doi":"10.1145/3461458.url:https://doi.org/10.1145/3461458","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-07-13T05:03:48.330044Z"},{"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.1145/3519935.3520027.url:https://doi.org/) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1145/3519935.3520027.url:https://doi.org/","detected_arxiv_id":null,"ref_index":6,"audited_at":"2026-07-13T05:03:48.330044Z"},{"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/1.9781611978971.226.url:https://doi) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1137/1.9781611978971.226.url:https://doi","detected_arxiv_id":null,"ref_index":55,"audited_at":"2026-07-13T05:03:48.330044Z"},{"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.1145/2742012.url:https://doi.org/10.1145/2742012) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1145/2742012.url:https://doi.org/10.1145/2742012","detected_arxiv_id":null,"ref_index":69,"audited_at":"2026-07-13T05:03:48.330044Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detected_doi":"10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186","detected_arxiv_id":null,"ref_index":33,"audited_at":"2026-07-13T05:03:48.330044Z"},{"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/1.9781611978971.49.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.49) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1137/1.9781611978971.49.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.49","detected_arxiv_id":null,"ref_index":8,"audited_at":"2026-07-13T05:03:48.330044Z"}],"snapshot_sha256":"83b177e4993a5677ef924c863a311c60e83a0adcdf97056285bac53786b8e6bb"},"events":[{"event_id":12912,"event_type":"pith.integrity.v1","payload_sha256":"f19f2591719902453ba8f30d56fd8dffed7701275cf033db1fad9f9634ee3279","signature_b64":"2XyZ0K1Wm2bclFM3UEBfcpqZWEqSPrq8yYcGfBtrze+8qD4ku7FJAiez5nj3GRMnhlDPcXNchHabyS57u+fkCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.624649+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/2742012.url:https://doi.org/10.1145/2742012) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. “Local Computation: Lower and Upper Bounds”. In:J. ACM(2016).doi: 10.1145/2742012.url: https://doi.org/10.1145/2742012","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":69,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. “Local Computation: Lower and Upper Bounds”. In:J. ACM(2016).doi: 10.1145/2742012.url: https://doi.org/10.1145/2742012","reconstructed_doi":"10.1145/2742012.url:https://doi.org/10.1145/2742012"},"severity":"advisory","ref_index":69,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/2742012.url:https://doi.org/10.1145/2742012","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"25b9f4c831d00292a916f271df838c8361a90f4d387106210e262c3f724209cd","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12911,"event_type":"pith.integrity.v1","payload_sha256":"3ea2ecea098a4c90f9da7c6716558a69db773a20887ce23c3ddb8e0ecfdfe019","signature_b64":"FbXQR9LNk2O5r32AfipT50hlx1IHlQWa5nwpKgChsGzgovGVEKry9ghu+rW8BRiQlZ0bKrecHFSM7NkaHoQdCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.622257+00:00","payload":{"note":"Identifier '10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Júlia Komjáthy, John Lapinskas, Johannes Lengler, and Ulysse Schaller. “Polynomial growth in degree- dependent first passage percolation on spatial random graphs”. In:Electronic Journal of Probability (2024).doi:10.1214/24-ejp1216.url:http:","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"doi":"10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216","arxiv_id":null,"ref_index":63,"raw_excerpt":"Júlia Komjáthy, John Lapinskas, Johannes Lengler, and Ulysse Schaller. “Polynomial growth in degree- dependent first passage percolation on spatial random graphs”. In:Electronic Journal of Probability (2024).doi:10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-EJP1216","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":63,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"f1a42905dab38b63b23c38d5aa162d6faa007ddca4df6f9ff36e36b5c7630203","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12910,"event_type":"pith.integrity.v1","payload_sha256":"2275e7bf81d19f413438146f5d4952fd1215d2bc937cb623ae0de534a054fac9","signature_b64":"NhuTMM5ekGZcIh+GqLYmeHyge9WX32T0hX6q7hz/kEOgpIJQlqXhF00MofY0SNvjgNic0p6XKxgawYwkm6e5BQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.619699+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611978971.226.url:https://doi) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Marc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, and Konstantin Sturm. “Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models”. In:SODA’26. 2026.doi: 10.1137/1.9781","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":55,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Marc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, and Konstantin Sturm. “Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models”. In:SODA’26. 2026.doi: 10.1137/1.9781","reconstructed_doi":"10.1137/1.9781611978971.226.url:https://doi"},"severity":"advisory","ref_index":55,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611978971.226.url:https://doi","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0039299547b3449bfa5cfae081af29e1fccbf5bd46058083813fde0772e09630","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12909,"event_type":"pith.integrity.v1","payload_sha256":"fff5bade67e17057a2f29481f859bf6280a039b0815f8d380a39b38b4d4742ab","signature_b64":"UPf6R4E8v917kTS0YGfxDdjGvLqw/y08lrK6B3mlfjqcre9w04W5GmNJBT7R1n+7sPz6BfvHT4/bS2pmZdD6AQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.617191+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611977554.ch97.url:https://epubs.siam.org/doi/abs/10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, and Václav Rozhoň. “Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization”. In:SODA’23. 2023.doi: 10.1137/1.9781611977554.ch97.url: htt","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":48,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, and Václav Rozhoň. “Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization”. In:SODA’23. 2023.doi: 10.1137/1.9781611977554.ch97.url: htt","reconstructed_doi":"10.1137/1.9781611977554.ch97.url:https://epubs.siam.org/doi/abs/10"},"severity":"advisory","ref_index":48,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611977554.ch97.url:https://epubs.siam.org/doi/abs/10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e3ac13cc1b837830a0379b26bc0d9add3b4fe6fc0f9ed94228a5edf592a49386","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12908,"event_type":"pith.integrity.v1","payload_sha256":"7191e46a3c37fb63b923c1ef05f4d7db52d3751ff13244b5e80bb660f752e84b","signature_b64":"INAcD5fSY1qewgtON/RuDyy68OvPwD4EN9ppkC4Mw1JGxdkKZCwRx+Rye3VhOdpT606sIs3BnJTRL1CJbyLADw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.614593+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611975482.50.url:https://doi.org/10.1137/1.9781611975482) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Mohsen Ghaffari. “Distributed Maximal Independent Set using Small Messages”. In:SODA’19. 2019. doi: 10.1137/1.9781611975482.50.url: https://doi.org/10.1137/1.9781611975482. 50","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":45,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Mohsen Ghaffari. “Distributed Maximal Independent Set using Small Messages”. In:SODA’19. 2019. doi: 10.1137/1.9781611975482.50.url: https://doi.org/10.1137/1.9781611975482. 50","reconstructed_doi":"10.1137/1.9781611975482.50.url:https://doi.org/10.1137/1.9781611975482"},"severity":"advisory","ref_index":45,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611975482.50.url:https://doi.org/10.1137/1.9781611975482","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"17b9e8bfe544116c315f04745722f9c4b3eb5e33d0f10ba5a7e5016fb469087f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12907,"event_type":"pith.integrity.v1","payload_sha256":"b9a7fc74968ee27d5c20a3f416edcf3bbcd1bd64aa2d5175a1f2bda49c0295e5","signature_b64":"Y30B5mQo6EzvVrZPu/Tv7a4IJJnm1HbOJ6O9y030XcO+wCm8j0Z6mHjnRrKg+tEsxsUKxns1qkJ8lZkFqxesAw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.611755+00:00","payload":{"note":"Identifier '10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Sacha Cerf, Benjamin Dayan, Umberto De Ambroggio, Marc Kaufmann, Johannes Lengler, and Ulysse Schaller. “Balanced Bidirectional Breadth-First Search on Scale-Free Networks”. In:arXiv(2024).doi: 10.48550/ARXIV.2410.22186.url:https://arxiv.or","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"doi":"10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186","arxiv_id":null,"ref_index":33,"raw_excerpt":"Sacha Cerf, Benjamin Dayan, Umberto De Ambroggio, Marc Kaufmann, Johannes Lengler, and Ulysse Schaller. “Balanced Bidirectional Breadth-First Search on Scale-Free Networks”. In:arXiv(2024).doi: 10.48550/ARXIV.2410.22186.url:https://arxiv.org/abs/2410.22186","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":33,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"32256ac8d90b03130498754b6ac5440e6669c14bb718434608f4e5314185a223","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12906,"event_type":"pith.integrity.v1","payload_sha256":"df5bba4677b699392191b004c80c74ee1bc1c1b59b3dbc8ea74af5d034b12e32","signature_b64":"V+EnHj/6uoZ6SwLKTDqgODCiGQKOCBNYXJ1nr2PQT0pAwe1BsPI5Wb3v1PDWVEuV1/XcD/cb3+RSrMk5kFiICA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.609184+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/3382734.3405745.url:https://doi.org/10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Sebastian Brandt and Dennis Olivetti. “Truly Tight-in-ΔBounds for Bipartite Maximal Matching and Variants”. In:PODC’20. 2020.doi: 10.1145/3382734.3405745.url: https://doi.org/10. 1145/3382734.3405745","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Sebastian Brandt and Dennis Olivetti. “Truly Tight-in-ΔBounds for Bipartite Maximal Matching and Variants”. In:PODC’20. 2020.doi: 10.1145/3382734.3405745.url: https://doi.org/10. 1145/3382734.3405745","reconstructed_doi":"10.1145/3382734.3405745.url:https://doi.org/10"},"severity":"advisory","ref_index":30,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3382734.3405745.url:https://doi.org/10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6370ceb79f48ea07f20ad41761dc589a0f02b1361b20680cc30d9658b1c87978","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12905,"event_type":"pith.integrity.v1","payload_sha256":"c455c87c6ebba0da21cba323b05e044975116819ff682dc4f6e910106af40114","signature_b64":"RsQ+AEMX45WSO/iNJ/OjlrAyywDKjM5SYRKYuhfQNYKTh/wFzRGuQQmUjIquQlznxtkNpjH/hPFNApgiVxNDCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.606577+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611978971.49.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.49) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Alkida Balliu, Filippo Casagrande, Francesco d’Amore, Massimo Equi, Barbara Keller, Henrik Lievo- nen, Dennis Olivetti, Gustav Schmid, and Jukka Suomela. “Distributed Quantum Advantage in Locally Checkable Labeling Problems”. In:SODA’26.doi","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":8,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Alkida Balliu, Filippo Casagrande, Francesco d’Amore, Massimo Equi, Barbara Keller, Henrik Lievo- nen, Dennis Olivetti, Gustav Schmid, and Jukka Suomela. “Distributed Quantum Advantage in Locally Checkable Labeling Problems”. In:SODA’26.doi","reconstructed_doi":"10.1137/1.9781611978971.49.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.49"},"severity":"advisory","ref_index":8,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611978971.49.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.49","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"117339d1749735212b52cca6fbc961be87c8f158c95330ae312831c73e8f947c","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12904,"event_type":"pith.integrity.v1","payload_sha256":"fd4ffacb52efa3c989fd0ebae227ba5ae673e04c847d02cdd82d1e255297b1be","signature_b64":"dKwFfoKd8MNdamIa9ZxCNWce7Zfq9zpPA9KUBD0jLAplctz0tG47j4f/mVK3O74FSJozf15vBg+SGLpd2tN9Dw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.603794+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/3519935.3520027.url:https://doi.org/) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. “DistributedΔ-coloring plays hide-and-seek”. In:STOC’22. 2022.doi: 10.1145/3519935.3520027.url: https://doi.org/ 10.1145/3519935.3520027","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. “DistributedΔ-coloring plays hide-and-seek”. In:STOC’22. 2022.doi: 10.1145/3519935.3520027.url: https://doi.org/ 10.1145/3519935.3520027","reconstructed_doi":"10.1145/3519935.3520027.url:https://doi.org/"},"severity":"advisory","ref_index":6,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3519935.3520027.url:https://doi.org/","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"62264a626c331d600bdd0c85e9fd3f06660f4975da9fec784e8dfcaefda472dd","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12903,"event_type":"pith.integrity.v1","payload_sha256":"8eb8250af5bbbfa5921f35ed438110f617538e7b23674fd016899d3664f1f9d8","signature_b64":"zhfsvfccxW883E6M13fxkGW0nfolMTiXbBUnFra265KXED6v+LcudwPoocafIQq8lQWupy821ELw1X9tiZ/4DA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.601062+00:00","payload":{"note":"Identifier '10.1145/3461458.url:https://doi.org/10.1145/3461458' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. “Lower Bounds for Maximal Matchings and Maximal Independent Sets”. In:J. ACM(2021).doi: 10.1145/3461458.url:https://doi.org/10.1145/3461458","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"doi":"10.1145/3461458.url:https://doi.org/10.1145/3461458","arxiv_id":null,"ref_index":5,"raw_excerpt":"Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. “Lower Bounds for Maximal Matchings and Maximal Independent Sets”. In:J. ACM(2021).doi: 10.1145/3461458.url:https://doi.org/10.1145/3461458","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":5,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3461458.url:https://doi.org/10.1145/3461458","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"2b2118788ab77c92911bc53884b2e705a61830b27b1079c60a22c268504d8315","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12902,"event_type":"pith.integrity.v1","payload_sha256":"3f17d8bbf3c838b7ea1893158bc0f795bd34ea4d66fb82f3f4c2f3f5743f665c","signature_b64":"DE2vWCyWkOXk15+EMzi2KDP3+caTExDd3jJrvHw/8bniC/8eAd6kIW6CIW4R/7kzP26EIWKhZ8sqyE4gprKZDw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T05:03:49.596346+00:00","payload":{"note":"Identifier '10.1016/0196-6774(86' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Noga Alon, László Babai, and Alon Itai. “A fast and simple randomized parallel algorithm for the maximal independent set problem”. In:Journal of Algorithms(1986).doi: 10.1016/0196-6774(86) 90019-2.url:http://dx.doi.org/10.1016/0196-6774(86)","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"doi":"10.1016/0196-6774(86","arxiv_id":null,"ref_index":2,"raw_excerpt":"Noga Alon, László Babai, and Alon Itai. “A fast and simple randomized parallel algorithm for the maximal independent set problem”. In:Journal of Algorithms(1986).doi: 10.1016/0196-6774(86) 90019-2.url:http://dx.doi.org/10.1016/0196-6774(86)90019-2","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":2,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0196-6774(86","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"d568cbce4416a09832f7aca0a68b79bb1f168a178e6605405185902384839ded","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.09170/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}