{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6VFBYS3R7N36OORVGGV26PV7TY","short_pith_number":"pith:6VFBYS3R","schema_version":"1.0","canonical_sha256":"f54a1c4b71fb77e73a3531abaf3ebf9e04305cc5b703af377341538e5d4704cd","source":{"kind":"arxiv","id":"1208.2223","version":3},"attestation_state":"computed","paper":{"title":"Structured Recursive Separator Decompositions for Planar Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Christian Sommer, Philip N. Klein, Shay Mozes","submitted_at":"2012-08-10T17:16:53Z","abstract_excerpt":"Given a planar graph G on n vertices and an integer parameter r<n, an r-division of G with few holes is a decomposition of G into O(n/r) regions of size at most r such that each region contains at most a constant number of faces that are not faces of G (also called holes), and such that, for each region, the total number of vertices on these faces is O(sqrt r).\n  We provide a linear-time algorithm for computing r-divisions with few holes. In fact, our algorithm computes a structure, called decomposition tree, which represents a recursive decomposition of G that includes r-divisions for essenti"},"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":"1208.2223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-08-10T17:16:53Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"de3357e872211175110824f01368d2f9efcaa5b9bffae7362b8b67662cecbac5","abstract_canon_sha256":"2acceef309bf74058de3b4157b191b95a4f40fabb36fdfb62315c68fcdcdef61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:26.111797Z","signature_b64":"WhL1jWx51lfTDqxIyYNVxGTAMWM4ZP5nWJgK2mpz3afR3Ea+GoOJ81IYCW3qNlHohvjqBDncBoeUckh32cNhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f54a1c4b71fb77e73a3531abaf3ebf9e04305cc5b703af377341538e5d4704cd","last_reissued_at":"2026-05-18T03:25:26.111288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:26.111288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Recursive Separator Decompositions for Planar Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Christian Sommer, Philip N. Klein, Shay Mozes","submitted_at":"2012-08-10T17:16:53Z","abstract_excerpt":"Given a planar graph G on n vertices and an integer parameter r<n, an r-division of G with few holes is a decomposition of G into O(n/r) regions of size at most r such that each region contains at most a constant number of faces that are not faces of G (also called holes), and such that, for each region, the total number of vertices on these faces is O(sqrt r).\n  We provide a linear-time algorithm for computing r-divisions with few holes. In fact, our algorithm computes a structure, called decomposition tree, which represents a recursive decomposition of G that includes r-divisions for essenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2223","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":""},"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":"1208.2223","created_at":"2026-05-18T03:25:26.111363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2223v3","created_at":"2026-05-18T03:25:26.111363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2223","created_at":"2026-05-18T03:25:26.111363+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VFBYS3R7N36","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VFBYS3R7N36OORV","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VFBYS3R","created_at":"2026-05-18T12:26:56.085431+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/6VFBYS3R7N36OORVGGV26PV7TY","json":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY.json","graph_json":"https://pith.science/api/pith-number/6VFBYS3R7N36OORVGGV26PV7TY/graph.json","events_json":"https://pith.science/api/pith-number/6VFBYS3R7N36OORVGGV26PV7TY/events.json","paper":"https://pith.science/paper/6VFBYS3R"},"agent_actions":{"view_html":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY","download_json":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY.json","view_paper":"https://pith.science/paper/6VFBYS3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2223&json=true","fetch_graph":"https://pith.science/api/pith-number/6VFBYS3R7N36OORVGGV26PV7TY/graph.json","fetch_events":"https://pith.science/api/pith-number/6VFBYS3R7N36OORVGGV26PV7TY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/action/storage_attestation","attest_author":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/action/author_attestation","sign_citation":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/action/citation_signature","submit_replication":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/action/replication_record"}},"created_at":"2026-05-18T03:25:26.111363+00:00","updated_at":"2026-05-18T03:25:26.111363+00:00"}