{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","short_pith_number":"pith:TAZOB7HP","canonical_record":{"source":{"id":"2607.26936","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T14:05:26Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"d7f77662f90c77563b611c1b1b2f3a54e3acfb28f78aea13bde950e51339f693","abstract_canon_sha256":"2b73bd8b995bd428ea516b29130717e5b411f3a14c75b779ccb4d893b9022f14"},"schema_version":"1.0"},"canonical_sha256":"9832e0fcef22924425431e3118ceb1f82936b831227500e7d610bc82ad566f58","source":{"kind":"arxiv","id":"2607.26936","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26936","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26936v1","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26936","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"TAZOB7HPEKJE","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"pith_short_16","alias_value":"TAZOB7HPEKJEIJKD","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"pith_short_8","alias_value":"TAZOB7HP","created_at":"2026-07-30T01:23:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"record","payload":{"canonical_record":{"source":{"id":"2607.26936","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T14:05:26Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"d7f77662f90c77563b611c1b1b2f3a54e3acfb28f78aea13bde950e51339f693","abstract_canon_sha256":"2b73bd8b995bd428ea516b29130717e5b411f3a14c75b779ccb4d893b9022f14"},"schema_version":"1.0"},"canonical_sha256":"9832e0fcef22924425431e3118ceb1f82936b831227500e7d610bc82ad566f58","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9832e0fcef22924425431e3118ceb1f82936b831227500e7d610bc82ad566f58","last_reissued_at":"2026-07-30T01:23:06.537988Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:23:06.537988Z"},"source_kind":"arxiv","source_id":"2607.26936","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T01:23:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RL4obaEdmP0xqr+7We1kecN2CE85YSNI8sfRan0kcStcHmDFzjpoGH7cr3++tvklRH+YvPm7amOyBHSG90VTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.943962Z"},"content_sha256":"bf9dd6dcea1f2c26925ba1f3d2be43016f877834900f64c1be51619f2932fb8f","schema_version":"1.0","event_id":"sha256:bf9dd6dcea1f2c26925ba1f3d2be43016f877834900f64c1be51619f2932fb8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Problems on Outer k-Planar Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Hans L. Bodlaender, Xiaobin Ren","submitted_at":"2026-07-29T14:05:26Z","abstract_excerpt":"A graph is outer k-planar if it admits a straight-line drawing in which all vertices lie on a circle and every edge is crossed by at most k other edges. We study the parameterized complexity of a broad collection of graph problems on outer k-planar graphs, with k as the parameter. Many graph problems are known to be XALP-hard when parameterized by treewidth or outerplanarity, and XNLP-hard when parameterized by pathwidth. We show that only a few such problems, including Binary CSP and Scattered Set, remain intractable on outer k-planar graphs, whereas a large class of the others become fixed-p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26936","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.26936/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T01:23:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OU/bPtSXU5DHpdYQ2egFKarAJ9zZ0eWI8wkMx378Cf4sFNpxuGK5JTdsF+oJXlsKo3/RHM5Nh6JGuW4+vELKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.944667Z"},"content_sha256":"cdffdcd71c3d07ad8217b94999ba9337e74ba611de4c87fc56d524d1bc1f03e4","schema_version":"1.0","event_id":"sha256:cdffdcd71c3d07ad8217b94999ba9337e74ba611de4c87fc56d524d1bc1f03e4"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.jctb.2014.07.003 resolves to 'The structure of graphs not admitting a fixed immersion'. A reader following the printed text alone cannot reach it.","snippet":"Paul Wollan. The structure of graphs not admitting a fixed immersion.Journal of Combinatorial Theory, Series B, 110:47–66, 2015.doi:10.1016/j.jctb.2014. 07.003","arxiv_id":"2607.26936","detector":"doi_compliance","evidence":{"ref_index":63,"verdict_class":"incontrovertible","resolved_title":"The structure of graphs not admitting a fixed immersion","printed_excerpt":"10.1016/j.jctb.2014","reconstructed_doi":"10.1016/j.jctb.2014.07.003"},"severity":"advisory","ref_index":63,"audited_at":"2026-07-30T16:31:44.796404Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.jctb.2014.07.003","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e454f32e1c25cf3d166c2e7287fa385b00c8f941601fe794cee859e4e8485e93","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"The structure of graphs not admitting a fixed immersion","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13989,"payload_sha256":"43ce77baed679c351b6db2d837d811f389fc427bbe20efde7272f3e2ca8fbde9","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T16:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKjkrFVdd1Wym5kdCvK4AYeRd8GZdoUTF33QIzE9HRV8PL5vs9BI1zQvpjDHBnczYEAvrYPTSlMsHiqQCT++CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.948630Z"},"content_sha256":"4fbd1e9f3bfeb1871fcf84574b62393aa40c444a7eebc9f439d2932c3312618d","schema_version":"1.0","event_id":"sha256:4fbd1e9f3bfeb1871fcf84574b62393aa40c444a7eebc9f439d2932c3312618d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"integrity","payload":{"note":"Identifier '10.1016/s0166-218x(96' 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":"Klaus Jansen and Petra Scheffler. Generalized coloring for tree-like graphs.Dis- crete Applied Mathematics, 75(2):135–155, 1997.doi:10.1016/S0166-218X(96) 00085-6","arxiv_id":"2607.26936","detector":"doi_compliance","evidence":{"doi":"10.1016/s0166-218x(96","arxiv_id":null,"ref_index":46,"raw_excerpt":"Klaus Jansen and Petra Scheffler. Generalized coloring for tree-like graphs.Dis- crete Applied Mathematics, 75(2):135–155, 1997.doi:10.1016/S0166-218X(96) 00085-6","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":46,"audited_at":"2026-07-30T16:31:44.796404Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0166-218x(96","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"662c11999cf69444de381c6a3742c5b34b59be43b2c5501bec3c436fa346aaeb","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13988,"payload_sha256":"03b6e4c82218247df3f1334a495c4ea37fe0042547a6d08ae7c77f8186d05929","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T16:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PerrDsp6+F2oSdd9neOfx+93TQm9+H3kp915toWR+izZtyhnydmrAVSxb+/HTtHj8Tb7ygNFYKXO8XNujl4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.949038Z"},"content_sha256":"810e4177e5642e6bfbfc488947487ea2d718cc3a33942b92dc2f7fe37e924645","schema_version":"1.0","event_id":"sha256:810e4177e5642e6bfbfc488947487ea2d718cc3a33942b92dc2f7fe37e924645"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/DagRep.14.2.71) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Vida Dujmović, Seok-Hee Hong, Michael Kaufmann, János Pach, and Henry Förster. Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062).Dagstuhl Reports, 14(2):71–94, 2024. doi:10.4230/DagRep.14. 2.71","arxiv_id":"2607.26936","detector":"doi_compliance","evidence":{"ref_index":34,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.4230/dagrep.14","reconstructed_doi":"10.4230/DagRep.14.2.71"},"severity":"advisory","ref_index":34,"audited_at":"2026-07-30T16:31:44.796404Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/DagRep.14.2.71","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"79af129154f9f8ce9d27812644e37e6be96243b18312640379daf90bb77870fd","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13987,"payload_sha256":"568f57eb58f570048beb2d33b9d1a7b5f12618b29d8aa4729209597947f475cd","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T16:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZj+FyvnILUselsKTEN8JRFBps3iQx+Mo9jgpOQwh88xt5wPr6dPoD5ChMQ1Q4r0hBhMyn2FHEqiTFJ8sQKVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.949406Z"},"content_sha256":"f102a93a539bd76b153174cbfcb09d0685ac22c1055e3deda0bda2bb11ec6586","schema_version":"1.0","event_id":"sha256:f102a93a539bd76b153174cbfcb09d0685ac22c1055e3deda0bda2bb11ec6586"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"integrity","payload":{"note":"Identifier '10.1016/s0166-218x(99' 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":"Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs.Dis- crete Applied Mathematics, 101(1):77–114, 2000.doi:10.1016/S0166-218X(99) 00184-5","arxiv_id":"2607.26936","detector":"doi_compliance","evidence":{"doi":"10.1016/s0166-218x(99","arxiv_id":null,"ref_index":25,"raw_excerpt":"Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs.Dis- crete Applied Mathematics, 101(1):77–114, 2000.doi:10.1016/S0166-218X(99) 00184-5","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":25,"audited_at":"2026-07-30T16:31:44.796404Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0166-218x(99","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"c8f0c9ab137262b5c46c748e70664d81dd1687d875886a6010352918d0d4c1db","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13986,"payload_sha256":"d9145a49ec0b38dd72beba5e15f2a5b14e8db9df2ce9b188a0cc524b5cac2b0c","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T16:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npK9iBD9uRKyO4Ae6uWHlaADpbgy9rurZsrgR7L7M8wCHlyvKYhjiEcK2gNn1QzaMcWdf/mAvVUV5Urh+QQkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.949790Z"},"content_sha256":"44bf5292319584b30b3368ca42217bb2550c71702822fcae6fc8b03ababc778c","schema_version":"1.0","event_id":"sha256:44bf5292319584b30b3368ca42217bb2550c71702822fcae6fc8b03ababc778c"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"integrity","payload":{"note":"Identifier '10.1016/s0012-365x(97' 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":"Beifang Chen and Sanming Zhou. Upper bounds forf-domination number of graphs. Discrete Mathematics, 185(1):239–243, 1998. doi:10.1016/S0012-365X(97) 00204-5","arxiv_id":"2607.26936","detector":"doi_compliance","evidence":{"doi":"10.1016/s0012-365x(97","arxiv_id":null,"ref_index":21,"raw_excerpt":"Beifang Chen and Sanming Zhou. Upper bounds forf-domination number of graphs. Discrete Mathematics, 185(1):239–243, 1998. doi:10.1016/S0012-365X(97) 00204-5","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":21,"audited_at":"2026-07-30T16:31:44.796404Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0012-365x(97","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"ee35fdd5e91fbc6adceb77830ac299962c413c84f5f54e115867822dbaf4533b","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13985,"payload_sha256":"a27e256581fe949a563891ef8484e9283d0e26a72956f5ba13d7789031e1a197","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T16:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMJQCbJYoFQZEiRq9w16bPGThLFr2Vh2eGj5A81auuSAG3Gric/+oMTHsR+FZ9uEATJY4N76TUVm5ZwA98SpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.950172Z"},"content_sha256":"713b179b6c74d2a98595cae30d7bec27cff8ab3203cfc8e6346c779ddf3fe1cc","schema_version":"1.0","event_id":"sha256:713b179b6c74d2a98595cae30d7bec27cff8ab3203cfc8e6346c779ddf3fe1cc"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"integrity","payload":{"note":"Identifier '10.1016/s0304-3975(97' 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":"Hans L. Bodlaender. A partialk-arboretum of graphs with bounded treewidth.The- oretical Computer Science, 209(1):1–45, 1998.doi:10.1016/S0304-3975(97) 00228-4","arxiv_id":"2607.26936","detector":"doi_compliance","evidence":{"doi":"10.1016/s0304-3975(97","arxiv_id":null,"ref_index":7,"raw_excerpt":"Hans L. Bodlaender. A partialk-arboretum of graphs with bounded treewidth.The- oretical Computer Science, 209(1):1–45, 1998.doi:10.1016/S0304-3975(97) 00228-4","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":7,"audited_at":"2026-07-30T16:31:44.796404Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0304-3975(97","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"3e7f614462ab3fdcac4ab74530879c1f1ab2515e7b34813fe78c2b0ef115a8a2","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13984,"payload_sha256":"5941f2be5eeb93a20260c0cf7908f7c549ae752ad5900242e6eb3a7f477986de","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T16:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9smtulRqnlrGTV/hcVGFBf5OwEYu8sRW872igVLJqeD1SvQbeqVK4MLIisin5/fn+WlWCbYyb20gZui2uzGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.950546Z"},"content_sha256":"877a03d85c4d6ed04a4d25c0524c4f7ceb9aeb5be34f67102ed623329fbbf92b","schema_version":"1.0","event_id":"sha256:877a03d85c4d6ed04a4d25c0524c4f7ceb9aeb5be34f67102ed623329fbbf92b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.dam.2018.07.022 resolves to 'On quasi-planar graphs: Clique-width and logical description'. A reader following the printed text alone cannot reach it.","snippet":"Bruno Courcelle. On quasi-planar graphs: Clique-width and logical description. Discrete Applied Mathematics, 278:118–135, 2020.doi:10.1016/j.dam.2018. 07.022","arxiv_id":"2607.26936","detector":"doi_compliance","evidence":{"ref_index":24,"verdict_class":"incontrovertible","resolved_title":"On quasi-planar graphs: Clique-width and logical description","printed_excerpt":"10.1016/j.dam.2018","reconstructed_doi":"10.1016/j.dam.2018.07.022"},"severity":"advisory","ref_index":24,"audited_at":"2026-07-30T16:31:44.796404Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.dam.2018.07.022","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"df7e614f87f1c6b9e0b9fd558e3e84e0fe8d5f793709b6daccbc3c8ebac21768","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On quasi-planar graphs: Clique-width and logical description","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13983,"payload_sha256":"4239ae9112f05deb48cb6ee9d0c4001c34c287c7961785cb9514e4f5e682d07a","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T16:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmWk2QfKAqejjRA6I9S2zm1KKaJGz5tTW2+aHZu38RMFzacjYQ57g/R3Em/MGOhrJ7Q9t5mzD3QBrKifMlRVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:22:34.950915Z"},"content_sha256":"ee50887e5a83b5060e560d5e18415c7d4a03bf5941d6c1e9e95143018a3db3cf","schema_version":"1.0","event_id":"sha256:ee50887e5a83b5060e560d5e18415c7d4a03bf5941d6c1e9e95143018a3db3cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAZOB7HPEKJEIJKDDYYRRTVR7A/bundle.json","state_url":"https://pith.science/pith/TAZOB7HPEKJEIJKDDYYRRTVR7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAZOB7HPEKJEIJKDDYYRRTVR7A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T15:22:34Z","links":{"resolver":"https://pith.science/pith/TAZOB7HPEKJEIJKDDYYRRTVR7A","bundle":"https://pith.science/pith/TAZOB7HPEKJEIJKDDYYRRTVR7A/bundle.json","state":"https://pith.science/pith/TAZOB7HPEKJEIJKDDYYRRTVR7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAZOB7HPEKJEIJKDDYYRRTVR7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TAZOB7HPEKJEIJKDDYYRRTVR7A","merge_version":"pith-open-graph-merge-v1","event_count":9,"valid_event_count":9,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2b73bd8b995bd428ea516b29130717e5b411f3a14c75b779ccb4d893b9022f14","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T14:05:26Z","title_canon_sha256":"d7f77662f90c77563b611c1b1b2f3a54e3acfb28f78aea13bde950e51339f693"},"schema_version":"1.0","source":{"id":"2607.26936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26936","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26936v1","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26936","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"TAZOB7HPEKJE","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"pith_short_16","alias_value":"TAZOB7HPEKJEIJKD","created_at":"2026-07-30T01:23:06Z"},{"alias_kind":"pith_short_8","alias_value":"TAZOB7HP","created_at":"2026-07-30T01:23:06Z"}],"graph_snapshots":[{"event_id":"sha256:cdffdcd71c3d07ad8217b94999ba9337e74ba611de4c87fc56d524d1bc1f03e4","target":"graph","created_at":"2026-07-30T01:23:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.26936/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is outer k-planar if it admits a straight-line drawing in which all vertices lie on a circle and every edge is crossed by at most k other edges. We study the parameterized complexity of a broad collection of graph problems on outer k-planar graphs, with k as the parameter. Many graph problems are known to be XALP-hard when parameterized by treewidth or outerplanarity, and XNLP-hard when parameterized by pathwidth. We show that only a few such problems, including Binary CSP and Scattered Set, remain intractable on outer k-planar graphs, whereas a large class of the others become fixed-p","authors_text":"Hans L. Bodlaender, Xiaobin Ren","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T14:05:26Z","title":"The Parameterized Complexity of Problems on Outer k-Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26936","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bf9dd6dcea1f2c26925ba1f3d2be43016f877834900f64c1be51619f2932fb8f","target":"record","created_at":"2026-07-30T01:23:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2b73bd8b995bd428ea516b29130717e5b411f3a14c75b779ccb4d893b9022f14","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T14:05:26Z","title_canon_sha256":"d7f77662f90c77563b611c1b1b2f3a54e3acfb28f78aea13bde950e51339f693"},"schema_version":"1.0","source":{"id":"2607.26936","kind":"arxiv","version":1}},"canonical_sha256":"9832e0fcef22924425431e3118ceb1f82936b831227500e7d610bc82ad566f58","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9832e0fcef22924425431e3118ceb1f82936b831227500e7d610bc82ad566f58","first_computed_at":"2026-07-30T01:23:06.537988Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:23:06.537988Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26936","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:44bf5292319584b30b3368ca42217bb2550c71702822fcae6fc8b03ababc778c","sha256:4fbd1e9f3bfeb1871fcf84574b62393aa40c444a7eebc9f439d2932c3312618d","sha256:713b179b6c74d2a98595cae30d7bec27cff8ab3203cfc8e6346c779ddf3fe1cc","sha256:810e4177e5642e6bfbfc488947487ea2d718cc3a33942b92dc2f7fe37e924645","sha256:877a03d85c4d6ed04a4d25c0524c4f7ceb9aeb5be34f67102ed623329fbbf92b","sha256:ee50887e5a83b5060e560d5e18415c7d4a03bf5941d6c1e9e95143018a3db3cf","sha256:f102a93a539bd76b153174cbfcb09d0685ac22c1055e3deda0bda2bb11ec6586"]}],"invalid_events":[],"applied_event_ids":["sha256:bf9dd6dcea1f2c26925ba1f3d2be43016f877834900f64c1be51619f2932fb8f","sha256:cdffdcd71c3d07ad8217b94999ba9337e74ba611de4c87fc56d524d1bc1f03e4"],"state_sha256":"aa5b980fb1794cc4a7c3a4736a08fb2b9df222c710b7bfb688fe391637abedd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cq2qAca4vt+4G9oTMT8lbWO7oT8W4FbAItAGnAgSms31aokoPztKYPYPQckQWpawaaBDMLz2biQFEGIrjyMyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:22:34.955224Z","bundle_sha256":"62adcecc25f44d4263a67d7dac55c33c98b31c2224291938441410b48cf7f388"}}