{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BBUGCUB4645H6B5XZW5UFQRDT7","short_pith_number":"pith:BBUGCUB4","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"},"canonical_sha256":"086861503cf73a7f07b7cdbb42c2239fe21d2944df4d453bd458e73def0360d7","source":{"kind":"arxiv","id":"1306.1595","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BBUGCUB4645H6B5XZW5UFQRDT7","target":"record","payload":{"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"},"canonical_sha256":"086861503cf73a7f07b7cdbb42c2239fe21d2944df4d453bd458e73def0360d7","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"},"source_kind":"arxiv","source_id":"1306.1595","source_version":9,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4EGtnsICjoxVTh/SIx4del+FhYEFSABzDXDK8k1y8rP032x+megg29wM/0bhC+JNYCZBZPIciYjPCOzy4PuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:06:22.876056Z"},"content_sha256":"4d455a31dc5d6c7aba7919b3e98bc268a3ec1a0dde4c8e10af7533c53667ed21","schema_version":"1.0","event_id":"sha256:4d455a31dc5d6c7aba7919b3e98bc268a3ec1a0dde4c8e10af7533c53667ed21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BBUGCUB4645H6B5XZW5UFQRDT7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDGKSsoi3h71UhTVemjIqUBDG0NJQlt4UORrs7L0jXvilTDXeU64N10JA0f/kawtjq5cDALLcvqU/FYCBXmiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:06:22.876758Z"},"content_sha256":"8b2e27d977953cee303d5bd255c562cbcc3927453a7bc1bb2aa98a510e4c54be","schema_version":"1.0","event_id":"sha256:8b2e27d977953cee303d5bd255c562cbcc3927453a7bc1bb2aa98a510e4c54be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/bundle.json","state_url":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBUGCUB4645H6B5XZW5UFQRDT7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T05:06:22Z","links":{"resolver":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7","bundle":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/bundle.json","state":"https://pith.science/pith/BBUGCUB4645H6B5XZW5UFQRDT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBUGCUB4645H6B5XZW5UFQRDT7/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alSq4YNZnWjiQ90oI+U9frAgUQSxEdOVodLLrjcjCxGR//yyEz+lPtvpBfwLKaptyRE7A+b7oOcopNWT13AwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:06:22.879833Z","bundle_sha256":"44804fb5a2e3f74c52c8755dc3e157cfebec59c84231694824032885d4ef7719"}}