{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BBUGCUB4645H6B5XZW5UFQRDT7","short_pith_number":"pith:BBUGCUB4","schema_version":"1.0","canonical_sha256":"086861503cf73a7f07b7cdbb42c2239fe21d2944df4d453bd458e73def0360d7","source":{"kind":"arxiv","id":"1306.1595","version":9},"attestation_state":"computed","paper":{"title":"Layered Separators in Minor-Closed Graph Classes with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Pat Morin, Vida Dujmovi\\'c","submitted_at":"2013-06-07T03:16:39Z","abstract_excerpt":"Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as $\\Omega(\\sqrt{n})$ in graphs with $n$ vertices. This is the case for planar graphs, and more generally, for proper minor-closed classes. We study a special type of graph separator, called a \"layered separator\", which may have linear size in $n$, but has bounded size with respect to a different measure, called the \"width\". We prove, for example, that planar graphs and graphs of bounded Euler genus admit layered "},"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":"1306.1595","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-07T03:16:39Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"cdd7fbc176c506fb47fd863e8cea2325bbab633818cda87f7e6e9b0a3f5cae50","abstract_canon_sha256":"a069e97a8988b3aca7262b0aa65018afcb3ae204245ade9557e6902492c4bfdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:51.081482Z","signature_b64":"ezv2sIZyyW59BX6gJGuSwBWfgPBr6WcPdpfE6KkQDGKCe2I8XSIXkUrDRCvaAbHIxFMpMDOXaIzGSrZ+XJEkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"086861503cf73a7f07b7cdbb42c2239fe21d2944df4d453bd458e73def0360d7","last_reissued_at":"2026-05-18T00:12:51.080948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:51.080948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layered Separators in Minor-Closed Graph Classes with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Pat Morin, Vida Dujmovi\\'c","submitted_at":"2013-06-07T03:16:39Z","abstract_excerpt":"Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as $\\Omega(\\sqrt{n})$ in graphs with $n$ vertices. This is the case for planar graphs, and more generally, for proper minor-closed classes. We study a special type of graph separator, called a \"layered separator\", which may have linear size in $n$, but has bounded size with respect to a different measure, called the \"width\". We prove, for example, that planar graphs and graphs of bounded Euler genus admit layered "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1595","kind":"arxiv","version":9},"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":"1306.1595","created_at":"2026-05-18T00:12:51.081026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1595v9","created_at":"2026-05-18T00:12:51.081026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1595","created_at":"2026-05-18T00:12:51.081026+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBUGCUB4645H","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBUGCUB4645H6B5X","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBUGCUB4","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01140","citing_title":"Tree decompositions with small width, spread, order and degree","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07903","citing_title":"Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7","json":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7.json","graph_json":"https://pith.science/api/pith-number/BBUGCUB4645H6B5XZW5UFQRDT7/graph.json","events_json":"https://pith.science/api/pith-number/BBUGCUB4645H6B5XZW5UFQRDT7/events.json","paper":"https://pith.science/paper/BBUGCUB4"},"agent_actions":{"view_html":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7","download_json":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7.json","view_paper":"https://pith.science/paper/BBUGCUB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1595&json=true","fetch_graph":"https://pith.science/api/pith-number/BBUGCUB4645H6B5XZW5UFQRDT7/graph.json","fetch_events":"https://pith.science/api/pith-number/BBUGCUB4645H6B5XZW5UFQRDT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/action/storage_attestation","attest_author":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/action/author_attestation","sign_citation":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/action/citation_signature","submit_replication":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/action/replication_record"}},"created_at":"2026-05-18T00:12:51.081026+00:00","updated_at":"2026-05-18T00:12:51.081026+00:00"}