{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XAKV34YW5TDM5EO6KCG4TG2W25","short_pith_number":"pith:XAKV34YW","canonical_record":{"source":{"id":"1502.04588","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"98f0ebef66322dacb4a7cf2a0732d715fd3ef051c28269da5ba7abde3411f589","abstract_canon_sha256":"6619f34669adc77750495c73d983f55f4797004eafb9780b5a4214abf63a2e80"},"schema_version":"1.0"},"canonical_sha256":"b8155df316ecc6ce91de508dc99b56d765298cbd26f11ba99583f7b4e68ffc70","source":{"kind":"arxiv","id":"1502.04588","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04588","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04588v6","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04588","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"XAKV34YW5TDM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XAKV34YW5TDM5EO6","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XAKV34YW","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XAKV34YW5TDM5EO6KCG4TG2W25","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04588","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"98f0ebef66322dacb4a7cf2a0732d715fd3ef051c28269da5ba7abde3411f589","abstract_canon_sha256":"6619f34669adc77750495c73d983f55f4797004eafb9780b5a4214abf63a2e80"},"schema_version":"1.0"},"canonical_sha256":"b8155df316ecc6ce91de508dc99b56d765298cbd26f11ba99583f7b4e68ffc70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:59.390362Z","signature_b64":"FzMVgcXYCVUdE9Lf7fcqXUvWICdomKXU6d9CUUEZ+2sq+H0EgeN1DIJqnGeR3EvHBVMQkkz/J6VZlQ7plfAYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8155df316ecc6ce91de508dc99b56d765298cbd26f11ba99583f7b4e68ffc70","last_reissued_at":"2026-05-17T23:42:59.389957Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:59.389957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04588","source_version":6,"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-17T23:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTzyuGQzY9VHsKOX29C4MB/85dWyDIET3ogtKPd2AxlnM9gA02qBIX03LIaNBpU7q44inYDAYMjQ13PjE73nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:54:52.117906Z"},"content_sha256":"71e72463db61ead6ae62f3292f4f9437201e96ca4c5469bebf2d886c4c9dfc94","schema_version":"1.0","event_id":"sha256:71e72463db61ead6ae62f3292f4f9437201e96ca4c5469bebf2d886c4c9dfc94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XAKV34YW5TDM5EO6KCG4TG2W25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A $(1 + {\\varepsilon})$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Emil Feldmann, Ian Post, Jochen K\\\"onemann, Wai Shing Fung","submitted_at":"2015-02-16T16:00:09Z","abstract_excerpt":"Graphs with bounded highway dimension were introduced by Abraham et al. [SODA 2010] as a model of transportation networks. We show that any such graph can be embedded into a distribution over bounded treewidth graphs with arbitrarily small distortion. More concretely, given a weighted graph G = (V, E) of constant highway dimension, we show how to randomly compute a weighted graph H = (V, E') that distorts shortest path distances of G by at most a 1 + ${\\varepsilon}$ factor in expectation, and whose treewidth is polylogarithmic in the aspect ratio of G. Our probabilistic embedding implies quasi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04588","kind":"arxiv","version":6},"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-17T23:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kw1uGUwmjcR93kxJU54nBIx6exm+uEhsQ8ls/vCVQ+bnOIpSZXoOs3bM87lH9RorSCsHe3/qSAnX2CbrF4Y6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:54:52.118654Z"},"content_sha256":"faa0cc1a07d9893f24e8ae675f18c5c46ddb4230484c2ff5b0444e090d3ea080","schema_version":"1.0","event_id":"sha256:faa0cc1a07d9893f24e8ae675f18c5c46ddb4230484c2ff5b0444e090d3ea080"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XAKV34YW5TDM5EO6KCG4TG2W25/bundle.json","state_url":"https://pith.science/pith/XAKV34YW5TDM5EO6KCG4TG2W25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XAKV34YW5TDM5EO6KCG4TG2W25/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-31T11:54:52Z","links":{"resolver":"https://pith.science/pith/XAKV34YW5TDM5EO6KCG4TG2W25","bundle":"https://pith.science/pith/XAKV34YW5TDM5EO6KCG4TG2W25/bundle.json","state":"https://pith.science/pith/XAKV34YW5TDM5EO6KCG4TG2W25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XAKV34YW5TDM5EO6KCG4TG2W25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XAKV34YW5TDM5EO6KCG4TG2W25","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":"6619f34669adc77750495c73d983f55f4797004eafb9780b5a4214abf63a2e80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:00:09Z","title_canon_sha256":"98f0ebef66322dacb4a7cf2a0732d715fd3ef051c28269da5ba7abde3411f589"},"schema_version":"1.0","source":{"id":"1502.04588","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04588","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04588v6","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04588","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"XAKV34YW5TDM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XAKV34YW5TDM5EO6","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XAKV34YW","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:faa0cc1a07d9893f24e8ae675f18c5c46ddb4230484c2ff5b0444e090d3ea080","target":"graph","created_at":"2026-05-17T23:42:59Z","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":"Graphs with bounded highway dimension were introduced by Abraham et al. [SODA 2010] as a model of transportation networks. We show that any such graph can be embedded into a distribution over bounded treewidth graphs with arbitrarily small distortion. More concretely, given a weighted graph G = (V, E) of constant highway dimension, we show how to randomly compute a weighted graph H = (V, E') that distorts shortest path distances of G by at most a 1 + ${\\varepsilon}$ factor in expectation, and whose treewidth is polylogarithmic in the aspect ratio of G. Our probabilistic embedding implies quasi","authors_text":"Andreas Emil Feldmann, Ian Post, Jochen K\\\"onemann, Wai Shing Fung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:00:09Z","title":"A $(1 + {\\varepsilon})$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04588","kind":"arxiv","version":6},"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:71e72463db61ead6ae62f3292f4f9437201e96ca4c5469bebf2d886c4c9dfc94","target":"record","created_at":"2026-05-17T23:42:59Z","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":"6619f34669adc77750495c73d983f55f4797004eafb9780b5a4214abf63a2e80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:00:09Z","title_canon_sha256":"98f0ebef66322dacb4a7cf2a0732d715fd3ef051c28269da5ba7abde3411f589"},"schema_version":"1.0","source":{"id":"1502.04588","kind":"arxiv","version":6}},"canonical_sha256":"b8155df316ecc6ce91de508dc99b56d765298cbd26f11ba99583f7b4e68ffc70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8155df316ecc6ce91de508dc99b56d765298cbd26f11ba99583f7b4e68ffc70","first_computed_at":"2026-05-17T23:42:59.389957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:59.389957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FzMVgcXYCVUdE9Lf7fcqXUvWICdomKXU6d9CUUEZ+2sq+H0EgeN1DIJqnGeR3EvHBVMQkkz/J6VZlQ7plfAYCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:59.390362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04588","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71e72463db61ead6ae62f3292f4f9437201e96ca4c5469bebf2d886c4c9dfc94","sha256:faa0cc1a07d9893f24e8ae675f18c5c46ddb4230484c2ff5b0444e090d3ea080"],"state_sha256":"071a9aa4834574ba902da99d10caf9c04659e0e696cc9a92cf82651eb1165540"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXapdjM2ysFWcSW7+wCP4fMIe1t5vBhUEI84xioS3y5/LWWXfR5cZtWDAnKq+oog6OLSq/F+Q3eHyyrN12baAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:54:52.124297Z","bundle_sha256":"4755b5d1906cf28d8fd01e02a3b6385824fd5566efdb418ce13a5f962ecfbde2"}}