{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q5YMVIJWX45PXRBPKE352C5S6I","short_pith_number":"pith:Q5YMVIJW","schema_version":"1.0","canonical_sha256":"8770caa136bf3afbc42f5137dd0bb2f20ca905bb97c590274554bba171fe0622","source":{"kind":"arxiv","id":"2408.04264","version":3},"attestation_state":"computed","paper":{"title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Alexander Wolff, Grzegorz Gutowski, Myroslav Kryven, Oksana Firman, Yuto Okada","submitted_at":"2024-08-08T07:03:12Z","abstract_excerpt":"The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this paper, we study the treewidth of outer $k$-planar graphs, that is, graphs that admit a straight-line drawing where all the vertices lie on a circle, and every edge is crossed by at most $k$ other edges.\n  Wood and Telle [New York J. Math., 2007] showed that every outer $k$-planar graph has treewidth at most $3k + 11$ using so-called planar decompositions, and later, Auer et al. [Algorithmica, 2016] proved that the treewi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2408.04264","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-08-08T07:03:12Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f4eda317a081dd091679a8b0bd82768dfba7d2d5905ff6ceba226ecc446a1de5","abstract_canon_sha256":"598cf2527c64ea0894bb8ada3330bd11915ff49ab345b9bac396638060da6976"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:55.318096Z","signature_b64":"hWemTmn7bgnws4jOqlSIPQ1u5g7xERH6AOwNXJBinwbNoxQbbun8c1ChXMPv/tf1d6qlScydzzrRvevqhkFyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8770caa136bf3afbc42f5137dd0bb2f20ca905bb97c590274554bba171fe0622","last_reissued_at":"2026-07-05T10:52:55.317626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:55.317626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Alexander Wolff, Grzegorz Gutowski, Myroslav Kryven, Oksana Firman, Yuto Okada","submitted_at":"2024-08-08T07:03:12Z","abstract_excerpt":"The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this paper, we study the treewidth of outer $k$-planar graphs, that is, graphs that admit a straight-line drawing where all the vertices lie on a circle, and every edge is crossed by at most $k$ other edges.\n  Wood and Telle [New York J. Math., 2007] showed that every outer $k$-planar graph has treewidth at most $3k + 11$ using so-called planar decompositions, and later, Auer et al. [Algorithmica, 2016] proved that the treewi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04264","kind":"arxiv","version":3},"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/2408.04264/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2408.04264","created_at":"2026-07-05T10:52:55.317681+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.04264v3","created_at":"2026-07-05T10:52:55.317681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04264","created_at":"2026-07-05T10:52:55.317681+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5YMVIJWX45P","created_at":"2026-07-05T10:52:55.317681+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5YMVIJWX45PXRBP","created_at":"2026-07-05T10:52:55.317681+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5YMVIJW","created_at":"2026-07-05T10:52:55.317681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.04042","citing_title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I","json":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I.json","graph_json":"https://pith.science/api/pith-number/Q5YMVIJWX45PXRBPKE352C5S6I/graph.json","events_json":"https://pith.science/api/pith-number/Q5YMVIJWX45PXRBPKE352C5S6I/events.json","paper":"https://pith.science/paper/Q5YMVIJW"},"agent_actions":{"view_html":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I","download_json":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I.json","view_paper":"https://pith.science/paper/Q5YMVIJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.04264&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5YMVIJWX45PXRBPKE352C5S6I/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5YMVIJWX45PXRBPKE352C5S6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/action/storage_attestation","attest_author":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/action/author_attestation","sign_citation":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/action/citation_signature","submit_replication":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/action/replication_record"}},"created_at":"2026-07-05T10:52:55.317681+00:00","updated_at":"2026-07-05T10:52:55.317681+00:00"}