{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HXZEB6OG6Z4MF7DKXH6EH7XTCI","short_pith_number":"pith:HXZEB6OG","canonical_record":{"source":{"id":"1407.6869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-25T12:43:12Z","cross_cats_sorted":[],"title_canon_sha256":"b04fc5779c69f86b32259481811f4d8d7a2c819bf576558a46b98d1293299864","abstract_canon_sha256":"8c7cc06d5746cb5e71817bee756d2fd15e64d6526d5da2f53830c119f720129a"},"schema_version":"1.0"},"canonical_sha256":"3df240f9c6f678c2fc6ab9fc43fef3122b6b2f83fcf3ac3d69f0465e0762b3cf","source":{"kind":"arxiv","id":"1407.6869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6869","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6869v1","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6869","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"HXZEB6OG6Z4M","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HXZEB6OG6Z4MF7DK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HXZEB6OG","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HXZEB6OG6Z4MF7DKXH6EH7XTCI","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-25T12:43:12Z","cross_cats_sorted":[],"title_canon_sha256":"b04fc5779c69f86b32259481811f4d8d7a2c819bf576558a46b98d1293299864","abstract_canon_sha256":"8c7cc06d5746cb5e71817bee756d2fd15e64d6526d5da2f53830c119f720129a"},"schema_version":"1.0"},"canonical_sha256":"3df240f9c6f678c2fc6ab9fc43fef3122b6b2f83fcf3ac3d69f0465e0762b3cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:32.137597Z","signature_b64":"YHlDLW+uO1aMGSjFfKyFiDZll8Imz5pyGPec/6f30mQr25p7eEaOJQdvJOIqGS4VQd6BXCwwJ4oL6jK6qGYJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3df240f9c6f678c2fc6ab9fc43fef3122b6b2f83fcf3ac3d69f0465e0762b3cf","last_reissued_at":"2026-05-18T02:46:32.137142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:32.137142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6869","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-18T02:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VF6Ara7Kw7o60wqzIfPC3jE5oY4brwWWOF8MSCQ0MGpQR5WN3dfRyEKrX1XfeHD3h3E4xNJ8yqdIG0VOwbVTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:29:44.162059Z"},"content_sha256":"69ebd040e608d565c07840553c2a12804259829b951a355f5e602e3160dfa7ed","schema_version":"1.0","event_id":"sha256:69ebd040e608d565c07840553c2a12804259829b951a355f5e602e3160dfa7ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HXZEB6OG6Z4MF7DKXH6EH7XTCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen","submitted_at":"2014-07-25T12:43:12Z","abstract_excerpt":"Plotkin, Rao, and Smith (SODA'97) showed that any graph with $m$ edges and $n$ vertices that excludes $K_h$ as a depth $O(\\ell\\log n)$-minor has a separator of size $O(n/\\ell + \\ell h^2\\log n)$ and that such a separator can be found in $O(mn/\\ell)$ time. A time bound of $O(m + n^{2+\\epsilon}/\\ell)$ for any constant $\\epsilon > 0$ was later given (W., FOCS'11) which is an improvement for non-sparse graphs. We give three new algorithms. The first has the same separator size and running time $O(\\mbox{poly}(h)\\ell m^{1+\\epsilon})$. This is a significant improvement for small $h$ and $\\ell$. If $\\e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6869","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-18T02:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQFHOSxBtErJqIKTjaGcQ6pNkPuPAZ2GJFeaU8gSbEscE4XNusz+o7HZif0ClSlrZ/YX6VeLf4S64fUZ8SsBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:29:44.162420Z"},"content_sha256":"159f87011d9ec433504a11fc9a7d260151a6e525d8e59f6ac1e679313214adfd","schema_version":"1.0","event_id":"sha256:159f87011d9ec433504a11fc9a7d260151a6e525d8e59f6ac1e679313214adfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXZEB6OG6Z4MF7DKXH6EH7XTCI/bundle.json","state_url":"https://pith.science/pith/HXZEB6OG6Z4MF7DKXH6EH7XTCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXZEB6OG6Z4MF7DKXH6EH7XTCI/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-05T11:29:44Z","links":{"resolver":"https://pith.science/pith/HXZEB6OG6Z4MF7DKXH6EH7XTCI","bundle":"https://pith.science/pith/HXZEB6OG6Z4MF7DKXH6EH7XTCI/bundle.json","state":"https://pith.science/pith/HXZEB6OG6Z4MF7DKXH6EH7XTCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXZEB6OG6Z4MF7DKXH6EH7XTCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HXZEB6OG6Z4MF7DKXH6EH7XTCI","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":"8c7cc06d5746cb5e71817bee756d2fd15e64d6526d5da2f53830c119f720129a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-25T12:43:12Z","title_canon_sha256":"b04fc5779c69f86b32259481811f4d8d7a2c819bf576558a46b98d1293299864"},"schema_version":"1.0","source":{"id":"1407.6869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6869","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6869v1","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6869","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"HXZEB6OG6Z4M","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HXZEB6OG6Z4MF7DK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HXZEB6OG","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:159f87011d9ec433504a11fc9a7d260151a6e525d8e59f6ac1e679313214adfd","target":"graph","created_at":"2026-05-18T02:46:32Z","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":"Plotkin, Rao, and Smith (SODA'97) showed that any graph with $m$ edges and $n$ vertices that excludes $K_h$ as a depth $O(\\ell\\log n)$-minor has a separator of size $O(n/\\ell + \\ell h^2\\log n)$ and that such a separator can be found in $O(mn/\\ell)$ time. A time bound of $O(m + n^{2+\\epsilon}/\\ell)$ for any constant $\\epsilon > 0$ was later given (W., FOCS'11) which is an improvement for non-sparse graphs. We give three new algorithms. The first has the same separator size and running time $O(\\mbox{poly}(h)\\ell m^{1+\\epsilon})$. This is a significant improvement for small $h$ and $\\ell$. If $\\e","authors_text":"Christian Wulff-Nilsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-25T12:43:12Z","title":"Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6869","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:69ebd040e608d565c07840553c2a12804259829b951a355f5e602e3160dfa7ed","target":"record","created_at":"2026-05-18T02:46:32Z","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":"8c7cc06d5746cb5e71817bee756d2fd15e64d6526d5da2f53830c119f720129a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-25T12:43:12Z","title_canon_sha256":"b04fc5779c69f86b32259481811f4d8d7a2c819bf576558a46b98d1293299864"},"schema_version":"1.0","source":{"id":"1407.6869","kind":"arxiv","version":1}},"canonical_sha256":"3df240f9c6f678c2fc6ab9fc43fef3122b6b2f83fcf3ac3d69f0465e0762b3cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3df240f9c6f678c2fc6ab9fc43fef3122b6b2f83fcf3ac3d69f0465e0762b3cf","first_computed_at":"2026-05-18T02:46:32.137142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:32.137142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YHlDLW+uO1aMGSjFfKyFiDZll8Imz5pyGPec/6f30mQr25p7eEaOJQdvJOIqGS4VQd6BXCwwJ4oL6jK6qGYJBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:32.137597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69ebd040e608d565c07840553c2a12804259829b951a355f5e602e3160dfa7ed","sha256:159f87011d9ec433504a11fc9a7d260151a6e525d8e59f6ac1e679313214adfd"],"state_sha256":"25e75a70d36aef19cb938f538100baadeb5254de455a13a85fe6e4278cbdb800"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5TQgutLkL5UaPxiUZ//Nc+35O3amL5jgcsKZ9XHPVzQ4UXFELbzmjtme6HTuyNO9IoEUpzVR8Nl4b/otKnsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:29:44.164445Z","bundle_sha256":"6265952de845f6b10906860afaced80478b8a5eb3e6b3c32b4fcfe7d96ebc292"}}