{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J34FX2BT3JIDQIG4VAZ4VNMYZT","short_pith_number":"pith:J34FX2BT","schema_version":"1.0","canonical_sha256":"4ef85be833da503820dca833cab598ccf17323929543311fc3ecf84a0b44fbb0","source":{"kind":"arxiv","id":"1509.09047","version":4},"attestation_state":"computed","paper":{"title":"Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Stephan Friedrichs","submitted_at":"2015-09-30T07:51:48Z","abstract_excerpt":"A \\emph{metric tree embedding} of expected \\emph{stretch~$\\alpha \\geq 1$} maps a weighted $n$-node graph $G = (V, E, \\omega)$ to a weighted tree $T = (V_T, E_T, \\omega_T)$ with $V \\subseteq V_T$ such that, for all $v,w \\in V$, $\\operatorname{dist}(v, w, G) \\leq \\operatorname{dist}(v, w, T)$ and $operatorname{E}[\\operatorname{dist}(v, w, T)] \\leq \\alpha \\operatorname{dist}(v, w, G)$. Such embeddings are highly useful for designing fast approximation algorithms, as many hard problems are easy to solve on tree instances. However, to date the best parallel $(\\operatorname{polylog} n)$-depth algori"},"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":"1509.09047","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-30T07:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"fb3a9fc4b8b6c68cb4cbc767e4a4ba869cbeb78fa19f535d2012e243a1c42508","abstract_canon_sha256":"a885ab8311f4bd7a443746e5f85fa6ea688c9b0dc79de07ceae8eb57e8aaf9f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:58.450996Z","signature_b64":"npFFKUlX1ssTa9w2cAlGUkoUkDQMU/7mHk1kkSpooASFlEnzjLjmVDFq1CtObb8dvvqHR6MrEvjBWEpnaUTPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ef85be833da503820dca833cab598ccf17323929543311fc3ecf84a0b44fbb0","last_reissued_at":"2026-05-18T01:07:58.450597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:58.450597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Stephan Friedrichs","submitted_at":"2015-09-30T07:51:48Z","abstract_excerpt":"A \\emph{metric tree embedding} of expected \\emph{stretch~$\\alpha \\geq 1$} maps a weighted $n$-node graph $G = (V, E, \\omega)$ to a weighted tree $T = (V_T, E_T, \\omega_T)$ with $V \\subseteq V_T$ such that, for all $v,w \\in V$, $\\operatorname{dist}(v, w, G) \\leq \\operatorname{dist}(v, w, T)$ and $operatorname{E}[\\operatorname{dist}(v, w, T)] \\leq \\alpha \\operatorname{dist}(v, w, G)$. Such embeddings are highly useful for designing fast approximation algorithms, as many hard problems are easy to solve on tree instances. However, to date the best parallel $(\\operatorname{polylog} n)$-depth algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09047","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":"1509.09047","created_at":"2026-05-18T01:07:58.450657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.09047v4","created_at":"2026-05-18T01:07:58.450657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09047","created_at":"2026-05-18T01:07:58.450657+00:00"},{"alias_kind":"pith_short_12","alias_value":"J34FX2BT3JID","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J34FX2BT3JIDQIG4","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J34FX2BT","created_at":"2026-05-18T12:29:27.538025+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/J34FX2BT3JIDQIG4VAZ4VNMYZT","json":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT.json","graph_json":"https://pith.science/api/pith-number/J34FX2BT3JIDQIG4VAZ4VNMYZT/graph.json","events_json":"https://pith.science/api/pith-number/J34FX2BT3JIDQIG4VAZ4VNMYZT/events.json","paper":"https://pith.science/paper/J34FX2BT"},"agent_actions":{"view_html":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT","download_json":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT.json","view_paper":"https://pith.science/paper/J34FX2BT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.09047&json=true","fetch_graph":"https://pith.science/api/pith-number/J34FX2BT3JIDQIG4VAZ4VNMYZT/graph.json","fetch_events":"https://pith.science/api/pith-number/J34FX2BT3JIDQIG4VAZ4VNMYZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/action/storage_attestation","attest_author":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/action/author_attestation","sign_citation":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/action/citation_signature","submit_replication":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/action/replication_record"}},"created_at":"2026-05-18T01:07:58.450657+00:00","updated_at":"2026-05-18T01:07:58.450657+00:00"}