{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.06069","arxiv_id":"2607.06069","integrity":{"available":true,"endpoint":"/pith/2607.06069/integrity.json","summary":{"critical":3,"advisory":0,"informational":0,"by_detector":{"doi_compliance":{"total":3,"critical":3,"advisory":0,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-07-16T11:54:00.014252Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-07-15T17:32:54.437561Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-14T12:04:19.255598Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-14T09:04:22.300393Z","findings_count":3},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-11T03:49:48.756111Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1007/s00453-014-9881-x' 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.1007/s00453-014-9881-x","detected_arxiv_id":null,"ref_index":6,"audited_at":"2026-07-09T07:45:45.535484Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1145/3723180' 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/3723180","detected_arxiv_id":null,"ref_index":22,"audited_at":"2026-07-09T07:45:45.535484Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1137/18m1167733' 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.1137/18m1167733","detected_arxiv_id":null,"ref_index":12,"audited_at":"2026-07-09T07:45:45.535484Z"}],"snapshot_sha256":"f203d6937306cb021be72ded0198f7a6a487ec43590dfcfacf6ee442d8090188"},"events":[{"event_id":7825,"event_type":"pith.integrity.v1","payload_sha256":"2cd17115edda89e46aacda690a8a79affc890332b5737a00590375784a721316","signature_b64":"7icVX73rgLXBpcUCZczkyG1pfnZm94tCdL12FruLGYvDOzVChvewrR3yoQOFroUC3j8G1/j8mUovey4ta1mGCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T07:47:20.747738+00:00","payload":{"note":"Identifier '10.1145/3723180' 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":"Sándor Kisfaludi-Bak, Jesper Nederlof, and Karol Węgrzycki. A gap-ETH-tight ap- proximation scheme for Euclidean TSP.Journal of the ACM, 72(6):42:1–42:48, 2025. doi:10.1145/3723180","arxiv_id":"2607.06069","detector":"doi_compliance","evidence":{"doi":"10.1145/3723180","arxiv_id":null,"ref_index":22,"raw_excerpt":"Sándor Kisfaludi-Bak, Jesper Nederlof, and Karol Węgrzycki. A gap-ETH-tight ap- proximation scheme for Euclidean TSP.Journal of the ACM, 72(6):42:1–42:48, 2025. doi:10.1145/3723180","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":22,"audited_at":"2026-07-09T07:45:45.535484Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3723180","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"62794e46c19a237da8e9e55e1052edc4589dcc28508b8824d55e484c062141c6","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":7824,"event_type":"pith.integrity.v1","payload_sha256":"83b25335c270774d5f9e8eeadbb3e82e58310a5ad77b93995e09a1eb2f605bd1","signature_b64":"DRU7uoCBno2UapT/A0iQvYptIdQ/Q8O/ky5mZLQUMYC96p1HPkqNItcd9IRGjxiBZkkzeK1eI78YYIOWKUBrCw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T07:47:20.746532+00:00","payload":{"note":"Identifier '10.1137/18m1167733' 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":"MarkdeBerg, HansL.Bodlaender, SándorKisfaludi-Bak, DánielMarx, andTomC.vander Zanden. A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs.SIAM Journal on Computing, 49(6):1291–1331,","arxiv_id":"2607.06069","detector":"doi_compliance","evidence":{"doi":"10.1137/18m1167733","arxiv_id":null,"ref_index":12,"raw_excerpt":"MarkdeBerg, HansL.Bodlaender, SándorKisfaludi-Bak, DánielMarx, andTomC.vander Zanden. A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs.SIAM Journal on Computing, 49(6):1291–1331, 2020. doi:10.1137/18M1167733","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":12,"audited_at":"2026-07-09T07:45:45.535484Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/18m1167733","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"05188c4a2b544341bf861d790fc931af8580099b5fff5e27443ceb2e7ba4eb34","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":7823,"event_type":"pith.integrity.v1","payload_sha256":"1d2c067c67d13d50738a50243285bf8406e9f311f21ab65d3e4c586ce5b8275a","signature_b64":"4vZ8x2gF5J3c7o9SIO5gD+gd/pA5RgdsKlHE3/Xr0Ww9fTjwfXHUF/UClnz54+RYbGoYFlFXyu9cDS83NMvhCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T07:47:20.745026+00:00","payload":{"note":"Identifier '10.1007/s00453-014-9881-x' 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":"Édouard Bonnet, Bruno Escoffier, Eun Jung Kim, and Vangelis Th. Paschos. On subex- ponential and FPT-time inapproximability.Algorithmica, 71(3):541–565, 2015.doi: 10.1007/s00453-014-9881-x","arxiv_id":"2607.06069","detector":"doi_compliance","evidence":{"doi":"10.1007/s00453-014-9881-x","arxiv_id":null,"ref_index":6,"raw_excerpt":"Édouard Bonnet, Bruno Escoffier, Eun Jung Kim, and Vangelis Th. Paschos. On subex- ponential and FPT-time inapproximability.Algorithmica, 71(3):541–565, 2015.doi: 10.1007/s00453-014-9881-x","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":6,"audited_at":"2026-07-09T07:45:45.535484Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s00453-014-9881-x","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"7ac9bbe330dd324771729aa4f27a52e02d893f59c9b2fce6889feb97e61f25d1","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.06069/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}