{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:J34FX2BT3JIDQIG4VAZ4VNMYZT","short_pith_number":"pith:J34FX2BT","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"},"canonical_sha256":"4ef85be833da503820dca833cab598ccf17323929543311fc3ecf84a0b44fbb0","source":{"kind":"arxiv","id":"1509.09047","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09047","created_at":"2026-05-18T01:07:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09047v4","created_at":"2026-05-18T01:07:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09047","created_at":"2026-05-18T01:07:58Z"},{"alias_kind":"pith_short_12","alias_value":"J34FX2BT3JID","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J34FX2BT3JIDQIG4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J34FX2BT","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:J34FX2BT3JIDQIG4VAZ4VNMYZT","target":"record","payload":{"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"},"canonical_sha256":"4ef85be833da503820dca833cab598ccf17323929543311fc3ecf84a0b44fbb0","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"},"source_kind":"arxiv","source_id":"1509.09047","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-18T01:07:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDIrnnX3qD33Pw5vrEFYxplwM3nPStvbUi1hzt9Oxl+nOaxmrR4xGZ5sba9D+THT6Fs+6GucqdSz6o9MWutICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:42:14.914456Z"},"content_sha256":"a8c6e6bef984c3ba7682aa7c36874b0fd1284f9501f1c1323ec265061da760d4","schema_version":"1.0","event_id":"sha256:a8c6e6bef984c3ba7682aa7c36874b0fd1284f9501f1c1323ec265061da760d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:J34FX2BT3JIDQIG4VAZ4VNMYZT","target":"graph","payload":{"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"},"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-18T01:07:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czJNvyRYA+oEeoYIGwhEPWKpGbUwl74z/yJevKispCBqm8UcTkY0nNBNecLMuS8Yj/SqZYvVp/qWkL3XB2hiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:42:14.914806Z"},"content_sha256":"ac55748b38a408d13161f238ae785cc36685fe9a0797a293a32d982fb7453b07","schema_version":"1.0","event_id":"sha256:ac55748b38a408d13161f238ae785cc36685fe9a0797a293a32d982fb7453b07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/bundle.json","state_url":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/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-29T08:42:14Z","links":{"resolver":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT","bundle":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/bundle.json","state":"https://pith.science/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J34FX2BT3JIDQIG4VAZ4VNMYZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J34FX2BT3JIDQIG4VAZ4VNMYZT","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":"a885ab8311f4bd7a443746e5f85fa6ea688c9b0dc79de07ceae8eb57e8aaf9f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-30T07:51:48Z","title_canon_sha256":"fb3a9fc4b8b6c68cb4cbc767e4a4ba869cbeb78fa19f535d2012e243a1c42508"},"schema_version":"1.0","source":{"id":"1509.09047","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09047","created_at":"2026-05-18T01:07:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09047v4","created_at":"2026-05-18T01:07:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09047","created_at":"2026-05-18T01:07:58Z"},{"alias_kind":"pith_short_12","alias_value":"J34FX2BT3JID","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J34FX2BT3JIDQIG4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J34FX2BT","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:ac55748b38a408d13161f238ae785cc36685fe9a0797a293a32d982fb7453b07","target":"graph","created_at":"2026-05-18T01:07:58Z","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":"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","authors_text":"Christoph Lenzen, Stephan Friedrichs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-30T07:51:48Z","title":"Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09047","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:a8c6e6bef984c3ba7682aa7c36874b0fd1284f9501f1c1323ec265061da760d4","target":"record","created_at":"2026-05-18T01:07:58Z","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":"a885ab8311f4bd7a443746e5f85fa6ea688c9b0dc79de07ceae8eb57e8aaf9f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-30T07:51:48Z","title_canon_sha256":"fb3a9fc4b8b6c68cb4cbc767e4a4ba869cbeb78fa19f535d2012e243a1c42508"},"schema_version":"1.0","source":{"id":"1509.09047","kind":"arxiv","version":4}},"canonical_sha256":"4ef85be833da503820dca833cab598ccf17323929543311fc3ecf84a0b44fbb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ef85be833da503820dca833cab598ccf17323929543311fc3ecf84a0b44fbb0","first_computed_at":"2026-05-18T01:07:58.450597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:58.450597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"npFFKUlX1ssTa9w2cAlGUkoUkDQMU/7mHk1kkSpooASFlEnzjLjmVDFq1CtObb8dvvqHR6MrEvjBWEpnaUTPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:58.450996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09047","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8c6e6bef984c3ba7682aa7c36874b0fd1284f9501f1c1323ec265061da760d4","sha256:ac55748b38a408d13161f238ae785cc36685fe9a0797a293a32d982fb7453b07"],"state_sha256":"0edd97ce42d5158b039b51cda205408f67f2997da8cdaf8b51d9370af818197f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIgX6dnJqrn+m/qMl2d8tCtLi3QihCubI6CQootagtWYmdee6YNxdOOcMISc57nfD+Ac2RgFxTJfp2TFYkIwBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:42:14.916656Z","bundle_sha256":"98b7484ee39888e9558975aeb039e570e77bf9c563e6f046b0375a243ea5b234"}}