{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2SUFMMW4XHV2SR6AOSM5PQB736","short_pith_number":"pith:2SUFMMW4","canonical_record":{"source":{"id":"1605.04651","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-16T05:28:30Z","cross_cats_sorted":[],"title_canon_sha256":"470fdd34046214645f6ab1ae3c7a485ba947574e94879bdb4d6082744420da4c","abstract_canon_sha256":"a92251d05cb085b975980c8560e3896a1a8f7a6d89dc01dd2e5ed509657a5d84"},"schema_version":"1.0"},"canonical_sha256":"d4a85632dcb9eba947c07499d7c03fdf9b138255b6f4c79d2c58020283bb295c","source":{"kind":"arxiv","id":"1605.04651","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04651","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04651v4","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04651","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"2SUFMMW4XHV2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2SUFMMW4XHV2SR6A","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2SUFMMW4","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2SUFMMW4XHV2SR6AOSM5PQB736","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04651","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-16T05:28:30Z","cross_cats_sorted":[],"title_canon_sha256":"470fdd34046214645f6ab1ae3c7a485ba947574e94879bdb4d6082744420da4c","abstract_canon_sha256":"a92251d05cb085b975980c8560e3896a1a8f7a6d89dc01dd2e5ed509657a5d84"},"schema_version":"1.0"},"canonical_sha256":"d4a85632dcb9eba947c07499d7c03fdf9b138255b6f4c79d2c58020283bb295c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:39.746501Z","signature_b64":"gP/zsrpbuvx5TEr7JILBBI/tY036YQiphuiiV1vB+yz68Lrij8Li/rdMaSCIQmrOVI4eIt8B61r5oU46ePlwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4a85632dcb9eba947c07499d7c03fdf9b138255b6f4c79d2c58020283bb295c","last_reissued_at":"2026-05-18T00:43:39.745976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:39.745976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04651","source_version":4,"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:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCc8KHzOYJNr1nlslnVf59lHXg6QgIef0nzZ+2RXeGwbVIMHx4VHZGxtgTcG/7+Brq2oK1oNpun9qMqPX+HRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:17:17.551956Z"},"content_sha256":"c5516525f75aca938bfcc18bfd8a6a6185f654b7e19f537cb428bb914f598316","schema_version":"1.0","event_id":"sha256:c5516525f75aca938bfcc18bfd8a6a6185f654b7e19f537cb428bb914f598316"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2SUFMMW4XHV2SR6AOSM5PQB736","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Construction of Probabilistic Tree Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy E. Blelloch, Yan Gu, Yihan Sun","submitted_at":"2016-05-16T05:28:30Z","abstract_excerpt":"In this paper we describe an algorithm that embeds a graph metric $(V,d_G)$ on an undirected weighted graph $G=(V,E)$ into a distribution of tree metrics $(T,D_T)$ such that for every pair $u,v\\in V$, $d_G(u,v)\\leq d_T(u,v)$ and ${\\bf{E}}_{T}[d_T(u,v)]\\leq O(\\log n)\\cdot d_G(u,v)$. Such embeddings have proved highly useful in designing fast approximation algorithms, as many hard problems on graphs are easy to solve on tree instances. For a graph with $n$ vertices and $m$ edges, our algorithm runs in $O(m\\log n)$ time with high probability, which improves the previous upper bound of $O(m\\log^3 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04651","kind":"arxiv","version":4},"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:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nv+lW3tmxjn3uaRaxGGFlGGLw3LiWt1K5tYJgfjOOUUmOx5Ev25euMySYVoZG2dlKDShhNc34qlNGgUA7HnmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:17:17.552303Z"},"content_sha256":"dcaf7d2a46cbbb75291dc833daa4f9b0979f1fb35a71966ca9d2c1da3c55ea12","schema_version":"1.0","event_id":"sha256:dcaf7d2a46cbbb75291dc833daa4f9b0979f1fb35a71966ca9d2c1da3c55ea12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/bundle.json","state_url":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SUFMMW4XHV2SR6AOSM5PQB736/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-07T10:17:17Z","links":{"resolver":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736","bundle":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/bundle.json","state":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SUFMMW4XHV2SR6AOSM5PQB736/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2SUFMMW4XHV2SR6AOSM5PQB736","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":"a92251d05cb085b975980c8560e3896a1a8f7a6d89dc01dd2e5ed509657a5d84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-16T05:28:30Z","title_canon_sha256":"470fdd34046214645f6ab1ae3c7a485ba947574e94879bdb4d6082744420da4c"},"schema_version":"1.0","source":{"id":"1605.04651","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04651","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04651v4","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04651","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"2SUFMMW4XHV2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2SUFMMW4XHV2SR6A","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2SUFMMW4","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:dcaf7d2a46cbbb75291dc833daa4f9b0979f1fb35a71966ca9d2c1da3c55ea12","target":"graph","created_at":"2026-05-18T00:43:39Z","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":"In this paper we describe an algorithm that embeds a graph metric $(V,d_G)$ on an undirected weighted graph $G=(V,E)$ into a distribution of tree metrics $(T,D_T)$ such that for every pair $u,v\\in V$, $d_G(u,v)\\leq d_T(u,v)$ and ${\\bf{E}}_{T}[d_T(u,v)]\\leq O(\\log n)\\cdot d_G(u,v)$. Such embeddings have proved highly useful in designing fast approximation algorithms, as many hard problems on graphs are easy to solve on tree instances. For a graph with $n$ vertices and $m$ edges, our algorithm runs in $O(m\\log n)$ time with high probability, which improves the previous upper bound of $O(m\\log^3 ","authors_text":"Guy E. Blelloch, Yan Gu, Yihan Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-16T05:28:30Z","title":"Efficient Construction of Probabilistic Tree Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04651","kind":"arxiv","version":4},"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:c5516525f75aca938bfcc18bfd8a6a6185f654b7e19f537cb428bb914f598316","target":"record","created_at":"2026-05-18T00:43:39Z","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":"a92251d05cb085b975980c8560e3896a1a8f7a6d89dc01dd2e5ed509657a5d84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-16T05:28:30Z","title_canon_sha256":"470fdd34046214645f6ab1ae3c7a485ba947574e94879bdb4d6082744420da4c"},"schema_version":"1.0","source":{"id":"1605.04651","kind":"arxiv","version":4}},"canonical_sha256":"d4a85632dcb9eba947c07499d7c03fdf9b138255b6f4c79d2c58020283bb295c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4a85632dcb9eba947c07499d7c03fdf9b138255b6f4c79d2c58020283bb295c","first_computed_at":"2026-05-18T00:43:39.745976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:39.745976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gP/zsrpbuvx5TEr7JILBBI/tY036YQiphuiiV1vB+yz68Lrij8Li/rdMaSCIQmrOVI4eIt8B61r5oU46ePlwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:39.746501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04651","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5516525f75aca938bfcc18bfd8a6a6185f654b7e19f537cb428bb914f598316","sha256:dcaf7d2a46cbbb75291dc833daa4f9b0979f1fb35a71966ca9d2c1da3c55ea12"],"state_sha256":"3dca5d1675bb77a9bb95239e0afede8e6380c1c8b51b5eda6f63f1a17ae07f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"047VlPHWe36ayKM+HfWqR5AFjZP/IZGGaLRkatKalOn3rU9fYSu7Kc+NdCidb54QZ5N3XV4cz4Z46z/XYGArCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:17:17.554095Z","bundle_sha256":"d367611ee952e36d03444c08c5c28b77f6d3aedb93ca6efac122fb580f2b4728"}}