{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BBUGCUB4645H6B5XZW5UFQRDT7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a069e97a8988b3aca7262b0aa65018afcb3ae204245ade9557e6902492c4bfdd","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-07T03:16:39Z","title_canon_sha256":"cdd7fbc176c506fb47fd863e8cea2325bbab633818cda87f7e6e9b0a3f5cae50"},"schema_version":"1.0","source":{"id":"1306.1595","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1595","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1595v9","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1595","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"BBUGCUB4645H","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BBUGCUB4645H6B5X","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BBUGCUB4","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:8b2e27d977953cee303d5bd255c562cbcc3927453a7bc1bb2aa98a510e4c54be","target":"graph","created_at":"2026-05-18T00:12:51Z","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"},"paper":{"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 ","authors_text":"David R. Wood, Pat Morin, Vida Dujmovi\\'c","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-07T03:16:39Z","title":"Layered Separators in Minor-Closed Graph Classes with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1595","kind":"arxiv","version":9},"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:4d455a31dc5d6c7aba7919b3e98bc268a3ec1a0dde4c8e10af7533c53667ed21","target":"record","created_at":"2026-05-18T00:12:51Z","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":"a069e97a8988b3aca7262b0aa65018afcb3ae204245ade9557e6902492c4bfdd","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-07T03:16:39Z","title_canon_sha256":"cdd7fbc176c506fb47fd863e8cea2325bbab633818cda87f7e6e9b0a3f5cae50"},"schema_version":"1.0","source":{"id":"1306.1595","kind":"arxiv","version":9}},"canonical_sha256":"086861503cf73a7f07b7cdbb42c2239fe21d2944df4d453bd458e73def0360d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"086861503cf73a7f07b7cdbb42c2239fe21d2944df4d453bd458e73def0360d7","first_computed_at":"2026-05-18T00:12:51.080948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:51.080948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ezv2sIZyyW59BX6gJGuSwBWfgPBr6WcPdpfE6KkQDGKCe2I8XSIXkUrDRCvaAbHIxFMpMDOXaIzGSrZ+XJEkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:51.081482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1595","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d455a31dc5d6c7aba7919b3e98bc268a3ec1a0dde4c8e10af7533c53667ed21","sha256:8b2e27d977953cee303d5bd255c562cbcc3927453a7bc1bb2aa98a510e4c54be"],"state_sha256":"723ff8b7e12c3e380a42e5d1178b78c509ba58acec2fc0a221fe979b4505552f"}