{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.10522","arxiv_id":"2605.10522","integrity":{"available":true,"endpoint":"/pith/2605.10522/integrity.json","summary":{"critical":0,"advisory":4,"informational":0,"by_detector":{"doi_compliance":{"total":4,"critical":0,"advisory":4,"informational":0}}},"clean":false,"detectors_run":[{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-05-20T05:42:01.007746Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-19T14:42:16.516054Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-19T11:01:17.882640Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T09:13:20.371426Z","findings_count":4}],"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.1109/ICCICC46617.2019.91460982) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1109/ICCICC46617.2019.91460982","detected_arxiv_id":null,"ref_index":23,"audited_at":"2026-05-19T09:13:20.371426Z"},{"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/TVCG.2016.25989582) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1109/TVCG.2016.25989582","detected_arxiv_id":null,"ref_index":4,"audited_at":"2026-05-19T09:13:20.371426Z"},{"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/BigData.2018.86225212) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1109/BigData.2018.86225212","detected_arxiv_id":null,"ref_index":10,"audited_at":"2026-05-19T09:13:20.371426Z"},{"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.1111/cgf.147942) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1111/cgf.147942","detected_arxiv_id":null,"ref_index":12,"audited_at":"2026-05-19T09:13:20.371426Z"}],"snapshot_sha256":"57304f272af08575676b7b1d5754a70c323e0bcd0ce6d52f427812aa3d2e7e55"},"events":[{"event_id":594,"event_type":"pith.integrity.v1","payload_sha256":"e1ab63006ea6f1f19bf6e5db28c850182a8a722e0d575bb58f26a9de4d0e811b","signature_b64":"gNEgy463645lk/c4aDq/Y1ofnXSsTf2nzIrDGLivGZWG3HSAc/KrP14apjr2YL94U3Gwqp85IQo7xQl1lj5GCw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T09:16:57.586872+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/ICCICC46617.2019.91460982) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Y . Wang, G. Baciu, and C. Li. Visualizing the Temporal Similarity Between Clusters of Dynamic Graphs. In2019 IEEE 18th Interna- tional Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC), pp. 205–210, July 2019. doi: 10.110","arxiv_id":"2605.10522","detector":"doi_compliance","evidence":{"ref_index":23,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Y . Wang, G. Baciu, and C. Li. Visualizing the Temporal Similarity Between Clusters of Dynamic Graphs. In2019 IEEE 18th Interna- tional Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC), pp. 205–210, July 2019. doi: 10.110","reconstructed_doi":"10.1109/ICCICC46617.2019.91460982"},"severity":"advisory","ref_index":23,"audited_at":"2026-05-19T09:13:20.371426Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/ICCICC46617.2019.91460982","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"079023cad028e2e72e2ad5393985044b0aa45c0a3de8c460a370ad120012f2e8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":593,"event_type":"pith.integrity.v1","payload_sha256":"f5f1a6952e720d33d3668ce9ae79dd336db88be32fea79eef411747bf4fe11d4","signature_b64":"ZmyBCXq4QtelqEf4w6orDyYd1dbRoMUAtYZiRwfhbiIuTeGt1N8BsbSB/w5IasDH386c35768ERtqOMA+ZboAg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T09:16:57.583786+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1111/cgf.147942) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"V . Filipov, A. Arleo, and S. Miksch. Are We There Yet? A Roadmap of Network Visualization from Surveys to Task Taxonomies.Com- puter Graphics Forum, 42(6):e14794, Sept. 2023. doi: 10.1111/cgf. 14794 2","arxiv_id":"2605.10522","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"V . Filipov, A. Arleo, and S. Miksch. Are We There Yet? A Roadmap of Network Visualization from Surveys to Task Taxonomies.Com- puter Graphics Forum, 42(6):e14794, Sept. 2023. doi: 10.1111/cgf. 14794 2","reconstructed_doi":"10.1111/cgf.147942"},"severity":"advisory","ref_index":12,"audited_at":"2026-05-19T09:13:20.371426Z","event_type":"pith.integrity.v1","detected_doi":"10.1111/cgf.147942","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0af8d18042f672169eccf680eb0b9c97f8dc4378435805326fb95b9910563d27","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":592,"event_type":"pith.integrity.v1","payload_sha256":"c0aefb854cb67c6b19db9e869e2b3072a94d94f5e134e5303147591107ad25f7","signature_b64":"GcLi5inXvlR0WhW6hB+tKQbwpUcUb12VuD9C5+oL1JKiYw/NM1iO7uo1C8c9ugMTYPEl/TtBRZZ8G5N+2ZGkAg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T09:16:57.580622+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/BigData.2018.86225212) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"IEEE, Seattle, W A, USA, Dec. 2018. doi: 10.1109/BigData. 2018.8622521 2","arxiv_id":"2605.10522","detector":"doi_compliance","evidence":{"ref_index":10,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"IEEE, Seattle, W A, USA, Dec. 2018. doi: 10.1109/BigData. 2018.8622521 2","reconstructed_doi":"10.1109/BigData.2018.86225212"},"severity":"advisory","ref_index":10,"audited_at":"2026-05-19T09:13:20.371426Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/BigData.2018.86225212","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6aed936ed29403ac259a44bd7e546c3be6808755fd83921b609309efab62b558","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":591,"event_type":"pith.integrity.v1","payload_sha256":"7d1417a9ad6d085241de1bd01508fefc8fd75b8383cc5e21dd3ac1aaee003987","signature_b64":"LZJiEkIt8dd3oewPm/67r7qjeIbqub1DUbz2cE0wjf8qO7cqEYTP5cLhpP9OmUUtAu7LIUIprSR8D+iiYi16DA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T09:16:57.576355+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TVCG.2016.25989582) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"B. Bach, N. H. Riche, C. Hurter, K. Marriott, and T. Dwyer. Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization.IEEE transactions on visualization and com- puter graphics, 23(1):541–550, Jan. 2017. ","arxiv_id":"2605.10522","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"B. Bach, N. H. Riche, C. Hurter, K. Marriott, and T. Dwyer. Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization.IEEE transactions on visualization and com- puter graphics, 23(1):541–550, Jan. 2017. ","reconstructed_doi":"10.1109/TVCG.2016.25989582"},"severity":"advisory","ref_index":4,"audited_at":"2026-05-19T09:13:20.371426Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TVCG.2016.25989582","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6319c52600d39a52a041785d89d18e706dec5ec855515fdf1b3c9ac1e2cc1f54","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.10522/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}