{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4VI474ATQFRBVD7XRHI6BE276R","short_pith_number":"pith:4VI474AT","schema_version":"1.0","canonical_sha256":"e551cff01381621a8ff789d1e0935ff4749644d21d9a64436e0bfe22813f9634","source":{"kind":"arxiv","id":"1505.04235","version":1},"attestation_state":"computed","paper":{"title":"Triangulating planar graphs while keeping the pathwidth small","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Therese Biedl","submitted_at":"2015-05-16T02:36:22Z","abstract_excerpt":"Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without increasing the pathwidth by much.\n  We show that if a planar graph has pathwidth $k$, then we can triangulate it so that the resulting graph has pathwidth $O(k)$ (where the factors are 1, 8 and 16 for 3-connected, 2-connected and arbitrary graphs). With similar techniques, we also show that any outer-planar graph of pathwidth $k$ can be turned into a maximal "},"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":"1505.04235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-16T02:36:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"46357ef04568d89801a2c73b50340fe387f01f993c149670702b338ef8d01f71","abstract_canon_sha256":"5a8e8cdd623b0189fb9f1437b3ffb1c1d243b8285ff32d8e149d028c3fa83d6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:26.024254Z","signature_b64":"EeBd9pgt2mU5ztTPURcCRCqVGJOJXSpX6Y81VpyYgNiF74OWdVV9l4FPc5u87EnNxI3Ra7lVyBGclHHY625UBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e551cff01381621a8ff789d1e0935ff4749644d21d9a64436e0bfe22813f9634","last_reissued_at":"2026-05-18T02:07:26.023894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:26.023894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangulating planar graphs while keeping the pathwidth small","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Therese Biedl","submitted_at":"2015-05-16T02:36:22Z","abstract_excerpt":"Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without increasing the pathwidth by much.\n  We show that if a planar graph has pathwidth $k$, then we can triangulate it so that the resulting graph has pathwidth $O(k)$ (where the factors are 1, 8 and 16 for 3-connected, 2-connected and arbitrary graphs). With similar techniques, we also show that any outer-planar graph of pathwidth $k$ can be turned into a maximal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04235","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":""},"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":"1505.04235","created_at":"2026-05-18T02:07:26.023948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04235v1","created_at":"2026-05-18T02:07:26.023948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04235","created_at":"2026-05-18T02:07:26.023948+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VI474ATQFRB","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VI474ATQFRBVD7X","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VI474AT","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R","json":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R.json","graph_json":"https://pith.science/api/pith-number/4VI474ATQFRBVD7XRHI6BE276R/graph.json","events_json":"https://pith.science/api/pith-number/4VI474ATQFRBVD7XRHI6BE276R/events.json","paper":"https://pith.science/paper/4VI474AT"},"agent_actions":{"view_html":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R","download_json":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R.json","view_paper":"https://pith.science/paper/4VI474AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04235&json=true","fetch_graph":"https://pith.science/api/pith-number/4VI474ATQFRBVD7XRHI6BE276R/graph.json","fetch_events":"https://pith.science/api/pith-number/4VI474ATQFRBVD7XRHI6BE276R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R/action/storage_attestation","attest_author":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R/action/author_attestation","sign_citation":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R/action/citation_signature","submit_replication":"https://pith.science/pith/4VI474ATQFRBVD7XRHI6BE276R/action/replication_record"}},"created_at":"2026-05-18T02:07:26.023948+00:00","updated_at":"2026-05-18T02:07:26.023948+00:00"}