{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2SUFMMW4XHV2SR6AOSM5PQB736","short_pith_number":"pith:2SUFMMW4","schema_version":"1.0","canonical_sha256":"d4a85632dcb9eba947c07499d7c03fdf9b138255b6f4c79d2c58020283bb295c","source":{"kind":"arxiv","id":"1605.04651","version":4},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.04651","created_at":"2026-05-18T00:43:39.746061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04651v4","created_at":"2026-05-18T00:43:39.746061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04651","created_at":"2026-05-18T00:43:39.746061+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SUFMMW4XHV2","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SUFMMW4XHV2SR6A","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SUFMMW4","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736","json":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736.json","graph_json":"https://pith.science/api/pith-number/2SUFMMW4XHV2SR6AOSM5PQB736/graph.json","events_json":"https://pith.science/api/pith-number/2SUFMMW4XHV2SR6AOSM5PQB736/events.json","paper":"https://pith.science/paper/2SUFMMW4"},"agent_actions":{"view_html":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736","download_json":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736.json","view_paper":"https://pith.science/paper/2SUFMMW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04651&json=true","fetch_graph":"https://pith.science/api/pith-number/2SUFMMW4XHV2SR6AOSM5PQB736/graph.json","fetch_events":"https://pith.science/api/pith-number/2SUFMMW4XHV2SR6AOSM5PQB736/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/action/storage_attestation","attest_author":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/action/author_attestation","sign_citation":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/action/citation_signature","submit_replication":"https://pith.science/pith/2SUFMMW4XHV2SR6AOSM5PQB736/action/replication_record"}},"created_at":"2026-05-18T00:43:39.746061+00:00","updated_at":"2026-05-18T00:43:39.746061+00:00"}