{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.27407","arxiv_id":"2607.27407","integrity":{"available":true,"endpoint":"/pith/2607.27407/integrity.json","summary":{"critical":1,"advisory":2,"informational":0,"by_detector":{"doi_compliance":{"total":3,"critical":1,"advisory":2,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-07T05:09:35.803603Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-06T10:08:53.320778Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-06T09:00:03.228966Z","findings_count":3},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-05T20:08:08.073734Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-31T00:51:08.399028Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.17654/aadmjan2016_029_048' 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.17654/aadmjan2016_029_048","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-08-01T08:08:11.105910Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.laa.2025.09.011 resolves to 'On the factorability of infinite graphs'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/j.laa.2025.09.011","detected_arxiv_id":null,"ref_index":11,"audited_at":"2026-08-01T08:08:11.105910Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.disc.2016.07.018 resolves to 'On a construction using commuting regular graphs'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/j.disc.2016.07.018","detected_arxiv_id":null,"ref_index":14,"audited_at":"2026-08-01T08:08:11.105910Z"}],"snapshot_sha256":"f05f40901eecdc8842f002a1087fc40937224ba8f362e1498a6b3e52d3ab3bb3"},"events":[{"event_id":15428,"event_type":"pith.integrity.v1","payload_sha256":"86187eac9de86be8a05535e6c4623e6e1054e1183eba2fdd8e2510dbc8b1a3fb","signature_b64":"jNKf3NFO0n9VIFowXmr/5rGjy08n1WgFnyMorq+OEDnv8AyQjyzbDRnFeYWujKnNfMnhJShaBIFCjMffCPVZDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T08:08:32.721934+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.disc.2016.07.018 resolves to 'On a construction using commuting regular graphs'. A reader following the printed text alone cannot reach it.","snippet":"Marius Somodi, Katie Burke, and Jesse Todd. On a construction using commuting regular graphs.Discrete Mathematics, 340(3):532–540, 2017.doi:10.1016/j.disc. 2016.07.018","arxiv_id":"2607.27407","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":"On a construction using commuting regular graphs","printed_excerpt":"10.1016/j.disc","reconstructed_doi":"10.1016/j.disc.2016.07.018"},"severity":"advisory","ref_index":14,"audited_at":"2026-08-01T08:08:11.105910Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.disc.2016.07.018","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"663c9f0372c00d160dd6a0227b2f5701bef8103efe67f1fd9bf9a1c028780ec1","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On a construction using commuting regular graphs","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":15427,"event_type":"pith.integrity.v1","payload_sha256":"d6b548c2ce0d307b5d4574d4783d723e80efe01b8f08d634645c69548e6fc8e9","signature_b64":"cy8wJ4PmLEN5erC5+h7dWX1ekarCA3CuoOufnNlwUnuwL6RbY5Uojz944ds3uh2laA0pay7JKISUsKMe0ul0DA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T08:08:32.544332+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.laa.2025.09.011 resolves to 'On the factorability of infinite graphs'. A reader following the printed text alone cannot reach it.","snippet":"Babak Miraftab, Heydar Radjavi, and Sho Suda. On the factorability of infinite graphs.Linear Algebra and its Applications, 728:409–418, 2026.doi:10.1016/j.laa. 2025.09.011","arxiv_id":"2607.27407","detector":"doi_compliance","evidence":{"ref_index":11,"verdict_class":"incontrovertible","resolved_title":"On the factorability of infinite graphs","printed_excerpt":"10.1016/j.laa","reconstructed_doi":"10.1016/j.laa.2025.09.011"},"severity":"advisory","ref_index":11,"audited_at":"2026-08-01T08:08:11.105910Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.laa.2025.09.011","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a2e04bc65fdc8420980dbfd099a7aa66bad8701b62e8885cb34fdcd4674ca087","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On the factorability of infinite graphs","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":15426,"event_type":"pith.integrity.v1","payload_sha256":"ddf2e21330e947cfab771c335d782270a006043f16a925cffe6f44473e8a6090","signature_b64":"chTOHrthiLpGw1TWpaZwvdCM4FUTjI4JqnIbxkUBzs+d4WnRpM0tAFgenlNt5+tvhz9WmzTpiSxSUeTFNDxKBg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T08:08:32.313013+00:00","payload":{"note":"Identifier '10.17654/aadmjan2016_029_048' 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":"K. Arathi Bhat, K. Manjunatha Prasad, and G. Sudhakara. Some matrix equations of graphs.Advances and Applications in Discrete Mathematics, 17(1):29–48, 2016.doi: 10.17654/AADMJan2016_029_048","arxiv_id":"2607.27407","detector":"doi_compliance","evidence":{"doi":"10.17654/aadmjan2016_029_048","arxiv_id":null,"ref_index":5,"raw_excerpt":"K. Arathi Bhat, K. Manjunatha Prasad, and G. Sudhakara. Some matrix equations of graphs.Advances and Applications in Discrete Mathematics, 17(1):29–48, 2016.doi: 10.17654/AADMJan2016_029_048","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":5,"audited_at":"2026-08-01T08:08:11.105910Z","event_type":"pith.integrity.v1","detected_doi":"10.17654/aadmjan2016_029_048","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"49c57a9b2a3e8d8900e961efdab22f425530cfeb4bb812d6bca96aabeca34720","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.27407/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}