{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.20786","arxiv_id":"2604.20786","integrity":{"available":true,"endpoint":"/pith/2604.20786/integrity.json","summary":{"critical":7,"advisory":0,"informational":0,"by_detector":{"doi_compliance":{"total":7,"critical":7,"advisory":0,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-21T13:41:05.791339Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-20T01:34:50.668835Z","findings_count":7}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1007/bf01692067doi:10.1007/bf01692067' 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/bf01692067doi:10.1007/bf01692067","detected_arxiv_id":null,"ref_index":12,"audited_at":"2026-05-20T01:34:50.668835Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1145/3708980doi:10.1145/3708980' 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/3708980doi:10.1145/3708980","detected_arxiv_id":null,"ref_index":3,"audited_at":"2026-05-20T01:34:50.668835Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1007/bfb0028814https://doi.org/10.1007/bfb0028814' 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/bfb0028814https://doi.org/10.1007/bfb0028814","detected_arxiv_id":null,"ref_index":10,"audited_at":"2026-05-20T01:34:50.668835Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1006/jctb.1994.1056doi:http://dx.doi.org/10.1006/jctb.1994.1056' 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.1006/jctb.1994.1056doi:http://dx.doi.org/10.1006/jctb.1994.1056","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-05-20T01:34:50.668835Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1145/1402946.1402967https://dl.acm.org/doi/10.1145/1402946.1402967' 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/1402946.1402967https://dl.acm.org/doi/10.1145/1402946.1402967","detected_arxiv_id":null,"ref_index":1,"audited_at":"2026-05-20T01:34:50.668835Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1109/surv.2013.013013.00155doi:10.1109/surv.2013.013013.00155' 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.1109/surv.2013.013013.00155doi:10.1109/surv.2013.013013.00155","detected_arxiv_id":null,"ref_index":8,"audited_at":"2026-05-20T01:34:50.668835Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1109/tnet.2015.2410313doi:10.1109/tnet.2015.2410313' 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.1109/tnet.2015.2410313doi:10.1109/tnet.2015.2410313","detected_arxiv_id":null,"ref_index":11,"audited_at":"2026-05-20T01:34:50.668835Z"}],"snapshot_sha256":"411d963cc22948c67e33e7ae52609e5c9567da1f2de0a6a1617eb1906891d7bf"},"events":[{"event_id":4033,"event_type":"pith.integrity.v1","payload_sha256":"346687eb130698c2913cec3266acf8495a011f5a8e99eae34c94bfcc39fc4e5f","signature_b64":"LNlLuyagaVgfHA2jw9v2hEafxsviDhb0h8hLgOkzxEflaUKOOVYseobzvQLdGyuIugWxAoN7yd7IqD5HkAaXCQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T01:37:31.079610+00:00","payload":{"note":"Identifier '10.1007/bf01692067doi:10.1007/bf01692067' 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":"Shai Simonson. A variation of the min cut linear arrangement problem.Mathematical Systems Theory, 20:235–252, 1987.doi:10.1007/BF01692067doi:10.1007/BF01692067","arxiv_id":"2604.20786","detector":"doi_compliance","evidence":{"doi":"10.1007/bf01692067doi:10.1007/bf01692067","arxiv_id":null,"ref_index":12,"raw_excerpt":"Shai Simonson. A variation of the min cut linear arrangement problem.Mathematical Systems Theory, 20:235–252, 1987.doi:10.1007/BF01692067doi:10.1007/BF01692067","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":12,"audited_at":"2026-05-20T01:34:50.668835Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/bf01692067doi:10.1007/bf01692067","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"9e115b564cccf586920d9234e68de59df133fda6f41aae3dc4770fb737503d98","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":4032,"event_type":"pith.integrity.v1","payload_sha256":"c99205b238d31e703060611ee76fe86a585db6299e55ab90df8ebf1c402e6bce","signature_b64":"TdPxF1NUOHjdZRAANp4ZcCCIyEFtZsG6JxsTsHq1yP/dFnHOMaWSEqXYlBDvOOYT3/n0iGuwRwkiG3j5IDDYDA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T01:37:31.078095+00:00","payload":{"note":"Identifier '10.1109/tnet.2015.2410313doi:10.1109/tnet.2015.2410313' 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":"Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. Splaynet: Towards locally self-adjusting networks.IEEE/ACM Transactions on Networking, 24(3):1421–1433, 2016.doi:10.1109/TNET.2015.24103","arxiv_id":"2604.20786","detector":"doi_compliance","evidence":{"doi":"10.1109/tnet.2015.2410313doi:10.1109/tnet.2015.2410313","arxiv_id":null,"ref_index":11,"raw_excerpt":"Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. Splaynet: Towards locally self-adjusting networks.IEEE/ACM Transactions on Networking, 24(3):1421–1433, 2016.doi:10.1109/TNET.2015.2410313doi:10.1109/TNET.2015.2410313","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":11,"audited_at":"2026-05-20T01:34:50.668835Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/tnet.2015.2410313doi:10.1109/tnet.2015.2410313","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"8fe215dead297129d2503b6cbfd239cc14006f7c8cc1b4486a7d1ca8be51b461","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":4031,"event_type":"pith.integrity.v1","payload_sha256":"77eae6cc3a856e3e6a497ddf044de416619a58951d5530bf19b956da7eec5f97","signature_b64":"BClq62RbhJFCG4rMHYv6MO5qrfkN7EbpXfpSQyfYgCAGl1rlQYTyaXh1avbtCMNA5NMPsSFspKCvf+qTnfixAQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T01:37:31.076250+00:00","payload":{"note":"Identifier '10.1007/bfb0028814https://doi.org/10.1007/bfb0028814' 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":"Burkhard Monien. The complexity of embedding graphs into binary trees. In Lothar Bu- dach, editor,Proceedings of Fundamentals of Computation Theory, FCT ’85, volume 199 ofLNCS, pages 300–309. Springer, 1985. URL: https://doi.org/10.1007/BFb","arxiv_id":"2604.20786","detector":"doi_compliance","evidence":{"doi":"10.1007/bfb0028814https://doi.org/10.1007/bfb0028814","arxiv_id":null,"ref_index":10,"raw_excerpt":"Burkhard Monien. The complexity of embedding graphs into binary trees. In Lothar Bu- dach, editor,Proceedings of Fundamentals of Computation Theory, FCT ’85, volume 199 ofLNCS, pages 300–309. Springer, 1985. URL: https://doi.org/10.1007/BFb0028814https://doi.org/10.1007/BFb0028814, doi:10.1007/BFB0028814doi:10.1007/BFB0028814","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":10,"audited_at":"2026-05-20T01:34:50.668835Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/bfb0028814https://doi.org/10.1007/bfb0028814","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"e10fea345e6b9ffbee153733e08e7fb7abbf8c6d3c1e72c1e156534a79bfa7d3","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":4030,"event_type":"pith.integrity.v1","payload_sha256":"f99717a08f7aae2342977cd685c0731b411d16e6cb447d38a766f044a592b268","signature_b64":"Xf2AL6SlymBfsw0tC4Ylk5TIqemHHP1C6ltwMSBmIH3tF18udZB+mZoB3rF/Yryjce+mrGG806CF8sikHGVdDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T01:37:31.074456+00:00","payload":{"note":"Identifier '10.1109/surv.2013.013013.00155doi:10.1109/surv.2013.013013.00155' 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":"Andreas Fischer, Juan Felipe Botero, Michael Till Beck, Hermann de Meer, and Xavier Hesselbach. Virtual network embedding: A survey.IEEE Communications Surveys & Tutorials, 15(4):1888–1906, 2013.doi:10.1109/SURV.2013.013013.00155doi:10.1109","arxiv_id":"2604.20786","detector":"doi_compliance","evidence":{"doi":"10.1109/surv.2013.013013.00155doi:10.1109/surv.2013.013013.00155","arxiv_id":null,"ref_index":8,"raw_excerpt":"Andreas Fischer, Juan Felipe Botero, Michael Till Beck, Hermann de Meer, and Xavier Hesselbach. Virtual network embedding: A survey.IEEE Communications Surveys & Tutorials, 15(4):1888–1906, 2013.doi:10.1109/SURV.2013.013013.00155doi:10.1109/SURV.2013.013013.00155","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":8,"audited_at":"2026-05-20T01:34:50.668835Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/surv.2013.013013.00155doi:10.1109/surv.2013.013013.00155","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"87a17411d8ed353e9b88abeebfdf8c3dd9e19245ea1e6111945e207134939b11","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":4029,"event_type":"pith.integrity.v1","payload_sha256":"5e2beaf0560b534c2a1850dee91fe4c2d53734e24b6b1e8aa7fa5c43e8e87424","signature_b64":"oOnj/HOiK8mt1IfGDdwRjOEOhR6Dl+5j1Ut8W02EmfzRZ5pUI+b8+Pythd0x2FkgCQzLd/uc92WDWAO7O4ePCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T01:37:31.072431+00:00","payload":{"note":"Identifier '10.1006/jctb.1994.1056doi:http://dx.doi.org/10.1006/jctb.1994.1056' 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":"F.R.K. Chung and D. Mumford. Chordal completions of planar graphs. Journal of Combinatorial Theory, Series B, 62(1):96 – 106, 1994. URL: http://www.sciencedirect.com/science/article/pii/S0095895684710562http://www.sciencedirect.com/science/","arxiv_id":"2604.20786","detector":"doi_compliance","evidence":{"doi":"10.1006/jctb.1994.1056doi:http://dx.doi.org/10.1006/jctb.1994.1056","arxiv_id":null,"ref_index":5,"raw_excerpt":"F.R.K. Chung and D. Mumford. Chordal completions of planar graphs. Journal of Combinatorial Theory, Series B, 62(1):96 – 106, 1994. URL: http://www.sciencedirect.com/science/article/pii/S0095895684710562http://www.sciencedirect.com/science/article/pii/S0095895684710562, doi:http://dx.doi.org/10.1006/jctb.1994.1056doi:http://dx.doi.org/10.1006/jctb.1994.1056","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":5,"audited_at":"2026-05-20T01:34:50.668835Z","event_type":"pith.integrity.v1","detected_doi":"10.1006/jctb.1994.1056doi:http://dx.doi.org/10.1006/jctb.1994.1056","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"45cb5764d17ebdc49c91b1e5fe2d1553243b2e5072e5f7359a86c3500c16309f","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":4028,"event_type":"pith.integrity.v1","payload_sha256":"5df311b6553f49afd9c355260de04eb2316ce69c59374edb68289c03d9679f14","signature_b64":"IR73Pu5k4aHXY+dlopGaJsn/FFHVAoNuV1c8/P6gZAfGyZ+feZI3mXiue609mnsuIK7G+sVf1O/hGqLw0ESkCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T01:37:31.071118+00:00","payload":{"note":"Identifier '10.1145/3708980doi:10.1145/3708980' 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":"Chen Avin and Stefan Schmid. Revolutionizing datacenter networks via reconfigurable topolo- gies.Communications of the ACM, 68(6):44–53, 2025.doi:10.1145/3708980doi:10.1145/3708980","arxiv_id":"2604.20786","detector":"doi_compliance","evidence":{"doi":"10.1145/3708980doi:10.1145/3708980","arxiv_id":null,"ref_index":3,"raw_excerpt":"Chen Avin and Stefan Schmid. Revolutionizing datacenter networks via reconfigurable topolo- gies.Communications of the ACM, 68(6):44–53, 2025.doi:10.1145/3708980doi:10.1145/3708980","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":3,"audited_at":"2026-05-20T01:34:50.668835Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3708980doi:10.1145/3708980","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"6e95777c98bf484ea7f5a4cf565bcc815cc15b17de39e0ec8344dba4b26a111e","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":4027,"event_type":"pith.integrity.v1","payload_sha256":"1eb494768643ab0e72fa051025fba7a75308020e6c310f360495d92a9762da09","signature_b64":"nYgb9kc8eehX6XADT2Uf5XJdWvs8RfHqJKZ82lIKFgNiiQpOjhlgXk8jeYqxHZ9n3rQd8TI8GzWd8ZPa8vZPCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T01:37:31.069478+00:00","payload":{"note":"Identifier '10.1145/1402946.1402967https://dl.acm.org/doi/10.1145/1402946.1402967' 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":"Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. A scalable, commod- ity data center network architecture.ACM SIGCOMM Computer Communication Re- view, 38(4):63–74, 2008. URL: https://dl.acm.org/doi/10.1145/1402946.1402967https://dl.","arxiv_id":"2604.20786","detector":"doi_compliance","evidence":{"doi":"10.1145/1402946.1402967https://dl.acm.org/doi/10.1145/1402946.1402967","arxiv_id":null,"ref_index":1,"raw_excerpt":"Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. A scalable, commod- ity data center network architecture.ACM SIGCOMM Computer Communication Re- view, 38(4):63–74, 2008. URL: https://dl.acm.org/doi/10.1145/1402946.1402967https://dl.acm.org/doi/10.1145/1402946.1402967, doi:10.1145/1402946.1402967doi:10.1145/1402946.1402967","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":1,"audited_at":"2026-05-20T01:34:50.668835Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/1402946.1402967https://dl.acm.org/doi/10.1145/1402946.1402967","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"b347ae9fe15cf3c3a6186d604efe6bb563582a66a7fd60bda1a43265cd361476","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.20786/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}