{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:S4QIVOJ7OLNMUHH6YCGVZSB6UJ","short_pith_number":"pith:S4QIVOJ7","canonical_record":{"source":{"id":"1107.1292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-07T04:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"f893601bc1d0ecfa7ffd2c1bb8024bc14ccfc7d9ae7dc3662dfcb61c6ffce54b","abstract_canon_sha256":"04e97c804a2679b495c641ada61679e97c8e6496b19195639083bd5cd7841d9c"},"schema_version":"1.0"},"canonical_sha256":"97208ab93f72daca1cfec08d5cc83ea276e2547a0c50a0a5cb24d31a9552d09b","source":{"kind":"arxiv","id":"1107.1292","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1292","created_at":"2026-05-18T04:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1292v1","created_at":"2026-05-18T04:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1292","created_at":"2026-05-18T04:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"S4QIVOJ7OLNM","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S4QIVOJ7OLNMUHH6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S4QIVOJ7","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:S4QIVOJ7OLNMUHH6YCGVZSB6UJ","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-07T04:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"f893601bc1d0ecfa7ffd2c1bb8024bc14ccfc7d9ae7dc3662dfcb61c6ffce54b","abstract_canon_sha256":"04e97c804a2679b495c641ada61679e97c8e6496b19195639083bd5cd7841d9c"},"schema_version":"1.0"},"canonical_sha256":"97208ab93f72daca1cfec08d5cc83ea276e2547a0c50a0a5cb24d31a9552d09b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:44.233654Z","signature_b64":"3YeJ2jb+/Nzb2DL/v7PhAwS2NclJA+QVPqyP3S4o2u5d9JTMgybyRgH21+Ohtc1KOZGLQBlUScDdfyTKs/GAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97208ab93f72daca1cfec08d5cc83ea276e2547a0c50a0a5cb24d31a9552d09b","last_reissued_at":"2026-05-18T04:18:44.233010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:44.233010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1292","source_version":1,"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-18T04:18:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyvUcZT8M7zsgFJF98/6kO3Qbq1XpBPZE3nNv8lrQKhXCEHN9xqHGVTO4p6/QaUTJdb59e+sGAu1IhRuaWUCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:26:29.503125Z"},"content_sha256":"fe93f1a4af8f92bbd4d593bcc9f2f05cf5155ee75073ac9a2e98dcfab3562795","schema_version":"1.0","event_id":"sha256:fe93f1a4af8f92bbd4d593bcc9f2f05cf5155ee75073ac9a2e98dcfab3562795"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:S4QIVOJ7OLNMUHH6YCGVZSB6UJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen","submitted_at":"2011-07-07T04:28:37Z","abstract_excerpt":"Alon, Seymour, and Thomas generalized Lipton and Tarjan's planar separator theorem and showed that a $K_h$-minor free graph with $n$ vertices has a separator of size at most $h^{3/2}\\sqrt n$. They gave an algorithm that, given a graph $G$ with $m$ edges and $n$ vertices and given an integer $h\\geq 1$, outputs in $O(\\sqrt{hn}m)$ time such a separator or a $K_h$-minor of $G$. Plotkin, Rao, and Smith gave an $O(hm\\sqrt{n\\log n})$ time algorithm to find a separator of size $O(h\\sqrt{n\\log n})$. Kawarabayashi and Reed improved the bound on the size of the separator to $h\\sqrt n$ and gave an algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1292","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"},"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-18T04:18:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzIxhP2IwCDX9XBbTLGvjqudVvTeLo+ky0IZCuJjSyIKsP959GsEVkIeitgb3G/GWGUG0XNv9n/CUsOAcazmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:26:29.503485Z"},"content_sha256":"0fe43afd0e6525dc3ce78649d9c294c8e0c764c1bc5e6f66a506d286ed0a63c6","schema_version":"1.0","event_id":"sha256:0fe43afd0e6525dc3ce78649d9c294c8e0c764c1bc5e6f66a506d286ed0a63c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4QIVOJ7OLNMUHH6YCGVZSB6UJ/bundle.json","state_url":"https://pith.science/pith/S4QIVOJ7OLNMUHH6YCGVZSB6UJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4QIVOJ7OLNMUHH6YCGVZSB6UJ/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-06-05T15:26:29Z","links":{"resolver":"https://pith.science/pith/S4QIVOJ7OLNMUHH6YCGVZSB6UJ","bundle":"https://pith.science/pith/S4QIVOJ7OLNMUHH6YCGVZSB6UJ/bundle.json","state":"https://pith.science/pith/S4QIVOJ7OLNMUHH6YCGVZSB6UJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4QIVOJ7OLNMUHH6YCGVZSB6UJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:S4QIVOJ7OLNMUHH6YCGVZSB6UJ","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":"04e97c804a2679b495c641ada61679e97c8e6496b19195639083bd5cd7841d9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-07T04:28:37Z","title_canon_sha256":"f893601bc1d0ecfa7ffd2c1bb8024bc14ccfc7d9ae7dc3662dfcb61c6ffce54b"},"schema_version":"1.0","source":{"id":"1107.1292","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1292","created_at":"2026-05-18T04:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1292v1","created_at":"2026-05-18T04:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1292","created_at":"2026-05-18T04:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"S4QIVOJ7OLNM","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S4QIVOJ7OLNMUHH6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S4QIVOJ7","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:0fe43afd0e6525dc3ce78649d9c294c8e0c764c1bc5e6f66a506d286ed0a63c6","target":"graph","created_at":"2026-05-18T04:18:44Z","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":"Alon, Seymour, and Thomas generalized Lipton and Tarjan's planar separator theorem and showed that a $K_h$-minor free graph with $n$ vertices has a separator of size at most $h^{3/2}\\sqrt n$. They gave an algorithm that, given a graph $G$ with $m$ edges and $n$ vertices and given an integer $h\\geq 1$, outputs in $O(\\sqrt{hn}m)$ time such a separator or a $K_h$-minor of $G$. Plotkin, Rao, and Smith gave an $O(hm\\sqrt{n\\log n})$ time algorithm to find a separator of size $O(h\\sqrt{n\\log n})$. Kawarabayashi and Reed improved the bound on the size of the separator to $h\\sqrt n$ and gave an algorit","authors_text":"Christian Wulff-Nilsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-07T04:28:37Z","title":"Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1292","kind":"arxiv","version":1},"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:fe93f1a4af8f92bbd4d593bcc9f2f05cf5155ee75073ac9a2e98dcfab3562795","target":"record","created_at":"2026-05-18T04:18:44Z","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":"04e97c804a2679b495c641ada61679e97c8e6496b19195639083bd5cd7841d9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-07T04:28:37Z","title_canon_sha256":"f893601bc1d0ecfa7ffd2c1bb8024bc14ccfc7d9ae7dc3662dfcb61c6ffce54b"},"schema_version":"1.0","source":{"id":"1107.1292","kind":"arxiv","version":1}},"canonical_sha256":"97208ab93f72daca1cfec08d5cc83ea276e2547a0c50a0a5cb24d31a9552d09b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97208ab93f72daca1cfec08d5cc83ea276e2547a0c50a0a5cb24d31a9552d09b","first_computed_at":"2026-05-18T04:18:44.233010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:44.233010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3YeJ2jb+/Nzb2DL/v7PhAwS2NclJA+QVPqyP3S4o2u5d9JTMgybyRgH21+Ohtc1KOZGLQBlUScDdfyTKs/GAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:44.233654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1292","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe93f1a4af8f92bbd4d593bcc9f2f05cf5155ee75073ac9a2e98dcfab3562795","sha256:0fe43afd0e6525dc3ce78649d9c294c8e0c764c1bc5e6f66a506d286ed0a63c6"],"state_sha256":"4b90bf71fdd880fcc811506d7c9fce450d3092778da57fd34318941b06b3c300"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oAelaMLEDTAfz43FfVKBSM+cCM/hInCx59pyZK+kuP1pT6FcD8Jbax5IEV6GCCEnJepbGGcQIv6Mm2oFeISPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:26:29.505466Z","bundle_sha256":"d0ad8f45d49cdc40c3a27f27b74fbbb040d3c4edad66cb060ada4a216278567c"}}