{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.26271","arxiv_id":"2607.26271","integrity":{"available":true,"endpoint":"/pith/2607.26271/integrity.json","summary":{"critical":4,"advisory":0,"informational":0,"by_detector":{"doi_compliance":{"total":4,"critical":4,"advisory":0,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-06T06:08:55.622801Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-05T03:38:47.334986Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-05T02:40:40.399604Z","findings_count":4},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-04T13:08:17.517631Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-07-30T23:51:05.349211Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-30T16:51:07.120302Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1017/s0963548322000104(cit' 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.1017/s0963548322000104(cit","detected_arxiv_id":null,"ref_index":3,"audited_at":"2026-08-01T00:32:22.995623Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1017/s0963548319000026(cit' 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.1017/s0963548319000026(cit","detected_arxiv_id":null,"ref_index":13,"audited_at":"2026-08-01T00:32:22.995623Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1017/cbo9781139871495(cit' 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.1017/cbo9781139871495(cit","detected_arxiv_id":null,"ref_index":30,"audited_at":"2026-08-01T00:32:22.995623Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1002/rsa.20872(cit' 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.1002/rsa.20872(cit","detected_arxiv_id":null,"ref_index":1,"audited_at":"2026-08-01T00:32:22.995623Z"}],"snapshot_sha256":"80a2e0f5a2371a921160d3e3e972fd3623033ed066beff98ce552e547a33217e"},"events":[{"event_id":14700,"event_type":"pith.integrity.v1","payload_sha256":"dcc5d93cd7c62ce9bf1d5095996b5e30e89fe75674f23983a44f55137fb771be","signature_b64":"AbGJ9i8S1HxN2429ASgjv+3FTla/a6erwsbxaYCRMgNheRZuonKbji09Bh2YrNZlFvqXXzV+vXwJowTSIxsTBQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T00:36:17.678587+00:00","payload":{"note":"Identifier '10.1002/rsa.20872(cit' 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":"H. Acan and B. Pittel. “On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph”. In:Random Structures Algorithms56.1 (2020), pp. 37–62.doi:10.1002/ rsa.20872.url:https://doi.org/10.1002/rsa.20872(cit. on","arxiv_id":"2607.26271","detector":"doi_compliance","evidence":{"doi":"10.1002/rsa.20872(cit","arxiv_id":null,"ref_index":1,"raw_excerpt":"H. Acan and B. Pittel. “On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph”. In:Random Structures Algorithms56.1 (2020), pp. 37–62.doi:10.1002/ rsa.20872.url:https://doi.org/10.1002/rsa.20872(cit. on pp. 4, 8)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":1,"audited_at":"2026-08-01T00:32:22.995623Z","event_type":"pith.integrity.v1","detected_doi":"10.1002/rsa.20872(cit","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"4d8d12f939de51f752828f47e47f226c54d5162912f7051067551c732d9b8680","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":14699,"event_type":"pith.integrity.v1","payload_sha256":"004cc167fab919e9938eff410faf6bc366278f31bff38656462f13b7ff3a05d0","signature_b64":"a4Kn13Tz4dKtjTukVyfOoCCGzdDUYf4c/9VynWiB969YV3I3jurgGz5pJG2lEr8406zQo3B0UUv+ntnHBtNoAw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T00:36:17.460836+00:00","payload":{"note":"Identifier '10.1017/cbo9781139871495(cit' 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":"R. P. Stanley.Catalan numbers. Cambridge University Press, New York, 2015.doi:10 . 1017 / CBO9781139871495.url:https://doi.org/10.1017/CBO9781139871495(cit. on p. 14)","arxiv_id":"2607.26271","detector":"doi_compliance","evidence":{"doi":"10.1017/cbo9781139871495(cit","arxiv_id":null,"ref_index":30,"raw_excerpt":"R. P. Stanley.Catalan numbers. Cambridge University Press, New York, 2015.doi:10 . 1017 / CBO9781139871495.url:https://doi.org/10.1017/CBO9781139871495(cit. on p. 14)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":30,"audited_at":"2026-08-01T00:32:22.995623Z","event_type":"pith.integrity.v1","detected_doi":"10.1017/cbo9781139871495(cit","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"0c67d83233c4119e4c1455fd08b8a10ee98b540a09c6908efe6a664c3a3f4d30","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":14698,"event_type":"pith.integrity.v1","payload_sha256":"e4415356b576a05505543359bc08960856b892e4702175fc458a85d11f512fa9","signature_b64":"NrDNAsK8GU8XJN5dB0GP1UCp2/CRc0Ru/tH/V2UjMceg24LoWzv/fWk5f+n160FPU8Vh0+c6e7f9MwxCmzmDAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T00:36:17.246528+00:00","payload":{"note":"Identifier '10.1017/s0963548319000026(cit' 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":"L. Esperet, R. J. Kang, and S. Thomass´ e. “Separation choosability and dense bipartite induced subgraphs”. In:Combinatorics, Probability and Computing28.5 (2019), pp. 720–732.doi:10 . 1017/S0963548319000026.url:https://doi.org/10.1017/S096","arxiv_id":"2607.26271","detector":"doi_compliance","evidence":{"doi":"10.1017/s0963548319000026(cit","arxiv_id":null,"ref_index":13,"raw_excerpt":"L. Esperet, R. J. Kang, and S. Thomass´ e. “Separation choosability and dense bipartite induced subgraphs”. In:Combinatorics, Probability and Computing28.5 (2019), pp. 720–732.doi:10 . 1017/S0963548319000026.url:https://doi.org/10.1017/S0963548319000026(cit. on p. 3)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":13,"audited_at":"2026-08-01T00:32:22.995623Z","event_type":"pith.integrity.v1","detected_doi":"10.1017/s0963548319000026(cit","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"30e5fc5b65fbf4a40973b5d3ab84a600b2ddda3865340b0936f71dac03010917","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":14697,"event_type":"pith.integrity.v1","payload_sha256":"a8eadd4398fefac82d30a2f8f04b76e763cffc939a324a57f21314bde237b597","signature_b64":"DTUZKMEWcchiUZxQ7HIN8Qtb9ATYlwyK2TEEBy7VcwV3WkRF858NYYk4gJcmOTW0TjPfb2JhQvZbjg8NIk7eCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T00:36:17.016920+00:00","payload":{"note":"Identifier '10.1017/s0963548322000104(cit' 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. Anderson, A. Bernshteyn, and A. Dhawan. “Coloring graphs with forbidden bipartite sub- graphs”. In:Combinatorics, Probability and Computing32.1 (2023), pp. 45–67.doi:10 . 1017 / S0963548322000104.url:https://doi.org/10.1017/S096354832200","arxiv_id":"2607.26271","detector":"doi_compliance","evidence":{"doi":"10.1017/s0963548322000104(cit","arxiv_id":null,"ref_index":3,"raw_excerpt":"J. Anderson, A. Bernshteyn, and A. Dhawan. “Coloring graphs with forbidden bipartite sub- graphs”. In:Combinatorics, Probability and Computing32.1 (2023), pp. 45–67.doi:10 . 1017 / S0963548322000104.url:https://doi.org/10.1017/S0963548322000104(cit. on pp. 1, 16)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":3,"audited_at":"2026-08-01T00:32:22.995623Z","event_type":"pith.integrity.v1","detected_doi":"10.1017/s0963548322000104(cit","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"5e766f96b104ef40ddf562907e4f1a99562d53fcfa3194410b4e01d50556fe24","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.26271/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}